./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_SAX_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:18:47,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:18:47,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:18:47,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:18:47,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:18:48,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:18:48,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:18:48,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:18:48,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:18:48,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:18:48,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:18:48,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:18:48,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:18:48,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:18:48,014 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:18:48,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:18:48,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:18:48,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:18:48,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:18:48,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:18:48,016 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:18:48,017 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:18:48,018 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:18:48,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:18:48,019 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:18:48,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:18:48,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:18:48,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:18:48,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:18:48,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:18:48,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:18:48,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:18:48,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:18:48,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:18:48,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:18:48,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:18:48,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:18:48,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:18:48,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:18:48,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:18:48,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:18:48,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:18:48,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2024-10-11 19:18:48,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:18:48,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:18:48,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:18:48,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:18:48,317 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:18:48,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-11 19:18:49,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:18:50,103 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:18:50,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-11 19:18:50,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/686702272/251fd38c89cf4e6d82d96ca88a379281/FLAG2418a1a81 [2024-10-11 19:18:50,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/686702272/251fd38c89cf4e6d82d96ca88a379281 [2024-10-11 19:18:50,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:18:50,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:18:50,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:18:50,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:18:50,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:18:50,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:18:50" (1/1) ... [2024-10-11 19:18:50,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2377c78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:50, skipping insertion in model container [2024-10-11 19:18:50,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:18:50" (1/1) ... [2024-10-11 19:18:50,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:18:50,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:18:50,748 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:18:50,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1526fe73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:50, skipping insertion in model container [2024-10-11 19:18:50,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:18:50,751 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:18:50,753 INFO L158 Benchmark]: Toolchain (without parser) took 605.86ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 86.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 19:18:50,754 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:18:50,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.48ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 86.8MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 19:18:50,756 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.48ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 86.8MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:18:52,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:18:52,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:18:52,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:18:52,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:18:52,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:18:52,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:18:52,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:18:52,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:18:52,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:18:52,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:18:52,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:18:52,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:18:52,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:18:52,927 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:18:52,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:18:52,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:18:52,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:18:52,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:18:52,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:18:52,929 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:18:52,931 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:18:52,931 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:18:52,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:18:52,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:18:52,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:18:52,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:18:52,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:18:52,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:18:52,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:18:52,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:18:52,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:18:52,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:18:52,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:18:52,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:18:52,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:18:52,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:18:52,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:18:52,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:18:52,949 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:18:52,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:18:52,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:18:52,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:18:52,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:18:52,951 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:18:52,951 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2024-10-11 19:18:53,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:18:53,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:18:53,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:18:53,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:18:53,294 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:18:53,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-11 19:18:54,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:18:55,071 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:18:55,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-11 19:18:55,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/592e34991/a79eecd1255c44a88a6234d78458875d/FLAG4680f9d07 [2024-10-11 19:18:55,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/592e34991/a79eecd1255c44a88a6234d78458875d [2024-10-11 19:18:55,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:18:55,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:18:55,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:18:55,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:18:55,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:18:55,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:18:55" (1/1) ... [2024-10-11 19:18:55,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e33d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:55, skipping insertion in model container [2024-10-11 19:18:55,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:18:55" (1/1) ... [2024-10-11 19:18:55,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:18:55,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:18:55,947 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:18:55,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:18:56,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:18:56,082 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:18:56,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:18:56,244 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:18:56,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56 WrapperNode [2024-10-11 19:18:56,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:18:56,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:18:56,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:18:56,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:18:56,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,363 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1204 [2024-10-11 19:18:56,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:18:56,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:18:56,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:18:56,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:18:56,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,518 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [268, 2, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 62 writes are split as follows [58, 0, 4]. [2024-10-11 19:18:56,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:18:56,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:18:56,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:18:56,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:18:56,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (1/1) ... [2024-10-11 19:18:56,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:18:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:18:56,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:18:56,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:18:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:18:56,696 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:18:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:18:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:18:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:18:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:18:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:18:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:18:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:18:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:18:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:18:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:18:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:18:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:18:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:18:56,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:18:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-11 19:18:56,701 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-11 19:18:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:18:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:18:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:18:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:18:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:18:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:18:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:18:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:18:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:18:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:18:56,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:18:56,980 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:18:56,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:18:57,006 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:18:57,051 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:18:57,077 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:19:01,047 INFO L? ?]: Removed 1322 outVars from TransFormulas that were not future-live. [2024-10-11 19:19:01,048 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:19:01,220 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:19:01,221 INFO L314 CfgBuilder]: Removed 71 assume(true) statements. [2024-10-11 19:19:01,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:19:01 BoogieIcfgContainer [2024-10-11 19:19:01,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:19:01,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:19:01,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:19:01,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:19:01,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:18:55" (1/3) ... [2024-10-11 19:19:01,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543586fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:19:01, skipping insertion in model container [2024-10-11 19:19:01,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:18:56" (2/3) ... [2024-10-11 19:19:01,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543586fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:19:01, skipping insertion in model container [2024-10-11 19:19:01,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:19:01" (3/3) ... [2024-10-11 19:19:01,229 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-2.i [2024-10-11 19:19:01,245 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:19:01,246 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2024-10-11 19:19:01,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:19:01,318 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;@14679a73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:19:01,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2024-10-11 19:19:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 1181 states, 523 states have (on average 2.5066921606118546) internal successors, (1311), 1171 states have internal predecessors, (1311), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 19:19:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:19:01,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:01,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:19:01,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:01,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash 70318, now seen corresponding path program 1 times [2024-10-11 19:19:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:01,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672990756] [2024-10-11 19:19:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:01,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:01,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:01,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:01,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:19:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:01,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:01,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:01,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:01,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:01,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:01,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672990756] [2024-10-11 19:19:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672990756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:01,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:01,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:19:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732245627] [2024-10-11 19:19:01,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:01,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:01,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:01,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:01,677 INFO L87 Difference]: Start difference. First operand has 1181 states, 523 states have (on average 2.5066921606118546) internal successors, (1311), 1171 states have internal predecessors, (1311), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 19:19:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:03,435 INFO L93 Difference]: Finished difference Result 1348 states and 1455 transitions. [2024-10-11 19:19:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 19:19:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:03,461 INFO L225 Difference]: With dead ends: 1348 [2024-10-11 19:19:03,461 INFO L226 Difference]: Without dead ends: 1347 [2024-10-11 19:19:03,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 19:19:03,466 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 1048 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:03,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 901 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:19:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-10-11 19:19:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1171. [2024-10-11 19:19:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 529 states have (on average 2.3232514177693764) internal successors, (1229), 1160 states have internal predecessors, (1229), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 19:19:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1273 transitions. [2024-10-11 19:19:03,550 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1273 transitions. Word has length 2 [2024-10-11 19:19:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:03,550 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1273 transitions. [2024-10-11 19:19:03,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 19:19:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1273 transitions. [2024-10-11 19:19:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:19:03,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:03,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:19:03,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:03,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:03,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:03,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash 70319, now seen corresponding path program 1 times [2024-10-11 19:19:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074492419] [2024-10-11 19:19:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:03,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:03,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:03,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:03,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:19:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:03,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:19:03,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:03,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:03,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:03,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:03,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074492419] [2024-10-11 19:19:03,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074492419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:03,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:19:03,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625910541] [2024-10-11 19:19:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:03,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:03,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:03,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:03,910 INFO L87 Difference]: Start difference. First operand 1171 states and 1273 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 19:19:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:06,370 INFO L93 Difference]: Finished difference Result 1720 states and 1865 transitions. [2024-10-11 19:19:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:06,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 19:19:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:06,378 INFO L225 Difference]: With dead ends: 1720 [2024-10-11 19:19:06,378 INFO L226 Difference]: Without dead ends: 1720 [2024-10-11 19:19:06,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 19:19:06,380 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 588 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:06,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1540 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:19:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-11 19:19:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1348. [2024-10-11 19:19:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 706 states have (on average 2.2988668555240794) internal successors, (1623), 1336 states have internal predecessors, (1623), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 19:19:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1669 transitions. [2024-10-11 19:19:06,425 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1669 transitions. Word has length 2 [2024-10-11 19:19:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:06,425 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1669 transitions. [2024-10-11 19:19:06,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-11 19:19:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1669 transitions. [2024-10-11 19:19:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:19:06,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:06,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:19:06,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:06,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:06,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:06,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash 519002808, now seen corresponding path program 1 times [2024-10-11 19:19:06,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527849524] [2024-10-11 19:19:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:06,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:06,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:06,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:06,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:19:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:06,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:19:06,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:06,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:06,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:06,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:19:06,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:19:06,911 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:19:06,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:19:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:06,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:06,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527849524] [2024-10-11 19:19:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527849524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:06,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:06,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861844930] [2024-10-11 19:19:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:06,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:06,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:06,938 INFO L87 Difference]: Start difference. First operand 1348 states and 1669 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-11 19:19:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:09,347 INFO L93 Difference]: Finished difference Result 1518 states and 1846 transitions. [2024-10-11 19:19:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:09,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-10-11 19:19:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:09,353 INFO L225 Difference]: With dead ends: 1518 [2024-10-11 19:19:09,353 INFO L226 Difference]: Without dead ends: 1518 [2024-10-11 19:19:09,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-11 19:19:09,355 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 1340 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:09,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 583 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 19:19:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-10-11 19:19:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1159. [2024-10-11 19:19:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 529 states have (on average 2.298676748582231) internal successors, (1216), 1148 states have internal predecessors, (1216), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 19:19:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1260 transitions. [2024-10-11 19:19:09,382 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1260 transitions. Word has length 6 [2024-10-11 19:19:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:09,382 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1260 transitions. [2024-10-11 19:19:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-11 19:19:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1260 transitions. [2024-10-11 19:19:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:19:09,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:09,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:09,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:19:09,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:09,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1090782041, now seen corresponding path program 1 times [2024-10-11 19:19:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363136255] [2024-10-11 19:19:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:09,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:09,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:09,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:19:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:09,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:09,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:09,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:09,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:09,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:09,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363136255] [2024-10-11 19:19:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363136255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:09,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:09,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072529463] [2024-10-11 19:19:09,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:09,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:09,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:09,748 INFO L87 Difference]: Start difference. First operand 1159 states and 1260 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-11 19:19:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:11,296 INFO L93 Difference]: Finished difference Result 1459 states and 1589 transitions. [2024-10-11 19:19:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-11 19:19:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:11,301 INFO L225 Difference]: With dead ends: 1459 [2024-10-11 19:19:11,301 INFO L226 Difference]: Without dead ends: 1459 [2024-10-11 19:19:11,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-11 19:19:11,303 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 842 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:11,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1372 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:19:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-11 19:19:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1111. [2024-10-11 19:19:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 529 states have (on average 2.2060491493383743) internal successors, (1167), 1100 states have internal predecessors, (1167), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 19:19:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1211 transitions. [2024-10-11 19:19:11,328 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1211 transitions. Word has length 7 [2024-10-11 19:19:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:11,329 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1211 transitions. [2024-10-11 19:19:11,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-11 19:19:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1211 transitions. [2024-10-11 19:19:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:19:11,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:11,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:11,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:19:11,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:11,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:11,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1090782040, now seen corresponding path program 1 times [2024-10-11 19:19:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:11,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880888694] [2024-10-11 19:19:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:11,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:11,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:11,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:19:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:11,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:19:11,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:11,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:11,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:11,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880888694] [2024-10-11 19:19:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880888694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153880094] [2024-10-11 19:19:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:11,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:11,694 INFO L87 Difference]: Start difference. First operand 1111 states and 1211 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-11 19:19:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:13,699 INFO L93 Difference]: Finished difference Result 1546 states and 1682 transitions. [2024-10-11 19:19:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-11 19:19:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:13,704 INFO L225 Difference]: With dead ends: 1546 [2024-10-11 19:19:13,704 INFO L226 Difference]: Without dead ends: 1546 [2024-10-11 19:19:13,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-11 19:19:13,705 INFO L432 NwaCegarLoop]: 1186 mSDtfsCounter, 633 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:13,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1686 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 19:19:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-10-11 19:19:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1319. [2024-10-11 19:19:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 745 states have (on average 2.1865771812080537) internal successors, (1629), 1306 states have internal predecessors, (1629), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 19:19:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1677 transitions. [2024-10-11 19:19:13,729 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1677 transitions. Word has length 7 [2024-10-11 19:19:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:13,729 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1677 transitions. [2024-10-11 19:19:13,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-10-11 19:19:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1677 transitions. [2024-10-11 19:19:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:19:13,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:13,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:13,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:19:13,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:13,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash -709812944, now seen corresponding path program 1 times [2024-10-11 19:19:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:13,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060365347] [2024-10-11 19:19:13,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:13,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:13,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:13,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:13,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:19:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:14,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:14,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:14,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:14,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060365347] [2024-10-11 19:19:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060365347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224892143] [2024-10-11 19:19:14,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:14,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:14,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:14,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:14,114 INFO L87 Difference]: Start difference. First operand 1319 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-11 19:19:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:14,936 INFO L93 Difference]: Finished difference Result 1998 states and 2612 transitions. [2024-10-11 19:19:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-11 19:19:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:14,942 INFO L225 Difference]: With dead ends: 1998 [2024-10-11 19:19:14,942 INFO L226 Difference]: Without dead ends: 1998 [2024-10-11 19:19:14,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-11 19:19:14,943 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 572 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:14,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 2122 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:19:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2024-10-11 19:19:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1654. [2024-10-11 19:19:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1078 states have (on average 2.170686456400742) internal successors, (2340), 1639 states have internal predecessors, (2340), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2392 transitions. [2024-10-11 19:19:14,974 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2392 transitions. Word has length 10 [2024-10-11 19:19:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:14,974 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2392 transitions. [2024-10-11 19:19:14,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-11 19:19:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2392 transitions. [2024-10-11 19:19:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:19:14,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:14,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:14,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:19:15,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:15,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 170345729, now seen corresponding path program 1 times [2024-10-11 19:19:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954171653] [2024-10-11 19:19:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:15,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:15,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:19:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:15,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:19:15,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:15,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:15,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954171653] [2024-10-11 19:19:15,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954171653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:15,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217661893] [2024-10-11 19:19:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:15,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:15,332 INFO L87 Difference]: Start difference. First operand 1654 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-11 19:19:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:16,033 INFO L93 Difference]: Finished difference Result 1570 states and 2232 transitions. [2024-10-11 19:19:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-11 19:19:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:16,038 INFO L225 Difference]: With dead ends: 1570 [2024-10-11 19:19:16,038 INFO L226 Difference]: Without dead ends: 1570 [2024-10-11 19:19:16,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-11 19:19:16,040 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 61 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:16,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1994 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:19:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-11 19:19:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-10-11 19:19:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1018 states have (on average 2.1414538310412574) internal successors, (2180), 1555 states have internal predecessors, (2180), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2232 transitions. [2024-10-11 19:19:16,068 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2232 transitions. Word has length 12 [2024-10-11 19:19:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:16,068 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2232 transitions. [2024-10-11 19:19:16,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-11 19:19:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2232 transitions. [2024-10-11 19:19:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:19:16,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:16,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:16,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:16,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:16,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr632ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:16,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1905928002, now seen corresponding path program 1 times [2024-10-11 19:19:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088777283] [2024-10-11 19:19:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:16,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:16,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:16,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:19:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:16,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:19:16,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:16,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:19:16,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:19:16,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:19:16,450 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-10-11 19:19:16,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:19:16,492 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-10-11 19:19:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:16,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:16,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088777283] [2024-10-11 19:19:16,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088777283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:16,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:16,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467504827] [2024-10-11 19:19:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:16,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:16,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:16,506 INFO L87 Difference]: Start difference. First operand 1570 states and 2232 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-11 19:19:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:17,504 INFO L93 Difference]: Finished difference Result 2774 states and 3844 transitions. [2024-10-11 19:19:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-10-11 19:19:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:17,512 INFO L225 Difference]: With dead ends: 2774 [2024-10-11 19:19:17,513 INFO L226 Difference]: Without dead ends: 2774 [2024-10-11 19:19:17,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:17,514 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1017 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:17,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 3043 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:19:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2024-10-11 19:19:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1569. [2024-10-11 19:19:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1017 states have (on average 2.1415929203539825) internal successors, (2178), 1554 states have internal predecessors, (2178), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2230 transitions. [2024-10-11 19:19:17,570 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2230 transitions. Word has length 13 [2024-10-11 19:19:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:17,570 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2230 transitions. [2024-10-11 19:19:17,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-11 19:19:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2230 transitions. [2024-10-11 19:19:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:19:17,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:17,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:17,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:19:17,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:17,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:17,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -249532353, now seen corresponding path program 1 times [2024-10-11 19:19:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:17,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390861637] [2024-10-11 19:19:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:17,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:17,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:17,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:17,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:19:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:17,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:19:17,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:17,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:17,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390861637] [2024-10-11 19:19:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390861637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:17,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:17,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:17,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796124123] [2024-10-11 19:19:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:17,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:17,952 INFO L87 Difference]: Start difference. First operand 1569 states and 2230 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-11 19:19:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:18,447 INFO L93 Difference]: Finished difference Result 1515 states and 2150 transitions. [2024-10-11 19:19:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-10-11 19:19:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:18,452 INFO L225 Difference]: With dead ends: 1515 [2024-10-11 19:19:18,452 INFO L226 Difference]: Without dead ends: 1515 [2024-10-11 19:19:18,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-11 19:19:18,453 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 61 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:18,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1920 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:19:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-10-11 19:19:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2024-10-11 19:19:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 987 states have (on average 2.125633232016211) internal successors, (2098), 1500 states have internal predecessors, (2098), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2150 transitions. [2024-10-11 19:19:18,477 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2150 transitions. Word has length 15 [2024-10-11 19:19:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:18,477 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2150 transitions. [2024-10-11 19:19:18,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-11 19:19:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2150 transitions. [2024-10-11 19:19:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:19:18,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:18,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:18,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:19:18,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:18,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:18,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 717576632, now seen corresponding path program 1 times [2024-10-11 19:19:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:18,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401295954] [2024-10-11 19:19:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:18,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:18,683 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:18,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:19:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:18,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:18,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:18,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:18,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:18,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401295954] [2024-10-11 19:19:18,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401295954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:18,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:18,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310744767] [2024-10-11 19:19:18,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:18,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:18,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:18,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:18,867 INFO L87 Difference]: Start difference. First operand 1515 states and 2150 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-11 19:19:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:19,519 INFO L93 Difference]: Finished difference Result 1499 states and 2106 transitions. [2024-10-11 19:19:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:19:19,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-11 19:19:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:19,523 INFO L225 Difference]: With dead ends: 1499 [2024-10-11 19:19:19,523 INFO L226 Difference]: Without dead ends: 1499 [2024-10-11 19:19:19,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:19,524 INFO L432 NwaCegarLoop]: 950 mSDtfsCounter, 45 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:19,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2832 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:19:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-10-11 19:19:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-10-11 19:19:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 985 states have (on average 2.085279187817259) internal successors, (2054), 1484 states have internal predecessors, (2054), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2106 transitions. [2024-10-11 19:19:19,544 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2106 transitions. Word has length 17 [2024-10-11 19:19:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:19,544 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 2106 transitions. [2024-10-11 19:19:19,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-11 19:19:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2106 transitions. [2024-10-11 19:19:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:19:19,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:19,546 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] [2024-10-11 19:19:19,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:19:19,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:19,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:19,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2015839738, now seen corresponding path program 1 times [2024-10-11 19:19:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878568021] [2024-10-11 19:19:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:19,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:19,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:19,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:19:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:19,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:19:19,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:19,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:20,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:20,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:20,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878568021] [2024-10-11 19:19:20,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878568021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:20,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:20,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374476183] [2024-10-11 19:19:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:20,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:20,026 INFO L87 Difference]: Start difference. First operand 1499 states and 2106 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-11 19:19:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:21,415 INFO L93 Difference]: Finished difference Result 1516 states and 2122 transitions. [2024-10-11 19:19:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:21,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-11 19:19:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:21,419 INFO L225 Difference]: With dead ends: 1516 [2024-10-11 19:19:21,419 INFO L226 Difference]: Without dead ends: 1516 [2024-10-11 19:19:21,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:21,420 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 744 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:21,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1292 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:19:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-10-11 19:19:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1495. [2024-10-11 19:19:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 985 states have (on average 2.0771573604060913) internal successors, (2046), 1480 states have internal predecessors, (2046), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2098 transitions. [2024-10-11 19:19:21,446 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2098 transitions. Word has length 31 [2024-10-11 19:19:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:21,447 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 2098 transitions. [2024-10-11 19:19:21,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-11 19:19:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2098 transitions. [2024-10-11 19:19:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:19:21,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:21,448 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] [2024-10-11 19:19:21,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:19:21,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:21,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:21,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2015839737, now seen corresponding path program 1 times [2024-10-11 19:19:21,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544684641] [2024-10-11 19:19:21,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:21,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:21,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:19:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:21,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:19:21,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:21,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:22,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:22,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544684641] [2024-10-11 19:19:22,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544684641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:22,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:22,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:22,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893908946] [2024-10-11 19:19:22,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:22,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:22,026 INFO L87 Difference]: Start difference. First operand 1495 states and 2098 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-11 19:19:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:24,220 INFO L93 Difference]: Finished difference Result 1703 states and 2104 transitions. [2024-10-11 19:19:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:24,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-11 19:19:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:24,226 INFO L225 Difference]: With dead ends: 1703 [2024-10-11 19:19:24,227 INFO L226 Difference]: Without dead ends: 1703 [2024-10-11 19:19:24,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:24,228 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 531 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:24,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2401 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:19:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-10-11 19:19:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1491. [2024-10-11 19:19:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 985 states have (on average 2.0690355329949237) internal successors, (2038), 1476 states have internal predecessors, (2038), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2090 transitions. [2024-10-11 19:19:24,248 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2090 transitions. Word has length 31 [2024-10-11 19:19:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:24,249 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 2090 transitions. [2024-10-11 19:19:24,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-11 19:19:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2090 transitions. [2024-10-11 19:19:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 19:19:24,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:24,250 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] [2024-10-11 19:19:24,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:24,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:24,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:24,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1732169696, now seen corresponding path program 1 times [2024-10-11 19:19:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325930754] [2024-10-11 19:19:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:24,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:24,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:24,460 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:24,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:19:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:24,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:24,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:24,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:24,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325930754] [2024-10-11 19:19:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325930754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:24,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:24,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110951798] [2024-10-11 19:19:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:24,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:24,728 INFO L87 Difference]: Start difference. First operand 1491 states and 2090 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10-11 19:19:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:25,344 INFO L93 Difference]: Finished difference Result 1479 states and 2070 transitions. [2024-10-11 19:19:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:19:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-10-11 19:19:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:25,348 INFO L225 Difference]: With dead ends: 1479 [2024-10-11 19:19:25,348 INFO L226 Difference]: Without dead ends: 1479 [2024-10-11 19:19:25,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:25,349 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 15 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:25,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2815 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:19:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-10-11 19:19:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1479. [2024-10-11 19:19:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 973 states have (on average 2.0739979445015417) internal successors, (2018), 1464 states have internal predecessors, (2018), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:19:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2070 transitions. [2024-10-11 19:19:25,368 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2070 transitions. Word has length 50 [2024-10-11 19:19:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:25,369 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2070 transitions. [2024-10-11 19:19:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10-11 19:19:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2070 transitions. [2024-10-11 19:19:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:19:25,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:25,370 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] [2024-10-11 19:19:25,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:19:25,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:25,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1191760002, now seen corresponding path program 1 times [2024-10-11 19:19:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:25,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871851871] [2024-10-11 19:19:25,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:25,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:25,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:25,576 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:25,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:19:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:25,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:19:25,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:25,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:25,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:26,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:19:26,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:19:26,308 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:19:26,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:19:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:26,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:26,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:26,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871851871] [2024-10-11 19:19:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871851871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:26,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132945239] [2024-10-11 19:19:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:26,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:26,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:26,325 INFO L87 Difference]: Start difference. First operand 1479 states and 2070 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 19:19:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:27,726 INFO L93 Difference]: Finished difference Result 1452 states and 2044 transitions. [2024-10-11 19:19:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:27,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-10-11 19:19:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:27,731 INFO L225 Difference]: With dead ends: 1452 [2024-10-11 19:19:27,731 INFO L226 Difference]: Without dead ends: 1452 [2024-10-11 19:19:27,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-10-11 19:19:27,732 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 695 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:27,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 735 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:19:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-10-11 19:19:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1120. [2024-10-11 19:19:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 657 states have (on average 1.9710806697108068) internal successors, (1295), 1108 states have internal predecessors, (1295), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 19:19:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1341 transitions. [2024-10-11 19:19:27,750 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1341 transitions. Word has length 54 [2024-10-11 19:19:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:27,750 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1341 transitions. [2024-10-11 19:19:27,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 19:19:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1341 transitions. [2024-10-11 19:19:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:19:27,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:27,751 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] [2024-10-11 19:19:27,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 19:19:27,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:27,952 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:27,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1643354685, now seen corresponding path program 1 times [2024-10-11 19:19:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:27,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896873444] [2024-10-11 19:19:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:27,956 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:27,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:19:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:28,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:19:28,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:28,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:28,229 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-10-11 19:19:28,249 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-10-11 19:19:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:28,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:28,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:28,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896873444] [2024-10-11 19:19:28,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896873444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:28,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:28,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972847882] [2024-10-11 19:19:28,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:28,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:19:28,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:28,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:19:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:28,258 INFO L87 Difference]: Start difference. First operand 1120 states and 1341 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-11 19:19:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:29,965 INFO L93 Difference]: Finished difference Result 1119 states and 1340 transitions. [2024-10-11 19:19:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:19:29,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-11 19:19:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:29,968 INFO L225 Difference]: With dead ends: 1119 [2024-10-11 19:19:29,968 INFO L226 Difference]: Without dead ends: 1119 [2024-10-11 19:19:29,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-10-11 19:19:29,968 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:29,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2465 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:19:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-10-11 19:19:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2024-10-11 19:19:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 657 states have (on average 1.969558599695586) internal successors, (1294), 1107 states have internal predecessors, (1294), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 19:19:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1340 transitions. [2024-10-11 19:19:29,983 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1340 transitions. Word has length 58 [2024-10-11 19:19:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:29,984 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1340 transitions. [2024-10-11 19:19:29,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-11 19:19:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1340 transitions. [2024-10-11 19:19:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:19:29,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:29,985 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] [2024-10-11 19:19:29,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:30,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:30,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1643354686, now seen corresponding path program 1 times [2024-10-11 19:19:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391234741] [2024-10-11 19:19:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:30,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:30,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:30,188 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:30,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:19:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:30,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:19:30,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:30,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:30,478 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-10-11 19:19:30,484 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-10-11 19:19:30,529 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-10-11 19:19:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:30,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:30,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:30,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391234741] [2024-10-11 19:19:30,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391234741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:30,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163289072] [2024-10-11 19:19:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:30,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:19:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:19:30,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:30,548 INFO L87 Difference]: Start difference. First operand 1119 states and 1340 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-11 19:19:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:32,645 INFO L93 Difference]: Finished difference Result 1118 states and 1339 transitions. [2024-10-11 19:19:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:19:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-11 19:19:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:32,648 INFO L225 Difference]: With dead ends: 1118 [2024-10-11 19:19:32,649 INFO L226 Difference]: Without dead ends: 1118 [2024-10-11 19:19:32,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-10-11 19:19:32,649 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 1 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:32,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2519 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 19:19:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-10-11 19:19:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2024-10-11 19:19:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 656 states have (on average 1.9710365853658536) internal successors, (1293), 1106 states have internal predecessors, (1293), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 19:19:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1339 transitions. [2024-10-11 19:19:32,660 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1339 transitions. Word has length 58 [2024-10-11 19:19:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:32,661 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1339 transitions. [2024-10-11 19:19:32,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-11 19:19:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1339 transitions. [2024-10-11 19:19:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:19:32,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:32,662 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] [2024-10-11 19:19:32,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:19:32,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:32,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:32,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 789031617, now seen corresponding path program 1 times [2024-10-11 19:19:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845480251] [2024-10-11 19:19:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:32,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:32,865 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:32,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:19:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:33,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:33,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:33,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:33,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:33,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845480251] [2024-10-11 19:19:33,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845480251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:33,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:33,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501117839] [2024-10-11 19:19:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:33,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:33,132 INFO L87 Difference]: Start difference. First operand 1118 states and 1339 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:19:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:33,720 INFO L93 Difference]: Finished difference Result 1120 states and 1342 transitions. [2024-10-11 19:19:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-11 19:19:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:33,725 INFO L225 Difference]: With dead ends: 1120 [2024-10-11 19:19:33,725 INFO L226 Difference]: Without dead ends: 1120 [2024-10-11 19:19:33,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:33,726 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 0 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:33,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2745 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:19:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-10-11 19:19:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2024-10-11 19:19:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 657 states have (on average 1.9710806697108068) internal successors, (1295), 1108 states have internal predecessors, (1295), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-11 19:19:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1342 transitions. [2024-10-11 19:19:33,751 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1342 transitions. Word has length 64 [2024-10-11 19:19:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:33,751 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1342 transitions. [2024-10-11 19:19:33,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:19:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1342 transitions. [2024-10-11 19:19:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:19:33,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:33,752 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] [2024-10-11 19:19:33,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:33,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:33,953 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -980471432, now seen corresponding path program 1 times [2024-10-11 19:19:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:33,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524436368] [2024-10-11 19:19:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:33,958 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:33,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:19:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:34,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:19:34,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:34,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:19:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:34,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524436368] [2024-10-11 19:19:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524436368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:19:34,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:19:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:19:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318137270] [2024-10-11 19:19:34,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:19:34,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:19:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:34,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:19:34,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:19:34,340 INFO L87 Difference]: Start difference. First operand 1120 states and 1342 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-10-11 19:19:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:35,612 INFO L93 Difference]: Finished difference Result 1129 states and 1356 transitions. [2024-10-11 19:19:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:19:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2024-10-11 19:19:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:35,616 INFO L225 Difference]: With dead ends: 1129 [2024-10-11 19:19:35,616 INFO L226 Difference]: Without dead ends: 1129 [2024-10-11 19:19:35,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 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-10-11 19:19:35,617 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 4 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:35,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5481 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:19:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-10-11 19:19:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1128. [2024-10-11 19:19:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 664 states have (on average 1.9698795180722892) internal successors, (1308), 1115 states have internal predecessors, (1308), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-11 19:19:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1355 transitions. [2024-10-11 19:19:35,631 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1355 transitions. Word has length 65 [2024-10-11 19:19:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:35,631 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1355 transitions. [2024-10-11 19:19:35,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-10-11 19:19:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1355 transitions. [2024-10-11 19:19:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 19:19:35,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:35,632 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] [2024-10-11 19:19:35,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-11 19:19:35,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:35,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:35,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1477386369, now seen corresponding path program 2 times [2024-10-11 19:19:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637302542] [2024-10-11 19:19:35,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:19:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:35,835 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:35,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 19:19:36,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:19:36,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:19:36,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:19:36,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:36,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:19:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:36,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637302542] [2024-10-11 19:19:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637302542] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:19:36,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:19:36,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:19:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668789818] [2024-10-11 19:19:36,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:19:36,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:19:36,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:36,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:19:36,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:19:36,394 INFO L87 Difference]: Start difference. First operand 1128 states and 1355 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-10-11 19:19:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:37,863 INFO L93 Difference]: Finished difference Result 1140 states and 1374 transitions. [2024-10-11 19:19:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:19:37,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2024-10-11 19:19:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:37,866 INFO L225 Difference]: With dead ends: 1140 [2024-10-11 19:19:37,868 INFO L226 Difference]: Without dead ends: 1138 [2024-10-11 19:19:37,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:19:37,869 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 7 mSDsluCounter, 5482 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6397 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:37,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6397 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:19:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-10-11 19:19:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1137. [2024-10-11 19:19:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 673 states have (on average 1.9613670133729568) internal successors, (1320), 1124 states have internal predecessors, (1320), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-11 19:19:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1367 transitions. [2024-10-11 19:19:37,889 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1367 transitions. Word has length 68 [2024-10-11 19:19:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:37,889 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1367 transitions. [2024-10-11 19:19:37,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-10-11 19:19:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1367 transitions. [2024-10-11 19:19:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 19:19:37,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:37,890 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] [2024-10-11 19:19:37,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:38,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:38,091 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:38,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:38,091 INFO L85 PathProgramCache]: Analyzing trace with hash -226382559, now seen corresponding path program 3 times [2024-10-11 19:19:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792899523] [2024-10-11 19:19:38,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:19:38,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:38,093 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:38,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 19:19:38,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:19:38,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:19:38,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:19:38,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:38,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:19:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:39,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:39,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792899523] [2024-10-11 19:19:39,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792899523] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:19:39,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:19:39,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:19:39,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118342247] [2024-10-11 19:19:39,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:19:39,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:19:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:39,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:19:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:19:39,281 INFO L87 Difference]: Start difference. First operand 1137 states and 1367 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-10-11 19:19:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:42,793 INFO L93 Difference]: Finished difference Result 1158 states and 1403 transitions. [2024-10-11 19:19:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:19:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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 74 [2024-10-11 19:19:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:42,797 INFO L225 Difference]: With dead ends: 1158 [2024-10-11 19:19:42,797 INFO L226 Difference]: Without dead ends: 1155 [2024-10-11 19:19:42,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 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-10-11 19:19:42,798 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 14 mSDsluCounter, 10965 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11880 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:42,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11880 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 19:19:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-10-11 19:19:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2024-10-11 19:19:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 691 states have (on average 1.9435600578871202) internal successors, (1343), 1142 states have internal predecessors, (1343), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-11 19:19:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1390 transitions. [2024-10-11 19:19:42,814 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1390 transitions. Word has length 74 [2024-10-11 19:19:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:42,814 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1390 transitions. [2024-10-11 19:19:42,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-10-11 19:19:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1390 transitions. [2024-10-11 19:19:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 19:19:42,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:42,816 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] [2024-10-11 19:19:42,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-11 19:19:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:43,016 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1599807903, now seen corresponding path program 4 times [2024-10-11 19:19:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698639141] [2024-10-11 19:19:43,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:19:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:43,019 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:43,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 19:19:43,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:19:43,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:19:43,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:19:43,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:43,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:19:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:44,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698639141] [2024-10-11 19:19:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698639141] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:19:44,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:19:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:19:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140583072] [2024-10-11 19:19:44,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:19:44,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:19:44,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:44,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:19:44,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:19:44,901 INFO L87 Difference]: Start difference. First operand 1155 states and 1390 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-10-11 19:19:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:53,230 INFO L93 Difference]: Finished difference Result 1192 states and 1459 transitions. [2024-10-11 19:19:53,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:19:53,232 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2024-10-11 19:19:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:53,234 INFO L225 Difference]: With dead ends: 1192 [2024-10-11 19:19:53,235 INFO L226 Difference]: Without dead ends: 1190 [2024-10-11 19:19:53,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:19:53,238 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 26 mSDsluCounter, 21022 mSDsCounter, 0 mSdLazyCounter, 4357 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 21937 SdHoareTripleChecker+Invalid, 4405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:53,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 21937 Invalid, 4405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4357 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 19:19:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-10-11 19:19:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1189. [2024-10-11 19:19:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 725 states have (on average 1.9158620689655173) internal successors, (1389), 1176 states have internal predecessors, (1389), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-11 19:19:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1436 transitions. [2024-10-11 19:19:53,257 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1436 transitions. Word has length 86 [2024-10-11 19:19:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:53,258 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1436 transitions. [2024-10-11 19:19:53,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-10-11 19:19:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1436 transitions. [2024-10-11 19:19:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 19:19:53,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:53,259 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] [2024-10-11 19:19:53,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:53,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:53,460 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-11 19:19:53,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1895196159, now seen corresponding path program 5 times [2024-10-11 19:19:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:53,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461225649] [2024-10-11 19:19:53,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:19:53,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:53,465 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:53,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 19:19:54,613 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:19:54,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:19:54,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 19:19:54,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:54,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:54,738 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:19:54,739 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-10-11 19:19:54,761 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-10-11 19:19:54,837 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-10-11 19:19:55,693 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:19:55,694 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-10-11 19:19:55,745 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-10-11 19:19:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 19:19:55,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:19:56,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461225649] [2024-10-11 19:19:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461225649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:19:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1669685161] [2024-10-11 19:19:56,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:19:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:19:56,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:19:56,122 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:19:56,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process