./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:57:03,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:57:03,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 16:57:03,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:57:03,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:57:03,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:57:03,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:57:03,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:57:03,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:57:03,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:57:03,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:57:03,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:57:03,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:57:03,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:57:03,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:57:03,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:57:03,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:57:03,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:57:03,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:57:03,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:57:03,944 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:57:03,944 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:57:03,945 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:57:03,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:57:03,945 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:57:03,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:57:03,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:57:03,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:57:03,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:57:03,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:57:03,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:57:03,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:57:03,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:57:03,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:57:03,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:57:03,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:57:03,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 16:57:03,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 16:57:03,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:57:03,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:57:03,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:57:03,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:57:03,953 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 [2024-11-20 16:57:04,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:57:04,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:57:04,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:57:04,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:57:04,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:57:04,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2024-11-20 16:57:06,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:57:06,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:57:06,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2024-11-20 16:57:06,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b19f85/4c2cb6d3cdbe4d839619339fd6b8c4aa/FLAG73890de1b [2024-11-20 16:57:06,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b19f85/4c2cb6d3cdbe4d839619339fd6b8c4aa [2024-11-20 16:57:06,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:57:06,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:57:06,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:57:06,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:57:06,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:57:06,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:57:06" (1/1) ... [2024-11-20 16:57:06,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de6d20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:06, skipping insertion in model container [2024-11-20 16:57:06,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:57:06" (1/1) ... [2024-11-20 16:57:06,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:57:07,239 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,282 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,287 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,293 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,304 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,351 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,352 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,354 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,355 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,360 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,360 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,364 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:07,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:57:07,393 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-20 16:57:07,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@205a34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:07, skipping insertion in model container [2024-11-20 16:57:07,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:57:07,395 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 16:57:07,397 INFO L158 Benchmark]: Toolchain (without parser) took 690.63ms. Allocated memory is still 157.3MB. Free memory was 117.4MB in the beginning and 94.4MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 16:57:07,398 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 89.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 16:57:07,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.38ms. Allocated memory is still 157.3MB. Free memory was 116.8MB in the beginning and 94.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 16:57:07,399 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 89.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.38ms. Allocated memory is still 157.3MB. Free memory was 116.8MB in the beginning and 94.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:57:09,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:57:09,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 16:57:09,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:57:09,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:57:09,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:57:09,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:57:09,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:57:09,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:57:09,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:57:09,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:57:09,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:57:09,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:57:09,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:57:09,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:57:09,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:57:09,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:57:09,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:57:09,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:57:09,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:57:09,666 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:57:09,667 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:57:09,668 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:57:09,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:57:09,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:57:09,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 16:57:09,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:57:09,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 16:57:09,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:57:09,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:57:09,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:57:09,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:57:09,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:57:09,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:57:09,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:57:09,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:57:09,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:57:09,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:57:09,678 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 16:57:09,678 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 16:57:09,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:57:09,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:57:09,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:57:09,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:57:09,680 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 [2024-11-20 16:57:10,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:57:10,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:57:10,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:57:10,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:57:10,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:57:10,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2024-11-20 16:57:11,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:57:12,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:57:12,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2024-11-20 16:57:12,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fdf6aa6b/6dadf0cb07c04ab089afff3c3740f2d8/FLAGd38ac017c [2024-11-20 16:57:12,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fdf6aa6b/6dadf0cb07c04ab089afff3c3740f2d8 [2024-11-20 16:57:12,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:57:12,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:57:12,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:57:12,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:57:12,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:57:12,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:57:12" (1/1) ... [2024-11-20 16:57:12,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25340045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:12, skipping insertion in model container [2024-11-20 16:57:12,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:57:12" (1/1) ... [2024-11-20 16:57:12,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:57:12,800 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,850 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,859 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,867 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,876 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,929 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,942 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,942 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,943 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,951 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:12,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:57:12,982 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 16:57:12,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:57:13,024 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,044 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,050 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,056 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,059 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,107 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,112 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,117 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,118 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,120 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,121 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,124 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:13,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:57:13,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 16:57:13,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:57:13,295 INFO L204 MainTranslator]: Completed translation [2024-11-20 16:57:13,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13 WrapperNode [2024-11-20 16:57:13,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:57:13,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 16:57:13,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 16:57:13,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 16:57:13,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,409 INFO L138 Inliner]: procedures = 180, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1069 [2024-11-20 16:57:13,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 16:57:13,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 16:57:13,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 16:57:13,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 16:57:13,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,536 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [219, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-11-20 16:57:13,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 16:57:13,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 16:57:13,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 16:57:13,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 16:57:13,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (1/1) ... [2024-11-20 16:57:13,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:57:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 16:57:13,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 16:57:13,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 16:57:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 16:57:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 16:57:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 16:57:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 16:57:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 16:57:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 16:57:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 16:57:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 16:57:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 16:57:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 16:57:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 16:57:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 16:57:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 16:57:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 16:57:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 16:57:13,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 16:57:13,993 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 16:57:13,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 16:57:14,019 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:57:14,058 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:57:14,083 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:57:17,942 INFO L? ?]: Removed 1092 outVars from TransFormulas that were not future-live. [2024-11-20 16:57:17,942 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 16:57:17,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 16:57:17,995 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-20 16:57:17,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:57:17 BoogieIcfgContainer [2024-11-20 16:57:17,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 16:57:17,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 16:57:18,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 16:57:18,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 16:57:18,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:57:12" (1/3) ... [2024-11-20 16:57:18,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc0a54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:57:18, skipping insertion in model container [2024-11-20 16:57:18,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:13" (2/3) ... [2024-11-20 16:57:18,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc0a54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:57:18, skipping insertion in model container [2024-11-20 16:57:18,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:57:17" (3/3) ... [2024-11-20 16:57:18,006 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-1.i [2024-11-20 16:57:18,024 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 16:57:18,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 527 error locations. [2024-11-20 16:57:18,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 16:57:18,110 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;@5fe16246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 16:57:18,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 527 error locations. [2024-11-20 16:57:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 1074 states, 536 states have (on average 2.218283582089552) internal successors, (1189), 1067 states have internal predecessors, (1189), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-20 16:57:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 16:57:18,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:18,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 16:57:18,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:18,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-20 16:57:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082689181] [2024-11-20 16:57:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:18,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-11-20 16:57:18,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:18,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:18,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 16:57:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:18,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:18,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:18,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:57:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:18,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:18,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082689181] [2024-11-20 16:57:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082689181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:18,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837109671] [2024-11-20 16:57:18,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:18,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:18,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:18,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:18,462 INFO L87 Difference]: Start difference. First operand has 1074 states, 536 states have (on average 2.218283582089552) internal successors, (1189), 1067 states have internal predecessors, (1189), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:20,173 INFO L93 Difference]: Finished difference Result 1069 states and 1135 transitions. [2024-11-20 16:57:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:20,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 16:57:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:20,200 INFO L225 Difference]: With dead ends: 1069 [2024-11-20 16:57:20,200 INFO L226 Difference]: Without dead ends: 1067 [2024-11-20 16:57:20,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:20,206 INFO L432 NwaCegarLoop]: 652 mSDtfsCounter, 979 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:20,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 715 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 16:57:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-20 16:57:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1059. [2024-11-20 16:57:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 538 states have (on average 2.057620817843866) internal successors, (1107), 1052 states have internal predecessors, (1107), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1125 transitions. [2024-11-20 16:57:20,291 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1125 transitions. Word has length 3 [2024-11-20 16:57:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1125 transitions. [2024-11-20 16:57:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1125 transitions. [2024-11-20 16:57:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 16:57:20,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:20,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 16:57:20,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 16:57:20,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:20,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:20,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-20 16:57:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293208514] [2024-11-20 16:57:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:20,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:20,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:20,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:20,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 16:57:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:20,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:20,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:20,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:57:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:20,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:20,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293208514] [2024-11-20 16:57:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293208514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:20,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036988026] [2024-11-20 16:57:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:20,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:20,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:20,661 INFO L87 Difference]: Start difference. First operand 1059 states and 1125 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:22,929 INFO L93 Difference]: Finished difference Result 1477 states and 1585 transitions. [2024-11-20 16:57:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:22,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 16:57:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:22,935 INFO L225 Difference]: With dead ends: 1477 [2024-11-20 16:57:22,935 INFO L226 Difference]: Without dead ends: 1477 [2024-11-20 16:57:22,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:22,937 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 448 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:22,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1517 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 16:57:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-11-20 16:57:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1267. [2024-11-20 16:57:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 747 states have (on average 2.0468540829986615) internal successors, (1529), 1260 states have internal predecessors, (1529), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1547 transitions. [2024-11-20 16:57:22,972 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1547 transitions. Word has length 3 [2024-11-20 16:57:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:22,972 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1547 transitions. [2024-11-20 16:57:22,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1547 transitions. [2024-11-20 16:57:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 16:57:22,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:22,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:22,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 16:57:23,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:23,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:23,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-20 16:57:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822936324] [2024-11-20 16:57:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:23,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:23,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:23,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 16:57:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:23,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:57:23,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:23,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:57:23,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:57:23,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:57:23,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 16:57:23,452 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:57:23,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 16:57:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:23,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:23,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822936324] [2024-11-20 16:57:23,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822936324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534194861] [2024-11-20 16:57:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:23,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:23,489 INFO L87 Difference]: Start difference. First operand 1267 states and 1547 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:25,607 INFO L93 Difference]: Finished difference Result 1269 states and 1551 transitions. [2024-11-20 16:57:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:25,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 16:57:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:25,611 INFO L225 Difference]: With dead ends: 1269 [2024-11-20 16:57:25,612 INFO L226 Difference]: Without dead ends: 1269 [2024-11-20 16:57:25,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:25,613 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 2047 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:25,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 424 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 16:57:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-20 16:57:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1047. [2024-11-20 16:57:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 538 states have (on average 2.033457249070632) internal successors, (1094), 1040 states have internal predecessors, (1094), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1112 transitions. [2024-11-20 16:57:25,635 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1112 transitions. Word has length 7 [2024-11-20 16:57:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:25,635 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1112 transitions. [2024-11-20 16:57:25,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1112 transitions. [2024-11-20 16:57:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 16:57:25,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:25,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:25,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:25,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:25,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:25,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-20 16:57:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824885491] [2024-11-20 16:57:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:25,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:25,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:25,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:25,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 16:57:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:25,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:25,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:26,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:57:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:26,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:26,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:26,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824885491] [2024-11-20 16:57:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824885491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493123610] [2024-11-20 16:57:26,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:26,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:26,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:26,052 INFO L87 Difference]: Start difference. First operand 1047 states and 1112 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:28,313 INFO L93 Difference]: Finished difference Result 1518 states and 1620 transitions. [2024-11-20 16:57:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:28,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 16:57:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:28,320 INFO L225 Difference]: With dead ends: 1518 [2024-11-20 16:57:28,321 INFO L226 Difference]: Without dead ends: 1518 [2024-11-20 16:57:28,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:28,322 INFO L432 NwaCegarLoop]: 1199 mSDtfsCounter, 691 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:28,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1643 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 16:57:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-20 16:57:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1074. [2024-11-20 16:57:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 575 states have (on average 2.0208695652173914) internal successors, (1162), 1067 states have internal predecessors, (1162), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1180 transitions. [2024-11-20 16:57:28,350 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1180 transitions. Word has length 8 [2024-11-20 16:57:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:28,350 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1180 transitions. [2024-11-20 16:57:28,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1180 transitions. [2024-11-20 16:57:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 16:57:28,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:28,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:28,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 16:57:28,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:28,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:28,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-20 16:57:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608000860] [2024-11-20 16:57:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:28,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:28,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:28,558 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:28,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 16:57:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:28,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:28,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:28,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:57:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:28,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:28,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:28,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608000860] [2024-11-20 16:57:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608000860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:28,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020207587] [2024-11-20 16:57:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:28,702 INFO L87 Difference]: Start difference. First operand 1074 states and 1180 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:30,027 INFO L93 Difference]: Finished difference Result 1407 states and 1539 transitions. [2024-11-20 16:57:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:30,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 16:57:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:30,031 INFO L225 Difference]: With dead ends: 1407 [2024-11-20 16:57:30,031 INFO L226 Difference]: Without dead ends: 1407 [2024-11-20 16:57:30,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:30,032 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 939 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:30,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1216 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 16:57:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-11-20 16:57:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1025. [2024-11-20 16:57:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 575 states have (on average 1.9286956521739131) internal successors, (1109), 1018 states have internal predecessors, (1109), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1127 transitions. [2024-11-20 16:57:30,053 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1127 transitions. Word has length 8 [2024-11-20 16:57:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:30,053 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1127 transitions. [2024-11-20 16:57:30,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1127 transitions. [2024-11-20 16:57:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 16:57:30,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:30,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:30,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:30,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:30,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:30,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -285594881, now seen corresponding path program 1 times [2024-11-20 16:57:30,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:30,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189533319] [2024-11-20 16:57:30,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:30,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:30,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:30,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:30,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 16:57:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:30,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 16:57:30,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:30,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:30,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189533319] [2024-11-20 16:57:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189533319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940009504] [2024-11-20 16:57:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:30,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:30,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:30,452 INFO L87 Difference]: Start difference. First operand 1025 states and 1127 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:30,941 INFO L93 Difference]: Finished difference Result 1450 states and 1607 transitions. [2024-11-20 16:57:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 16:57:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:30,946 INFO L225 Difference]: With dead ends: 1450 [2024-11-20 16:57:30,946 INFO L226 Difference]: Without dead ends: 1450 [2024-11-20 16:57:30,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:30,947 INFO L432 NwaCegarLoop]: 1113 mSDtfsCounter, 449 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:30,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 3084 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 16:57:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2024-11-20 16:57:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1270. [2024-11-20 16:57:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 820 states have (on average 1.9134146341463414) internal successors, (1569), 1263 states have internal predecessors, (1569), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1587 transitions. [2024-11-20 16:57:30,972 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1587 transitions. Word has length 11 [2024-11-20 16:57:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:30,973 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1587 transitions. [2024-11-20 16:57:30,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1587 transitions. [2024-11-20 16:57:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 16:57:30,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:30,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:30,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 16:57:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:31,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr525ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:31,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash -263505449, now seen corresponding path program 1 times [2024-11-20 16:57:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752396103] [2024-11-20 16:57:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:31,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:31,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:31,179 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:31,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 16:57:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:31,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 16:57:31,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:31,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:57:31,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:57:31,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:57:31,338 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 30 treesize of output 39 [2024-11-20 16:57:31,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 16:57:31,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-20 16:57:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:31,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:31,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752396103] [2024-11-20 16:57:31,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752396103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:31,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:31,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:31,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124023654] [2024-11-20 16:57:31,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:31,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:31,412 INFO L87 Difference]: Start difference. First operand 1270 states and 1587 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:31,738 INFO L93 Difference]: Finished difference Result 2189 states and 2611 transitions. [2024-11-20 16:57:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:31,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-20 16:57:31,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:31,744 INFO L225 Difference]: With dead ends: 2189 [2024-11-20 16:57:31,744 INFO L226 Difference]: Without dead ends: 2189 [2024-11-20 16:57:31,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:31,745 INFO L432 NwaCegarLoop]: 1225 mSDtfsCounter, 964 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:31,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 3443 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 16:57:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2024-11-20 16:57:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1269. [2024-11-20 16:57:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 819 states have (on average 1.9133089133089134) internal successors, (1567), 1262 states have internal predecessors, (1567), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1585 transitions. [2024-11-20 16:57:31,769 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1585 transitions. Word has length 12 [2024-11-20 16:57:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:31,769 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1585 transitions. [2024-11-20 16:57:31,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1585 transitions. [2024-11-20 16:57:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 16:57:31,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:31,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:31,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-20 16:57:31,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:31,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:31,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-20 16:57:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416976097] [2024-11-20 16:57:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:31,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-11-20 16:57:31,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:31,973 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:31,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 16:57:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:32,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:57:32,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:32,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:32,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416976097] [2024-11-20 16:57:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416976097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177413579] [2024-11-20 16:57:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:32,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:32,157 INFO L87 Difference]: Start difference. First operand 1269 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:32,182 INFO L93 Difference]: Finished difference Result 1209 states and 1499 transitions. [2024-11-20 16:57:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:32,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 16:57:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:32,185 INFO L225 Difference]: With dead ends: 1209 [2024-11-20 16:57:32,185 INFO L226 Difference]: Without dead ends: 1209 [2024-11-20 16:57:32,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:32,186 INFO L432 NwaCegarLoop]: 990 mSDtfsCounter, 71 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:32,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1917 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-20 16:57:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-20 16:57:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 783 states have (on average 1.8914431673052363) internal successors, (1481), 1202 states have internal predecessors, (1481), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1499 transitions. [2024-11-20 16:57:32,207 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1499 transitions. Word has length 18 [2024-11-20 16:57:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:32,207 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1499 transitions. [2024-11-20 16:57:32,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1499 transitions. [2024-11-20 16:57:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 16:57:32,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:32,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:32,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:32,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:32,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:32,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-20 16:57:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:32,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207348752] [2024-11-20 16:57:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:32,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:32,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:32,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:32,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 16:57:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:32,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:32,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:32,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:32,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207348752] [2024-11-20 16:57:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207348752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:32,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:32,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138049712] [2024-11-20 16:57:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:32,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:32,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:32,604 INFO L87 Difference]: Start difference. First operand 1209 states and 1499 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:32,661 INFO L93 Difference]: Finished difference Result 1179 states and 1441 transitions. [2024-11-20 16:57:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:57:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 16:57:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:32,664 INFO L225 Difference]: With dead ends: 1179 [2024-11-20 16:57:32,665 INFO L226 Difference]: Without dead ends: 1179 [2024-11-20 16:57:32,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:32,665 INFO L432 NwaCegarLoop]: 945 mSDtfsCounter, 48 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:32,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2809 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-11-20 16:57:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2024-11-20 16:57:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 767 states have (on average 1.8552803129074316) internal successors, (1423), 1172 states have internal predecessors, (1423), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1441 transitions. [2024-11-20 16:57:32,683 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1441 transitions. Word has length 20 [2024-11-20 16:57:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:32,683 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1441 transitions. [2024-11-20 16:57:32,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1441 transitions. [2024-11-20 16:57:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 16:57:32,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:32,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:32,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 16:57:32,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:32,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:32,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:32,886 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-20 16:57:32,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:32,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791718415] [2024-11-20 16:57:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:32,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:32,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:32,887 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:32,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 16:57:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:33,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:33,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:33,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:57:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:33,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:33,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791718415] [2024-11-20 16:57:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791718415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137904124] [2024-11-20 16:57:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:33,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:33,151 INFO L87 Difference]: Start difference. First operand 1179 states and 1441 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:34,921 INFO L93 Difference]: Finished difference Result 1639 states and 2022 transitions. [2024-11-20 16:57:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 16:57:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:34,927 INFO L225 Difference]: With dead ends: 1639 [2024-11-20 16:57:34,927 INFO L226 Difference]: Without dead ends: 1639 [2024-11-20 16:57:34,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:34,928 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 872 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:34,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1222 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 16:57:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-20 16:57:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1175. [2024-11-20 16:57:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 767 states have (on average 1.8448500651890483) internal successors, (1415), 1168 states have internal predecessors, (1415), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1433 transitions. [2024-11-20 16:57:34,960 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1433 transitions. Word has length 34 [2024-11-20 16:57:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:34,961 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1433 transitions. [2024-11-20 16:57:34,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1433 transitions. [2024-11-20 16:57:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 16:57:34,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:34,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:34,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:35,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-20 16:57:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428926430] [2024-11-20 16:57:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:35,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:35,167 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:35,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 16:57:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:35,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:57:35,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:35,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:57:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:35,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:35,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:35,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428926430] [2024-11-20 16:57:35,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428926430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:35,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:35,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082868945] [2024-11-20 16:57:35,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:35,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:35,538 INFO L87 Difference]: Start difference. First operand 1175 states and 1433 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:37,978 INFO L93 Difference]: Finished difference Result 1780 states and 2186 transitions. [2024-11-20 16:57:37,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:37,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 16:57:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:37,983 INFO L225 Difference]: With dead ends: 1780 [2024-11-20 16:57:37,984 INFO L226 Difference]: Without dead ends: 1780 [2024-11-20 16:57:37,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:37,984 INFO L432 NwaCegarLoop]: 1209 mSDtfsCounter, 620 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:37,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2420 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 16:57:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2024-11-20 16:57:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1171. [2024-11-20 16:57:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 767 states have (on average 1.834419817470665) internal successors, (1407), 1164 states have internal predecessors, (1407), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1425 transitions. [2024-11-20 16:57:38,002 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1425 transitions. Word has length 34 [2024-11-20 16:57:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:38,003 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1425 transitions. [2024-11-20 16:57:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1425 transitions. [2024-11-20 16:57:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 16:57:38,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:38,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:38,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:38,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:38,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-20 16:57:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:38,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058653647] [2024-11-20 16:57:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:38,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:38,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:38,210 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:38,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 16:57:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:38,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:38,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:38,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:38,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:38,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058653647] [2024-11-20 16:57:38,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058653647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962038615] [2024-11-20 16:57:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:38,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:38,470 INFO L87 Difference]: Start difference. First operand 1171 states and 1425 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:38,536 INFO L93 Difference]: Finished difference Result 1159 states and 1405 transitions. [2024-11-20 16:57:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:57:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-20 16:57:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:38,540 INFO L225 Difference]: With dead ends: 1159 [2024-11-20 16:57:38,540 INFO L226 Difference]: Without dead ends: 1159 [2024-11-20 16:57:38,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:38,541 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 21 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:38,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2786 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-20 16:57:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2024-11-20 16:57:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 755 states have (on average 1.8370860927152317) internal successors, (1387), 1152 states have internal predecessors, (1387), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1405 transitions. [2024-11-20 16:57:38,558 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1405 transitions. Word has length 53 [2024-11-20 16:57:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:38,558 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1405 transitions. [2024-11-20 16:57:38,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1405 transitions. [2024-11-20 16:57:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 16:57:38,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:38,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:38,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-20 16:57:38,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:38,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:38,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-20 16:57:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953164391] [2024-11-20 16:57:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:38,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:38,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:38,765 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:38,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 16:57:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:39,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 16:57:39,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:39,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:57:39,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:57:39,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:57:39,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 16:57:39,711 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:57:39,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 16:57:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:39,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:39,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:39,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953164391] [2024-11-20 16:57:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953164391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:39,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184670043] [2024-11-20 16:57:39,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:39,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:39,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:39,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:39,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:39,732 INFO L87 Difference]: Start difference. First operand 1159 states and 1405 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:41,595 INFO L93 Difference]: Finished difference Result 1577 states and 1948 transitions. [2024-11-20 16:57:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-20 16:57:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:41,599 INFO L225 Difference]: With dead ends: 1577 [2024-11-20 16:57:41,599 INFO L226 Difference]: Without dead ends: 1577 [2024-11-20 16:57:41,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:41,600 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1981 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:41,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 528 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 16:57:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2024-11-20 16:57:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1084. [2024-11-20 16:57:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 718 states have (on average 1.775766016713092) internal successors, (1275), 1077 states have internal predecessors, (1275), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1293 transitions. [2024-11-20 16:57:41,615 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1293 transitions. Word has length 61 [2024-11-20 16:57:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1293 transitions. [2024-11-20 16:57:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1293 transitions. [2024-11-20 16:57:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 16:57:41,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:41,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:41,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:41,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:41,818 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:41,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-20 16:57:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276504143] [2024-11-20 16:57:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:41,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:41,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:41,822 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:41,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 16:57:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:42,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 16:57:42,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:42,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:57:42,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:42,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 16:57:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:42,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:42,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276504143] [2024-11-20 16:57:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276504143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:42,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:42,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:42,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110480357] [2024-11-20 16:57:42,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:42,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:57:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:42,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:57:42,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:42,109 INFO L87 Difference]: Start difference. First operand 1084 states and 1293 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:43,830 INFO L93 Difference]: Finished difference Result 1083 states and 1292 transitions. [2024-11-20 16:57:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:57:43,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-20 16:57:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:43,833 INFO L225 Difference]: With dead ends: 1083 [2024-11-20 16:57:43,833 INFO L226 Difference]: Without dead ends: 1083 [2024-11-20 16:57:43,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:57:43,834 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 2 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:43,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2376 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 16:57:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-20 16:57:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2024-11-20 16:57:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 718 states have (on average 1.7743732590529249) internal successors, (1274), 1076 states have internal predecessors, (1274), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1292 transitions. [2024-11-20 16:57:43,848 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1292 transitions. Word has length 66 [2024-11-20 16:57:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:43,848 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1292 transitions. [2024-11-20 16:57:43,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1292 transitions. [2024-11-20 16:57:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 16:57:43,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:43,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:43,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:44,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:44,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:44,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-20 16:57:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:44,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421970364] [2024-11-20 16:57:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:44,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:44,053 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:44,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 16:57:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:44,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 16:57:44,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:44,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:57:44,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 16:57:44,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:44,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-20 16:57:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:44,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:44,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421970364] [2024-11-20 16:57:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421970364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:44,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:44,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724575214] [2024-11-20 16:57:44,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:44,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:57:44,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:44,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:57:44,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:44,463 INFO L87 Difference]: Start difference. First operand 1083 states and 1292 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:46,590 INFO L93 Difference]: Finished difference Result 1082 states and 1291 transitions. [2024-11-20 16:57:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:57:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-20 16:57:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:46,594 INFO L225 Difference]: With dead ends: 1082 [2024-11-20 16:57:46,594 INFO L226 Difference]: Without dead ends: 1082 [2024-11-20 16:57:46,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:57:46,594 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 1 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:46,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2410 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 16:57:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-11-20 16:57:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2024-11-20 16:57:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 717 states have (on average 1.7754532775453278) internal successors, (1273), 1075 states have internal predecessors, (1273), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1291 transitions. [2024-11-20 16:57:46,612 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1291 transitions. Word has length 66 [2024-11-20 16:57:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:46,613 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1291 transitions. [2024-11-20 16:57:46,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1291 transitions. [2024-11-20 16:57:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 16:57:46,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:46,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:46,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-20 16:57:46,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:46,819 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1167194854, now seen corresponding path program 1 times [2024-11-20 16:57:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25800408] [2024-11-20 16:57:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:46,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:46,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:46,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:46,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 16:57:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:47,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:47,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:47,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:47,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:47,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25800408] [2024-11-20 16:57:47,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25800408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:47,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:47,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:47,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249367249] [2024-11-20 16:57:47,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:47,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:47,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:47,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:47,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:47,159 INFO L87 Difference]: Start difference. First operand 1082 states and 1291 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:57:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:47,205 INFO L93 Difference]: Finished difference Result 1085 states and 1295 transitions. [2024-11-20 16:57:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:47,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-20 16:57:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:47,213 INFO L225 Difference]: With dead ends: 1085 [2024-11-20 16:57:47,213 INFO L226 Difference]: Without dead ends: 1085 [2024-11-20 16:57:47,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:47,214 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 0 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:47,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2731 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-20 16:57:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2024-11-20 16:57:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 719 states have (on average 1.7746870653685674) internal successors, (1276), 1078 states have internal predecessors, (1276), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-20 16:57:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1295 transitions. [2024-11-20 16:57:47,236 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1295 transitions. Word has length 74 [2024-11-20 16:57:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:47,237 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1295 transitions. [2024-11-20 16:57:47,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:57:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1295 transitions. [2024-11-20 16:57:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 16:57:47,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:47,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:47,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:47,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:47,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:47,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1501076321, now seen corresponding path program 1 times [2024-11-20 16:57:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858231688] [2024-11-20 16:57:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:47,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:47,445 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:47,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 16:57:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:47,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:47,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:47,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:47,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:47,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858231688] [2024-11-20 16:57:47,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858231688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:47,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:47,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 16:57:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343860391] [2024-11-20 16:57:47,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:47,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 16:57:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 16:57:47,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 16:57:47,796 INFO L87 Difference]: Start difference. First operand 1085 states and 1295 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:47,928 INFO L93 Difference]: Finished difference Result 1097 states and 1312 transitions. [2024-11-20 16:57:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 16:57:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-20 16:57:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:47,934 INFO L225 Difference]: With dead ends: 1097 [2024-11-20 16:57:47,934 INFO L226 Difference]: Without dead ends: 1097 [2024-11-20 16:57:47,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-20 16:57:47,935 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 5 mSDsluCounter, 5447 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6359 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:47,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6359 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:57:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-20 16:57:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1095. [2024-11-20 16:57:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 1087 states have internal predecessors, (1291), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-20 16:57:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1310 transitions. [2024-11-20 16:57:47,954 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1310 transitions. Word has length 75 [2024-11-20 16:57:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:47,954 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1310 transitions. [2024-11-20 16:57:47,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1310 transitions. [2024-11-20 16:57:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 16:57:47,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:47,955 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:47,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-20 16:57:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:48,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1938087642, now seen corresponding path program 2 times [2024-11-20 16:57:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614898167] [2024-11-20 16:57:48,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 16:57:48,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:48,161 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:48,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 16:57:48,586 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 16:57:48,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:48,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 16:57:48,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:48,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:48,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614898167] [2024-11-20 16:57:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614898167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:48,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:48,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 16:57:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745933497] [2024-11-20 16:57:48,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:48,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 16:57:48,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:48,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 16:57:48,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 16:57:48,850 INFO L87 Difference]: Start difference. First operand 1095 states and 1310 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:49,213 INFO L93 Difference]: Finished difference Result 1110 states and 1332 transitions. [2024-11-20 16:57:49,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 16:57:49,214 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-20 16:57:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:49,218 INFO L225 Difference]: With dead ends: 1110 [2024-11-20 16:57:49,218 INFO L226 Difference]: Without dead ends: 1106 [2024-11-20 16:57:49,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-20 16:57:49,219 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 10 mSDsluCounter, 4548 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5460 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:49,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5460 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:57:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-20 16:57:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1104. [2024-11-20 16:57:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 737 states have (on average 1.7679782903663501) internal successors, (1303), 1096 states have internal predecessors, (1303), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-20 16:57:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1322 transitions. [2024-11-20 16:57:49,236 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1322 transitions. Word has length 78 [2024-11-20 16:57:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:49,236 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1322 transitions. [2024-11-20 16:57:49,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1322 transitions. [2024-11-20 16:57:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 16:57:49,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:49,237 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:49,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-20 16:57:49,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:49,442 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:49,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1342488954, now seen corresponding path program 3 times [2024-11-20 16:57:49,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:49,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122009002] [2024-11-20 16:57:49,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 16:57:49,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:49,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:49,446 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:49,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-20 16:57:50,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 16:57:50,126 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:50,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 16:57:50,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:50,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:50,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:50,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122009002] [2024-11-20 16:57:50,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122009002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:50,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:50,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 16:57:50,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825449369] [2024-11-20 16:57:50,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:50,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 16:57:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:50,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 16:57:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 16:57:50,722 INFO L87 Difference]: Start difference. First operand 1104 states and 1322 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:52,071 INFO L93 Difference]: Finished difference Result 1128 states and 1361 transitions. [2024-11-20 16:57:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 16:57:52,072 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-20 16:57:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:52,075 INFO L225 Difference]: With dead ends: 1128 [2024-11-20 16:57:52,076 INFO L226 Difference]: Without dead ends: 1122 [2024-11-20 16:57:52,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 16:57:52,077 INFO L432 NwaCegarLoop]: 913 mSDtfsCounter, 22 mSDsluCounter, 10918 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11831 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:52,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11831 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 16:57:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-20 16:57:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2024-11-20 16:57:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 755 states have (on average 1.7562913907284767) internal successors, (1326), 1114 states have internal predecessors, (1326), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-20 16:57:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1345 transitions. [2024-11-20 16:57:52,092 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1345 transitions. Word has length 84 [2024-11-20 16:57:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:52,092 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1345 transitions. [2024-11-20 16:57:52,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1345 transitions. [2024-11-20 16:57:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 16:57:52,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:52,094 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:52,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-20 16:57:52,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:52,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:52,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1256644934, now seen corresponding path program 4 times [2024-11-20 16:57:52,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:52,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044587699] [2024-11-20 16:57:52,296 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 16:57:52,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:52,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:52,297 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:52,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-20 16:57:52,788 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 16:57:52,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:52,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 16:57:52,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:53,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:54,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044587699] [2024-11-20 16:57:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044587699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:54,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 16:57:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074236986] [2024-11-20 16:57:54,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:54,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 16:57:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 16:57:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 16:57:54,494 INFO L87 Difference]: Start difference. First operand 1122 states and 1345 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:59,215 INFO L93 Difference]: Finished difference Result 1162 states and 1417 transitions. [2024-11-20 16:57:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 16:57:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-20 16:57:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:59,219 INFO L225 Difference]: With dead ends: 1162 [2024-11-20 16:57:59,219 INFO L226 Difference]: Without dead ends: 1158 [2024-11-20 16:57:59,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 16:57:59,221 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 33 mSDsluCounter, 20911 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 21823 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:59,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 21823 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 16:57:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-20 16:57:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2024-11-20 16:57:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 789 states have (on average 1.7389100126742711) internal successors, (1372), 1148 states have internal predecessors, (1372), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-20 16:57:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1391 transitions. [2024-11-20 16:57:59,239 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1391 transitions. Word has length 96 [2024-11-20 16:57:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:59,239 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1391 transitions. [2024-11-20 16:57:59,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1391 transitions. [2024-11-20 16:57:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 16:57:59,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:59,241 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:59,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:59,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:59,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-20 16:57:59,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:59,442 INFO L85 PathProgramCache]: Analyzing trace with hash 998555558, now seen corresponding path program 5 times [2024-11-20 16:57:59,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:59,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11232561] [2024-11-20 16:57:59,443 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:57:59,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:59,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:59,446 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:59,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-20 16:58:00,599 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 16:58:00,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:58:00,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-20 16:58:00,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:58:00,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:58:00,735 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-20 16:58:00,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-20 16:58:00,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:58:00,883 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 24 treesize of output 12 [2024-11-20 16:58:01,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 16:58:01,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-20 16:58:01,843 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 33 treesize of output 15 [2024-11-20 16:58:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 16:58:01,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:58:02,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-20 16:58:02,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:58:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11232561] [2024-11-20 16:58:02,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11232561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 16:58:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957548474] [2024-11-20 16:58:02,183 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:58:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 16:58:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 16:58:02,185 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 16:58:02,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process