./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:04:14,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:04:14,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:04:14,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:04:14,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:04:14,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:04:14,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:04:14,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:04:14,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:04:14,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:04:14,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:04:14,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:04:14,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:04:14,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:04:14,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:04:14,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:04:14,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:04:14,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:04:14,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:04:14,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:04:14,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:04:14,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:04:14,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:04:14,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:04:14,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:04:14,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:04:14,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:04:14,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:04:14,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:04:14,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:04:14,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:04:14,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:04:14,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:04:14,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:04:14,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:04:14,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:04:14,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:04:14,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:04:14,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:04:14,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:04:14,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:04:14,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 03:04:14,651 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:04:14,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:04:14,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:04:14,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:04:14,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:04:14,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:04:14,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:04:14,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:04:14,654 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:04:14,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:04:14,655 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:04:14,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:04:14,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:04:14,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:04:14,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:04:14,655 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:04:14,656 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:04:14,656 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:04:14,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:04:14,660 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:04:14,660 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:04:14,661 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:04:14,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:04:14,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:04:14,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:04:14,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:04:14,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:04:14,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:04:14,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:04:14,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:04:14,662 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:04:14,662 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:04:14,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:04:14,662 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:04:14,662 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f [2023-02-17 03:04:14,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:04:14,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:04:14,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:04:14,844 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:04:14,844 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:04:14,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-17 03:04:15,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:04:16,025 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:04:16,026 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-17 03:04:16,041 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b0572d/2423e11d513d43e2823b8a664aac1df1/FLAG5a82082fe [2023-02-17 03:04:16,051 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b0572d/2423e11d513d43e2823b8a664aac1df1 [2023-02-17 03:04:16,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:04:16,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:04:16,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:04:16,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:04:16,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:04:16,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:04:16" (1/1) ... [2023-02-17 03:04:16,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df71131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:16, skipping insertion in model container [2023-02-17 03:04:16,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:04:16" (1/1) ... [2023-02-17 03:04:16,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:04:16,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:04:16,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:04:16,375 ERROR L326 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) [2023-02-17 03:04:16,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5702410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:16, skipping insertion in model container [2023-02-17 03:04:16,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:04:16,375 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 03:04:16,377 INFO L158 Benchmark]: Toolchain (without parser) took 322.94ms. Allocated memory is still 115.3MB. Free memory was 77.0MB in the beginning and 63.1MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 03:04:16,377 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:04:16,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.61ms. Allocated memory is still 115.3MB. Free memory was 76.6MB in the beginning and 63.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 03:04:16,378 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.61ms. Allocated memory is still 115.3MB. Free memory was 76.6MB in the beginning and 63.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:04:17,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:04:17,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:04:17,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:04:17,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:04:17,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:04:17,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:04:17,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:04:17,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:04:17,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:04:17,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:04:17,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:04:17,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:04:17,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:04:17,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:04:17,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:04:17,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:04:17,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:04:17,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:04:17,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:04:17,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:04:17,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:04:17,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:04:17,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:04:17,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:04:17,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:04:17,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:04:17,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:04:17,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:04:17,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:04:17,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:04:17,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:04:17,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:04:17,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:04:17,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:04:17,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:04:17,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:04:17,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:04:17,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:04:17,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:04:17,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:04:17,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 03:04:18,002 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:04:18,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:04:18,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:04:18,004 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:04:18,004 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:04:18,004 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:04:18,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:04:18,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:04:18,005 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:04:18,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:04:18,006 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:04:18,006 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:04:18,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:04:18,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:04:18,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:04:18,006 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:04:18,007 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:04:18,007 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:04:18,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:04:18,007 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:04:18,007 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 03:04:18,007 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 03:04:18,007 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:04:18,008 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:04:18,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:04:18,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:04:18,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:04:18,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:04:18,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:04:18,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:04:18,009 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 03:04:18,009 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 03:04:18,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:04:18,009 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:04:18,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:04:18,009 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 03:04:18,010 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:04:18,010 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f [2023-02-17 03:04:18,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:04:18,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:04:18,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:04:18,298 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:04:18,298 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:04:18,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-17 03:04:19,224 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:04:19,424 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:04:19,425 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-17 03:04:19,434 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2a3b6ce/89f994f0418c4b81813e74407ea093a0/FLAG959da03dd [2023-02-17 03:04:19,445 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2a3b6ce/89f994f0418c4b81813e74407ea093a0 [2023-02-17 03:04:19,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:04:19,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:04:19,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:04:19,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:04:19,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:04:19,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cf1828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19, skipping insertion in model container [2023-02-17 03:04:19,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:04:19,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:04:19,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:04:19,722 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 03:04:19,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:04:19,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:04:19,815 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:04:19,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:04:19,891 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:04:19,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19 WrapperNode [2023-02-17 03:04:19,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:04:19,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:04:19,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:04:19,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:04:19,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,935 INFO L138 Inliner]: procedures = 167, calls = 79, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 53 [2023-02-17 03:04:19,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:04:19,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:04:19,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:04:19,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:04:19,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,956 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:04:19,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:04:19,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:04:19,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:04:19,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (1/1) ... [2023-02-17 03:04:19,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:04:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:04:20,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 03:04:20,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 03:04:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-17 03:04:20,034 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-17 03:04:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-17 03:04:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-17 03:04:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-17 03:04:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-17 03:04:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2023-02-17 03:04:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2023-02-17 03:04:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 03:04:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 03:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 03:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 03:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 03:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2023-02-17 03:04:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2023-02-17 03:04:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:04:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:04:20,123 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:04:20,125 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:04:20,420 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:04:20,425 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:04:20,425 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 03:04:20,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:04:20 BoogieIcfgContainer [2023-02-17 03:04:20,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:04:20,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:04:20,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:04:20,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:04:20,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:04:19" (1/3) ... [2023-02-17 03:04:20,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765f11ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:04:20, skipping insertion in model container [2023-02-17 03:04:20,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:04:19" (2/3) ... [2023-02-17 03:04:20,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765f11ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:04:20, skipping insertion in model container [2023-02-17 03:04:20,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:04:20" (3/3) ... [2023-02-17 03:04:20,431 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_2.i [2023-02-17 03:04:20,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:04:20,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-02-17 03:04:20,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:04:20,487 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@21358712, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:04:20,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-02-17 03:04:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:04:20,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:20,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:20,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1285123929, now seen corresponding path program 1 times [2023-02-17 03:04:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:20,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522084270] [2023-02-17 03:04:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:20,513 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 [2023-02-17 03:04:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:20,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:20,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 03:04:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:20,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:04:20,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:20,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:04:20,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 03:04:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:20,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:20,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:20,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522084270] [2023-02-17 03:04:20,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522084270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:20,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:20,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:04:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902451044] [2023-02-17 03:04:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:20,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:04:20,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:20,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:04:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2023-02-17 03:04:20,794 INFO L87 Difference]: Start difference. First operand has 82 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:21,154 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2023-02-17 03:04:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:04:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-17 03:04:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:21,162 INFO L225 Difference]: With dead ends: 82 [2023-02-17 03:04:21,162 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 03:04:21,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=70, Unknown=1, NotChecked=0, Total=110 [2023-02-17 03:04:21,170 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 170 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 17 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:21,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 70 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 201 Invalid, 30 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:04:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 03:04:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2023-02-17 03:04:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2023-02-17 03:04:21,201 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 12 [2023-02-17 03:04:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:21,202 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2023-02-17 03:04:21,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2023-02-17 03:04:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:04:21,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:21,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:21,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:21,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:21,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:21,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:21,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1285123928, now seen corresponding path program 1 times [2023-02-17 03:04:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593404419] [2023-02-17 03:04:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:21,412 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 [2023-02-17 03:04:21,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:21,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:21,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 03:04:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:21,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 03:04:21,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:23,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:04:23,514 INFO L350 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 12 treesize of output 14 [2023-02-17 03:04:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:23,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:23,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:23,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593404419] [2023-02-17 03:04:23,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593404419] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:23,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:23,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:04:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351498923] [2023-02-17 03:04:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:23,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:04:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:04:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=40, Unknown=2, NotChecked=0, Total=56 [2023-02-17 03:04:23,557 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:24,036 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2023-02-17 03:04:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:04:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-17 03:04:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:24,038 INFO L225 Difference]: With dead ends: 78 [2023-02-17 03:04:24,038 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 03:04:24,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=48, Invalid=106, Unknown=2, NotChecked=0, Total=156 [2023-02-17 03:04:24,039 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 185 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:24,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 71 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 03:04:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 03:04:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-02-17 03:04:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2023-02-17 03:04:24,043 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 12 [2023-02-17 03:04:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:24,044 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2023-02-17 03:04:24,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2023-02-17 03:04:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 03:04:24,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:24,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:24,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:24,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:24,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash 211575775, now seen corresponding path program 1 times [2023-02-17 03:04:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:24,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618341010] [2023-02-17 03:04:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:24,254 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 [2023-02-17 03:04:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:24,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:24,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 03:04:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:24,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 03:04:24,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:24,383 INFO L350 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 15 treesize of output 7 [2023-02-17 03:04:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:24,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:24,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618341010] [2023-02-17 03:04:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618341010] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:24,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:24,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:04:24,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724353271] [2023-02-17 03:04:24,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:24,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:04:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:24,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:04:24,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:04:24,404 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:24,680 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2023-02-17 03:04:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:04:24,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 03:04:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:24,683 INFO L225 Difference]: With dead ends: 109 [2023-02-17 03:04:24,683 INFO L226 Difference]: Without dead ends: 109 [2023-02-17 03:04:24,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:04:24,683 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:24,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 314 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:04:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-17 03:04:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2023-02-17 03:04:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2023-02-17 03:04:24,690 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 15 [2023-02-17 03:04:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:24,690 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2023-02-17 03:04:24,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2023-02-17 03:04:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 03:04:24,690 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:24,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:24,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:24,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:24,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 211575776, now seen corresponding path program 1 times [2023-02-17 03:04:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:24,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782551539] [2023-02-17 03:04:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:24,892 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 [2023-02-17 03:04:24,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:24,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:24,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 03:04:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:24,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 03:04:24,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:26,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:04:26,997 INFO L350 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 12 treesize of output 14 [2023-02-17 03:04:27,031 INFO L350 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 15 treesize of output 7 [2023-02-17 03:04:27,034 INFO L350 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 15 treesize of output 7 [2023-02-17 03:04:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:27,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:27,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:27,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782551539] [2023-02-17 03:04:27,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782551539] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:27,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:27,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 03:04:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74741930] [2023-02-17 03:04:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:27,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:04:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:04:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=88, Unknown=2, NotChecked=0, Total=110 [2023-02-17 03:04:27,076 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:27,803 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2023-02-17 03:04:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 03:04:27,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 03:04:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:27,806 INFO L225 Difference]: With dead ends: 105 [2023-02-17 03:04:27,806 INFO L226 Difference]: Without dead ends: 105 [2023-02-17 03:04:27,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=100, Invalid=318, Unknown=2, NotChecked=0, Total=420 [2023-02-17 03:04:27,807 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 93 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:27,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 243 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 455 Invalid, 3 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 03:04:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-17 03:04:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 74. [2023-02-17 03:04:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2023-02-17 03:04:27,812 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 15 [2023-02-17 03:04:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:27,812 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2023-02-17 03:04:27,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2023-02-17 03:04:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 03:04:27,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:27,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:27,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:28,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:28,020 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1183663415, now seen corresponding path program 1 times [2023-02-17 03:04:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263564739] [2023-02-17 03:04:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:28,021 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 [2023-02-17 03:04:28,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:28,022 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:28,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 03:04:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:28,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:04:28,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:28,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:28,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:28,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263564739] [2023-02-17 03:04:28,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263564739] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:28,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:28,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:04:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753552477] [2023-02-17 03:04:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:28,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:04:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:04:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:04:28,072 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:28,091 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2023-02-17 03:04:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:04:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-17 03:04:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:28,094 INFO L225 Difference]: With dead ends: 98 [2023-02-17 03:04:28,094 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 03:04:28,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:04:28,098 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:28,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 355 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:04:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 03:04:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2023-02-17 03:04:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:04:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2023-02-17 03:04:28,117 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 13 [2023-02-17 03:04:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:28,117 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2023-02-17 03:04:28,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2023-02-17 03:04:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 03:04:28,118 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:28,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:28,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:28,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:28,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1303849418, now seen corresponding path program 1 times [2023-02-17 03:04:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:28,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533183373] [2023-02-17 03:04:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:28,326 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 [2023-02-17 03:04:28,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:28,327 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:28,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 03:04:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:28,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 03:04:28,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:28,392 INFO L350 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 15 treesize of output 7 [2023-02-17 03:04:28,394 INFO L350 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 15 treesize of output 7 [2023-02-17 03:04:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:28,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:28,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:28,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533183373] [2023-02-17 03:04:28,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533183373] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:28,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:28,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:04:28,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956064105] [2023-02-17 03:04:28,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:28,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:04:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:28,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:04:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:04:28,409 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:28,696 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2023-02-17 03:04:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:04:28,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-17 03:04:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:28,697 INFO L225 Difference]: With dead ends: 103 [2023-02-17 03:04:28,698 INFO L226 Difference]: Without dead ends: 103 [2023-02-17 03:04:28,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:04:28,698 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:28,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 212 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:04:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-17 03:04:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2023-02-17 03:04:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:04:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2023-02-17 03:04:28,706 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 13 [2023-02-17 03:04:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:28,706 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2023-02-17 03:04:28,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2023-02-17 03:04:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 03:04:28,707 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:28,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:28,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:28,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:28,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1303849417, now seen corresponding path program 1 times [2023-02-17 03:04:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:28,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143903929] [2023-02-17 03:04:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:28,914 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 [2023-02-17 03:04:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:28,915 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:28,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 03:04:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:28,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:04:28,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:28,964 INFO L350 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 15 treesize of output 7 [2023-02-17 03:04:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:28,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:28,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:28,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143903929] [2023-02-17 03:04:28,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143903929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:28,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:28,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:04:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968495119] [2023-02-17 03:04:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:28,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:04:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:04:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:04:28,973 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:29,220 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2023-02-17 03:04:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:04:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-17 03:04:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:29,221 INFO L225 Difference]: With dead ends: 98 [2023-02-17 03:04:29,221 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 03:04:29,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:04:29,222 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:29,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 162 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:04:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 03:04:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2023-02-17 03:04:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:04:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2023-02-17 03:04:29,227 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 13 [2023-02-17 03:04:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:29,227 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2023-02-17 03:04:29,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2023-02-17 03:04:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 03:04:29,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:29,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:29,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:29,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:29,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2031085508, now seen corresponding path program 1 times [2023-02-17 03:04:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:29,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289814761] [2023-02-17 03:04:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:29,434 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 [2023-02-17 03:04:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:29,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:29,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 03:04:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:29,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:04:29,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:29,489 INFO L350 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 [2023-02-17 03:04:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:29,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:29,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:29,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289814761] [2023-02-17 03:04:29,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289814761] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:29,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:29,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 03:04:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77896798] [2023-02-17 03:04:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:29,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:04:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:04:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:04:29,519 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:29,833 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2023-02-17 03:04:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:04:29,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-17 03:04:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:29,834 INFO L225 Difference]: With dead ends: 120 [2023-02-17 03:04:29,835 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 03:04:29,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:04:29,835 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 47 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:29,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 378 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:04:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 03:04:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2023-02-17 03:04:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 03:04:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-02-17 03:04:29,839 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 16 [2023-02-17 03:04:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:29,839 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-02-17 03:04:29,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-02-17 03:04:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 03:04:29,840 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:29,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:29,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:30,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:30,048 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2031085507, now seen corresponding path program 1 times [2023-02-17 03:04:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:30,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667105885] [2023-02-17 03:04:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:30,049 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 [2023-02-17 03:04:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:30,050 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:30,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 03:04:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:30,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:04:30,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:30,112 INFO L350 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 [2023-02-17 03:04:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:30,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:30,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:30,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667105885] [2023-02-17 03:04:30,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667105885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:30,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:30,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 03:04:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211268168] [2023-02-17 03:04:30,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:30,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:04:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:04:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:04:30,164 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:30,530 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-02-17 03:04:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:04:30,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-17 03:04:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:30,531 INFO L225 Difference]: With dead ends: 118 [2023-02-17 03:04:30,531 INFO L226 Difference]: Without dead ends: 118 [2023-02-17 03:04:30,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:04:30,532 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:30,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 477 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:04:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-17 03:04:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2023-02-17 03:04:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 03:04:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2023-02-17 03:04:30,536 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 16 [2023-02-17 03:04:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:30,536 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2023-02-17 03:04:30,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2023-02-17 03:04:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 03:04:30,538 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:30,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:30,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:30,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:30,745 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1902002789, now seen corresponding path program 1 times [2023-02-17 03:04:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:30,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190477165] [2023-02-17 03:04:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:30,746 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 [2023-02-17 03:04:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:30,747 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:30,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-17 03:04:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:30,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:04:30,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:30,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:30,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:30,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190477165] [2023-02-17 03:04:30,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190477165] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:30,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:30,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:04:30,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583865194] [2023-02-17 03:04:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:30,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:04:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:04:30,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:04:30,809 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:30,823 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2023-02-17 03:04:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:04:30,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-17 03:04:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:30,824 INFO L225 Difference]: With dead ends: 85 [2023-02-17 03:04:30,824 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 03:04:30,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:04:30,825 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:30,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 284 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:04:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 03:04:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-02-17 03:04:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:04:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2023-02-17 03:04:30,832 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 16 [2023-02-17 03:04:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:30,833 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2023-02-17 03:04:30,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2023-02-17 03:04:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 03:04:30,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:30,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:30,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:31,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:31,043 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:31,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1958018817, now seen corresponding path program 1 times [2023-02-17 03:04:31,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:31,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676079660] [2023-02-17 03:04:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:31,044 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 [2023-02-17 03:04:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:31,045 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:31,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 03:04:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:31,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:04:31,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:31,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:31,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:31,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676079660] [2023-02-17 03:04:31,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676079660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:31,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:31,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:04:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562149686] [2023-02-17 03:04:31,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:31,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:04:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:31,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:04:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:04:31,113 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:31,215 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2023-02-17 03:04:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:04:31,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-17 03:04:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:31,216 INFO L225 Difference]: With dead ends: 79 [2023-02-17 03:04:31,216 INFO L226 Difference]: Without dead ends: 79 [2023-02-17 03:04:31,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:04:31,216 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:31,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:04:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-17 03:04:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-17 03:04:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:04:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2023-02-17 03:04:31,218 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 18 [2023-02-17 03:04:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:31,219 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2023-02-17 03:04:31,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2023-02-17 03:04:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 03:04:31,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:31,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:31,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:31,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:31,421 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1958018816, now seen corresponding path program 1 times [2023-02-17 03:04:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:31,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365999237] [2023-02-17 03:04:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:31,422 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 [2023-02-17 03:04:31,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:31,422 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:31,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 03:04:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:31,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:04:31,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:31,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:31,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:31,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365999237] [2023-02-17 03:04:31,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365999237] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:31,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:31,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:04:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229717490] [2023-02-17 03:04:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:31,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:04:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:04:31,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:04:31,521 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:31,710 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2023-02-17 03:04:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:04:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-17 03:04:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:31,711 INFO L225 Difference]: With dead ends: 78 [2023-02-17 03:04:31,711 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 03:04:31,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:04:31,711 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 72 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:31,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 280 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:04:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 03:04:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-17 03:04:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:04:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2023-02-17 03:04:31,714 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 18 [2023-02-17 03:04:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:31,714 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2023-02-17 03:04:31,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2023-02-17 03:04:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 03:04:31,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:31,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:31,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:31,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:31,915 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1449226599, now seen corresponding path program 1 times [2023-02-17 03:04:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:31,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748738635] [2023-02-17 03:04:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:31,916 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 [2023-02-17 03:04:31,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:31,917 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:31,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 03:04:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:31,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:04:31,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:31,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:31,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:31,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748738635] [2023-02-17 03:04:31,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748738635] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:31,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:31,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:04:31,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496031910] [2023-02-17 03:04:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:31,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:04:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:31,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:04:31,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:04:31,984 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:32,164 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2023-02-17 03:04:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:04:32,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-17 03:04:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:32,165 INFO L225 Difference]: With dead ends: 76 [2023-02-17 03:04:32,165 INFO L226 Difference]: Without dead ends: 76 [2023-02-17 03:04:32,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:04:32,166 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 94 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:32,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 67 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:04:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-17 03:04:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-17 03:04:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:04:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-17 03:04:32,168 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 19 [2023-02-17 03:04:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:32,168 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-17 03:04:32,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-17 03:04:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 03:04:32,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:32,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:04:32,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:32,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:32,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:32,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1449226600, now seen corresponding path program 1 times [2023-02-17 03:04:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:32,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676016895] [2023-02-17 03:04:32,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:32,376 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 [2023-02-17 03:04:32,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:32,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:32,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 03:04:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:32,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:04:32,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:32,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:32,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:32,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676016895] [2023-02-17 03:04:32,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676016895] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:32,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:32,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:04:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50512175] [2023-02-17 03:04:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:32,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:04:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:04:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:04:32,454 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:32,642 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2023-02-17 03:04:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:04:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-17 03:04:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:32,643 INFO L225 Difference]: With dead ends: 86 [2023-02-17 03:04:32,643 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 03:04:32,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:04:32,644 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:32,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:04:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 03:04:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2023-02-17 03:04:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 03:04:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2023-02-17 03:04:32,646 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 19 [2023-02-17 03:04:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:32,646 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2023-02-17 03:04:32,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:04:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2023-02-17 03:04:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 03:04:32,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:32,647 INFO L195 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] [2023-02-17 03:04:32,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:32,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:32,854 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 59862981, now seen corresponding path program 1 times [2023-02-17 03:04:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:32,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003230090] [2023-02-17 03:04:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:32,855 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 [2023-02-17 03:04:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:32,856 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:32,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-17 03:04:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:32,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:04:32,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:32,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:32,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:32,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003230090] [2023-02-17 03:04:32,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003230090] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:32,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:32,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:04:32,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712300212] [2023-02-17 03:04:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:32,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:04:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:32,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:04:32,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:04:32,921 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:04:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:33,030 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2023-02-17 03:04:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:04:33,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-17 03:04:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:33,031 INFO L225 Difference]: With dead ends: 85 [2023-02-17 03:04:33,031 INFO L226 Difference]: Without dead ends: 66 [2023-02-17 03:04:33,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:04:33,032 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:33,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 69 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:04:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-17 03:04:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-17 03:04:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2023-02-17 03:04:33,034 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 24 [2023-02-17 03:04:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:33,035 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2023-02-17 03:04:33,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:04:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2023-02-17 03:04:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 03:04:33,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:33,035 INFO L195 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] [2023-02-17 03:04:33,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:33,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:33,252 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash -929247957, now seen corresponding path program 1 times [2023-02-17 03:04:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:33,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184866207] [2023-02-17 03:04:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:33,253 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 [2023-02-17 03:04:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:33,254 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:33,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 03:04:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:33,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-17 03:04:33,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:33,357 INFO L350 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 [2023-02-17 03:04:33,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:33,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:33,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:04:33,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:04:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:33,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:33,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:33,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184866207] [2023-02-17 03:04:33,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184866207] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:33,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:33,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-17 03:04:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997272375] [2023-02-17 03:04:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:33,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 03:04:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 03:04:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:04:33,555 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:34,351 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-02-17 03:04:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 03:04:34,351 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-17 03:04:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:34,352 INFO L225 Difference]: With dead ends: 87 [2023-02-17 03:04:34,352 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 03:04:34,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-02-17 03:04:34,352 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:34,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 03:04:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 03:04:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2023-02-17 03:04:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2023-02-17 03:04:34,354 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 27 [2023-02-17 03:04:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:34,355 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2023-02-17 03:04:34,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2023-02-17 03:04:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 03:04:34,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:34,355 INFO L195 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] [2023-02-17 03:04:34,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:34,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:34,555 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash -929247958, now seen corresponding path program 1 times [2023-02-17 03:04:34,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:34,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660929603] [2023-02-17 03:04:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:34,556 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 [2023-02-17 03:04:34,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:34,558 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:34,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-17 03:04:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:34,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:04:34,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:34,635 INFO L350 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 [2023-02-17 03:04:34,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:34,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:04:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:34,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:34,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660929603] [2023-02-17 03:04:34,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660929603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:34,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:34,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-17 03:04:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337448296] [2023-02-17 03:04:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:34,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:04:34,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:04:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:04:34,764 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:35,430 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2023-02-17 03:04:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 03:04:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-17 03:04:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:35,432 INFO L225 Difference]: With dead ends: 90 [2023-02-17 03:04:35,432 INFO L226 Difference]: Without dead ends: 90 [2023-02-17 03:04:35,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-02-17 03:04:35,432 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 127 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:35,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 265 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 03:04:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-17 03:04:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2023-02-17 03:04:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:04:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2023-02-17 03:04:35,434 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 27 [2023-02-17 03:04:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:35,435 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2023-02-17 03:04:35,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2023-02-17 03:04:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 03:04:35,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:35,435 INFO L195 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] [2023-02-17 03:04:35,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:35,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:35,636 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1379353082, now seen corresponding path program 1 times [2023-02-17 03:04:35,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:35,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903060769] [2023-02-17 03:04:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:35,637 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 [2023-02-17 03:04:35,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:35,638 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:35,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 03:04:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:35,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 03:04:35,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:35,722 INFO L350 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 [2023-02-17 03:04:35,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:35,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:04:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:35,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:35,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:35,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903060769] [2023-02-17 03:04:35,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903060769] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:35,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:35,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-17 03:04:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170267914] [2023-02-17 03:04:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:35,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 03:04:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 03:04:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-02-17 03:04:35,859 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:36,683 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2023-02-17 03:04:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 03:04:36,684 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-17 03:04:36,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:36,684 INFO L225 Difference]: With dead ends: 93 [2023-02-17 03:04:36,684 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 03:04:36,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2023-02-17 03:04:36,685 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:36,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 276 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 03:04:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 03:04:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2023-02-17 03:04:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:04:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2023-02-17 03:04:36,687 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 32 [2023-02-17 03:04:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:36,687 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2023-02-17 03:04:36,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2023-02-17 03:04:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 03:04:36,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:36,688 INFO L195 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] [2023-02-17 03:04:36,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:36,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:36,895 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:36,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1379353083, now seen corresponding path program 1 times [2023-02-17 03:04:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:36,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715034554] [2023-02-17 03:04:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:36,896 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 [2023-02-17 03:04:36,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:36,897 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:36,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-17 03:04:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:36,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-17 03:04:36,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:36,982 INFO L350 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 [2023-02-17 03:04:37,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:37,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:37,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:04:37,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:04:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:37,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:37,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:37,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715034554] [2023-02-17 03:04:37,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715034554] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:37,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:37,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-17 03:04:37,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543305279] [2023-02-17 03:04:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:37,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 03:04:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 03:04:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:04:37,185 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:38,165 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2023-02-17 03:04:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 03:04:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-17 03:04:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:38,166 INFO L225 Difference]: With dead ends: 87 [2023-02-17 03:04:38,166 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 03:04:38,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2023-02-17 03:04:38,167 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:38,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 317 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 03:04:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 03:04:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2023-02-17 03:04:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:04:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-17 03:04:38,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 32 [2023-02-17 03:04:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:38,169 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-17 03:04:38,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-17 03:04:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 03:04:38,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:38,170 INFO L195 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] [2023-02-17 03:04:38,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:38,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:38,379 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash -193116151, now seen corresponding path program 1 times [2023-02-17 03:04:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:38,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230029016] [2023-02-17 03:04:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:38,379 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 [2023-02-17 03:04:38,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:38,380 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:38,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-17 03:04:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:38,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 03:04:38,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:38,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:04:38,473 INFO L350 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 11 treesize of output 15 [2023-02-17 03:04:38,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:38,560 INFO L350 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 16 treesize of output 8 [2023-02-17 03:04:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:04:38,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:04:38,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:04:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230029016] [2023-02-17 03:04:38,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230029016] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:04:38,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:04:38,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-17 03:04:38,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506382124] [2023-02-17 03:04:38,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:04:38,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 03:04:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:04:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 03:04:38,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-02-17 03:04:38,586 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:04:39,162 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2023-02-17 03:04:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 03:04:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2023-02-17 03:04:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:04:39,163 INFO L225 Difference]: With dead ends: 77 [2023-02-17 03:04:39,163 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 03:04:39,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2023-02-17 03:04:39,164 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 131 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:04:39,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 98 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 03:04:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 03:04:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-02-17 03:04:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:04:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-02-17 03:04:39,166 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 33 [2023-02-17 03:04:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:04:39,166 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-02-17 03:04:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:04:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-02-17 03:04:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 03:04:39,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:04:39,166 INFO L195 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] [2023-02-17 03:04:39,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-17 03:04:39,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:04:39,367 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:04:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:04:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1939380463, now seen corresponding path program 1 times [2023-02-17 03:04:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:04:39,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186347007] [2023-02-17 03:04:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:04:39,368 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 [2023-02-17 03:04:39,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:04:39,369 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:04:39,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-17 03:04:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:04:39,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-17 03:04:39,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:04:39,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:04:39,516 INFO L350 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 11 treesize of output 15 [2023-02-17 03:04:39,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:04:39,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:04:39,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:04:39,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:04:39,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:04:39,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2023-02-17 03:04:39,778 INFO L350 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 43 treesize of output 35 [2023-02-17 03:04:39,817 INFO L350 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 84 treesize of output 60 [2023-02-17 03:04:40,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:04:40,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 111 treesize of output 276 [2023-02-17 03:05:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:05:02,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:05:02,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:05:02,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186347007] [2023-02-17 03:05:02,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186347007] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:05:02,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:05:02,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-17 03:05:02,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363216846] [2023-02-17 03:05:02,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:05:02,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 03:05:02,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:05:02,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 03:05:02,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2023-02-17 03:05:02,625 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:05:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:05:04,642 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2023-02-17 03:05:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-17 03:05:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2023-02-17 03:05:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:05:04,643 INFO L225 Difference]: With dead ends: 77 [2023-02-17 03:05:04,643 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 03:05:04,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 03:05:04,644 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 123 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 03:05:04,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 353 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 851 Invalid, 1 Unknown, 0 Unchecked, 1.4s Time] [2023-02-17 03:05:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 03:05:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-02-17 03:05:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:05:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2023-02-17 03:05:04,647 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 35 [2023-02-17 03:05:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:05:04,647 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2023-02-17 03:05:04,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:05:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2023-02-17 03:05:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 03:05:04,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:05:04,648 INFO L195 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] [2023-02-17 03:05:04,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-02-17 03:05:04,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:05:04,855 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:05:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:05:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1939380462, now seen corresponding path program 1 times [2023-02-17 03:05:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:05:04,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867401819] [2023-02-17 03:05:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:05:04,857 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 [2023-02-17 03:05:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:05:04,858 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:05:04,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 03:05:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:05:04,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-17 03:05:04,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:05:05,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:05,002 INFO L350 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 11 treesize of output 15 [2023-02-17 03:05:05,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:05:05,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:05:05,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:05:05,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:05:05,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:05:05,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:05:05,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:05:05,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:05:05,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:05,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2023-02-17 03:05:05,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:05,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2023-02-17 03:05:05,300 INFO L350 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 60 treesize of output 48 [2023-02-17 03:05:05,304 INFO L350 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 56 treesize of output 44 [2023-02-17 03:05:05,501 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 03:05:05,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:05,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 111 [2023-02-17 03:05:05,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:05,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 73 [2023-02-17 03:05:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:05:05,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:05:05,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:05:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867401819] [2023-02-17 03:05:05,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867401819] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:05:05,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:05:05,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-02-17 03:05:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84107761] [2023-02-17 03:05:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:05:05,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 03:05:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:05:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 03:05:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2023-02-17 03:05:05,594 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:05:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:05:07,215 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2023-02-17 03:05:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 03:05:07,216 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2023-02-17 03:05:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:05:07,216 INFO L225 Difference]: With dead ends: 76 [2023-02-17 03:05:07,216 INFO L226 Difference]: Without dead ends: 76 [2023-02-17 03:05:07,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2023-02-17 03:05:07,217 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 109 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:05:07,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 414 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 03:05:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-17 03:05:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-02-17 03:05:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:05:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2023-02-17 03:05:07,219 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 35 [2023-02-17 03:05:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:05:07,220 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2023-02-17 03:05:07,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:05:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2023-02-17 03:05:07,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 03:05:07,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:05:07,220 INFO L195 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] [2023-02-17 03:05:07,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-02-17 03:05:07,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:05:07,429 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:05:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:05:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash 8747840, now seen corresponding path program 1 times [2023-02-17 03:05:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:05:07,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921369629] [2023-02-17 03:05:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:05:07,430 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 [2023-02-17 03:05:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:05:07,431 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:05:07,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-17 03:05:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:05:07,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-17 03:05:07,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:05:07,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:07,555 INFO L350 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 11 treesize of output 15 [2023-02-17 03:05:07,622 INFO L350 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 [2023-02-17 03:05:07,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:07,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 50 [2023-02-17 03:05:07,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:05:07,783 INFO L350 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 92 treesize of output 68 [2023-02-17 03:05:07,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:05:07,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 125 treesize of output 308 [2023-02-17 03:06:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:27,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:06:27,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:27,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921369629] [2023-02-17 03:06:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921369629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:06:27,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:06:27,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-17 03:06:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855438148] [2023-02-17 03:06:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:06:27,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 03:06:27,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 03:06:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2023-02-17 03:06:27,473 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:06:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:29,405 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2023-02-17 03:06:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 03:06:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2023-02-17 03:06:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:29,406 INFO L225 Difference]: With dead ends: 75 [2023-02-17 03:06:29,406 INFO L226 Difference]: Without dead ends: 75 [2023-02-17 03:06:29,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 03:06:29,407 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 136 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:29,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 143 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 855 Invalid, 1 Unknown, 0 Unchecked, 1.3s Time] [2023-02-17 03:06:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-17 03:06:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-02-17 03:06:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:06:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2023-02-17 03:06:29,409 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 36 [2023-02-17 03:06:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:29,409 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2023-02-17 03:06:29,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:06:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2023-02-17 03:06:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 03:06:29,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:29,410 INFO L195 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] [2023-02-17 03:06:29,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-02-17 03:06:29,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:29,618 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash 8747841, now seen corresponding path program 1 times [2023-02-17 03:06:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:29,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51361115] [2023-02-17 03:06:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:29,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:29,619 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:29,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-17 03:06:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:29,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-17 03:06:29,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:29,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:29,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 03:06:29,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:29,765 INFO L350 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 11 treesize of output 15 [2023-02-17 03:06:29,828 INFO L350 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 [2023-02-17 03:06:29,832 INFO L350 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 [2023-02-17 03:06:29,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:29,859 INFO L350 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 64 [2023-02-17 03:06:29,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:29,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 50 [2023-02-17 03:06:30,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:30,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 142 [2023-02-17 03:06:30,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:30,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 38 [2023-02-17 03:06:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:30,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:06:30,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:30,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51361115] [2023-02-17 03:06:30,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51361115] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:06:30,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:06:30,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-02-17 03:06:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935687173] [2023-02-17 03:06:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:06:30,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 03:06:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 03:06:30,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2023-02-17 03:06:30,179 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:06:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:31,829 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2023-02-17 03:06:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 03:06:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2023-02-17 03:06:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:31,831 INFO L225 Difference]: With dead ends: 74 [2023-02-17 03:06:31,831 INFO L226 Difference]: Without dead ends: 74 [2023-02-17 03:06:31,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 03:06:31,831 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 141 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:31,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 127 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-17 03:06:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-17 03:06:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-02-17 03:06:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:06:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2023-02-17 03:06:31,833 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 36 [2023-02-17 03:06:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:31,833 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2023-02-17 03:06:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:06:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2023-02-17 03:06:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 03:06:31,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:31,834 INFO L195 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] [2023-02-17 03:06:31,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-02-17 03:06:32,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:32,042 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash -555084404, now seen corresponding path program 1 times [2023-02-17 03:06:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:32,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011872928] [2023-02-17 03:06:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:32,043 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 [2023-02-17 03:06:32,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:32,044 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:32,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-17 03:06:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:32,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 03:06:32,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:32,191 INFO L350 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 [2023-02-17 03:06:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:32,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:06:32,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:32,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011872928] [2023-02-17 03:06:32,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011872928] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:06:32,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:06:32,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 03:06:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46900918] [2023-02-17 03:06:32,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:06:32,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:06:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:32,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:06:32,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:06:32,201 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:06:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:32,490 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2023-02-17 03:06:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:06:32,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-02-17 03:06:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:32,491 INFO L225 Difference]: With dead ends: 77 [2023-02-17 03:06:32,491 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 03:06:32,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:06:32,491 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 41 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:32,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 221 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:06:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 03:06:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-02-17 03:06:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.25) internal successors, (65), 63 states have internal predecessors, (65), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:06:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-17 03:06:32,493 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 41 [2023-02-17 03:06:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:32,494 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-17 03:06:32,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:06:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-17 03:06:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 03:06:32,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:32,494 INFO L195 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] [2023-02-17 03:06:32,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-17 03:06:32,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:32,702 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash -555084403, now seen corresponding path program 1 times [2023-02-17 03:06:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:32,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300094444] [2023-02-17 03:06:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:32,703 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 [2023-02-17 03:06:32,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:32,704 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:32,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-17 03:06:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:32,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-17 03:06:32,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:32,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:32,883 INFO L350 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 11 treesize of output 15 [2023-02-17 03:06:32,886 INFO L350 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 12 treesize of output 14 [2023-02-17 03:06:32,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:06:32,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:06:32,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:06:32,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:06:33,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:06:33,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:06:33,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:06:33,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:06:33,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:33,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2023-02-17 03:06:33,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:33,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2023-02-17 03:06:33,116 INFO L350 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 43 treesize of output 35 [2023-02-17 03:06:33,127 INFO L350 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 43 treesize of output 35 [2023-02-17 03:06:33,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:33,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 124 [2023-02-17 03:06:33,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:33,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 17 [2023-02-17 03:06:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:33,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:06:33,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:33,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300094444] [2023-02-17 03:06:33,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300094444] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:06:33,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:06:33,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-02-17 03:06:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223378277] [2023-02-17 03:06:33,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:06:33,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 03:06:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 03:06:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-02-17 03:06:33,298 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 03:06:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:34,545 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2023-02-17 03:06:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 03:06:34,546 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2023-02-17 03:06:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:34,546 INFO L225 Difference]: With dead ends: 77 [2023-02-17 03:06:34,546 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 03:06:34,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 03:06:34,547 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 79 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:34,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 283 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 03:06:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 03:06:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-02-17 03:06:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 63 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 03:06:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2023-02-17 03:06:34,549 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 41 [2023-02-17 03:06:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:34,549 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2023-02-17 03:06:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 03:06:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2023-02-17 03:06:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 03:06:34,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:34,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:06:34,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-02-17 03:06:34,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:34,758 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1459271833, now seen corresponding path program 1 times [2023-02-17 03:06:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:34,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974383450] [2023-02-17 03:06:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:34,759 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 [2023-02-17 03:06:34,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:34,760 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:34,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-17 03:06:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:34,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 03:06:34,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:34,904 INFO L350 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 [2023-02-17 03:06:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:34,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:06:34,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:34,962 INFO L350 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 18 treesize of output 22 [2023-02-17 03:06:34,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:34,975 INFO L350 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 16 treesize of output 20 [2023-02-17 03:06:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:35,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:35,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974383450] [2023-02-17 03:06:35,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974383450] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:06:35,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:06:35,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2023-02-17 03:06:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831608237] [2023-02-17 03:06:35,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:06:35,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 03:06:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 03:06:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-02-17 03:06:35,011 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:06:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:35,463 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-02-17 03:06:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 03:06:35,464 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2023-02-17 03:06:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:35,464 INFO L225 Difference]: With dead ends: 87 [2023-02-17 03:06:35,464 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 03:06:35,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2023-02-17 03:06:35,466 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 91 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:35,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 309 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 03:06:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 03:06:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2023-02-17 03:06:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.25) internal successors, (70), 67 states have internal predecessors, (70), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 03:06:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2023-02-17 03:06:35,469 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 46 [2023-02-17 03:06:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:35,470 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2023-02-17 03:06:35,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:06:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2023-02-17 03:06:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 03:06:35,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:35,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:06:35,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-02-17 03:06:35,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:35,679 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1459271832, now seen corresponding path program 1 times [2023-02-17 03:06:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:35,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536909146] [2023-02-17 03:06:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:35,679 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 [2023-02-17 03:06:35,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:35,681 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:35,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-17 03:06:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:35,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 03:06:35,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:35,912 INFO L350 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 31 treesize of output 19 [2023-02-17 03:06:35,914 INFO L350 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 48 treesize of output 24 [2023-02-17 03:06:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:36,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:06:36,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:36,577 INFO L350 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 65 treesize of output 67 [2023-02-17 03:06:37,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:37,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 437 treesize of output 595 [2023-02-17 03:06:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:39,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:39,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536909146] [2023-02-17 03:06:39,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536909146] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:06:39,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:06:39,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-17 03:06:39,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589691241] [2023-02-17 03:06:39,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:06:39,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 03:06:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:39,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 03:06:39,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2023-02-17 03:06:39,920 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 03:06:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:46,204 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-02-17 03:06:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 03:06:46,207 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2023-02-17 03:06:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:46,208 INFO L225 Difference]: With dead ends: 87 [2023-02-17 03:06:46,208 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 03:06:46,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 03:06:46,209 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 89 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:46,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 512 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-02-17 03:06:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 03:06:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-02-17 03:06:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 68 states have internal predecessors, (70), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 03:06:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2023-02-17 03:06:46,216 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 46 [2023-02-17 03:06:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:46,217 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2023-02-17 03:06:46,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 03:06:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2023-02-17 03:06:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 03:06:46,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:46,218 INFO L195 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] [2023-02-17 03:06:46,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-02-17 03:06:46,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:46,426 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2003824700, now seen corresponding path program 1 times [2023-02-17 03:06:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:46,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947727104] [2023-02-17 03:06:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:46,427 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 [2023-02-17 03:06:46,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:46,428 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:46,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-17 03:06:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:46,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 03:06:46,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 03:06:46,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:06:46,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:46,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947727104] [2023-02-17 03:06:46,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947727104] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:06:46,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:06:46,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:06:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970529904] [2023-02-17 03:06:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:06:46,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:06:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:46,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:06:46,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:06:46,578 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 03:06:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:46,805 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2023-02-17 03:06:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:06:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2023-02-17 03:06:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:46,806 INFO L225 Difference]: With dead ends: 81 [2023-02-17 03:06:46,806 INFO L226 Difference]: Without dead ends: 81 [2023-02-17 03:06:46,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:06:46,807 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 49 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:46,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 152 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:06:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-17 03:06:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-17 03:06:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 67 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 03:06:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-02-17 03:06:46,809 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 47 [2023-02-17 03:06:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:46,809 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-02-17 03:06:46,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 03:06:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-02-17 03:06:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 03:06:46,810 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:46,810 INFO L195 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] [2023-02-17 03:06:46,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-17 03:06:47,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:47,013 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1989023560, now seen corresponding path program 1 times [2023-02-17 03:06:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:47,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002677982] [2023-02-17 03:06:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:47,014 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 [2023-02-17 03:06:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:47,015 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:47,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-17 03:06:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:47,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:06:47,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:47,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:06:47,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:06:47,200 INFO L350 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 25 treesize of output 17 [2023-02-17 03:06:47,201 INFO L350 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 13 [2023-02-17 03:06:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 03:06:47,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:06:47,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:47,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002677982] [2023-02-17 03:06:47,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002677982] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:06:47,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:06:47,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 03:06:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275155506] [2023-02-17 03:06:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:06:47,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:06:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:06:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:06:47,248 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 03:06:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:47,770 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2023-02-17 03:06:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 03:06:47,770 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2023-02-17 03:06:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:47,771 INFO L225 Difference]: With dead ends: 80 [2023-02-17 03:06:47,771 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 03:06:47,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2023-02-17 03:06:47,771 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:47,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 224 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 03:06:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 03:06:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-17 03:06:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 66 states have internal predecessors, (68), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 03:06:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2023-02-17 03:06:47,774 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 48 [2023-02-17 03:06:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:47,774 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2023-02-17 03:06:47,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 03:06:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2023-02-17 03:06:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 03:06:47,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:47,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:06:47,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-02-17 03:06:47,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:47,977 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:47,977 INFO L85 PathProgramCache]: Analyzing trace with hash 491835012, now seen corresponding path program 1 times [2023-02-17 03:06:47,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:47,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137313640] [2023-02-17 03:06:47,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:47,978 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 [2023-02-17 03:06:47,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:47,978 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:47,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-17 03:06:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:48,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-17 03:06:48,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:48,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:48,174 INFO L350 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 11 treesize of output 15 [2023-02-17 03:06:48,177 INFO L350 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 12 treesize of output 14 [2023-02-17 03:06:48,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:06:48,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:06:48,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:06:48,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:06:48,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:48,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2023-02-17 03:06:48,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:06:48,366 INFO L350 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 43 treesize of output 35 [2023-02-17 03:06:48,397 INFO L350 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 84 treesize of output 60 [2023-02-17 03:06:48,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:48,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 37 [2023-02-17 03:06:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:48,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:06:49,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:06:49,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137313640] [2023-02-17 03:06:49,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137313640] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:06:49,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1380216954] [2023-02-17 03:06:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:49,302 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:06:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:06:49,303 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 03:06:49,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-02-17 03:06:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:06:49,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-17 03:06:49,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:06:49,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:49,645 INFO L350 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 11 treesize of output 15 [2023-02-17 03:06:49,648 INFO L350 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 12 treesize of output 14 [2023-02-17 03:06:49,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-17 03:06:49,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:06:49,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:06:49,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:06:49,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:49,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2023-02-17 03:06:49,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:06:49,687 INFO L350 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 43 treesize of output 35 [2023-02-17 03:06:49,694 INFO L350 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 84 treesize of output 60 [2023-02-17 03:06:49,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:49,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 31 [2023-02-17 03:06:50,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:06:50,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 37 [2023-02-17 03:06:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:06:50,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:06:50,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1380216954] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:06:50,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:06:50,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 28 [2023-02-17 03:06:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132503865] [2023-02-17 03:06:50,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:06:50,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 03:06:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:06:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 03:06:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 03:06:50,090 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 29 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:06:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:06:52,185 INFO L93 Difference]: Finished difference Result 56 states and 55 transitions. [2023-02-17 03:06:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 03:06:52,185 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 49 [2023-02-17 03:06:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:06:52,186 INFO L225 Difference]: With dead ends: 56 [2023-02-17 03:06:52,186 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 03:06:52,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=253, Invalid=2827, Unknown=0, NotChecked=0, Total=3080 [2023-02-17 03:06:52,187 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:06:52,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 275 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-17 03:06:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 03:06:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-17 03:06:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:06:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2023-02-17 03:06:52,188 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 49 [2023-02-17 03:06:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:06:52,188 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2023-02-17 03:06:52,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 03:06:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2023-02-17 03:06:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 03:06:52,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:06:52,189 INFO L195 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] [2023-02-17 03:06:52,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-02-17 03:06:52,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-17 03:06:52,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:52,593 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-17 03:06:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:06:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash -945482383, now seen corresponding path program 1 times [2023-02-17 03:06:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:06:52,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10816407] [2023-02-17 03:06:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:06:52,595 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 [2023-02-17 03:06:52,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:06:52,596 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:06:52,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-17 03:06:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:06:52,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 03:06:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:06:52,933 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-17 03:06:52,933 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 03:06:52,934 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (28 of 29 remaining) [2023-02-17 03:06:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 29 remaining) [2023-02-17 03:06:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 29 remaining) [2023-02-17 03:06:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 29 remaining) [2023-02-17 03:06:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 29 remaining) [2023-02-17 03:06:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 29 remaining) [2023-02-17 03:06:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 29 remaining) [2023-02-17 03:06:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 29 remaining) [2023-02-17 03:06:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 29 remaining) [2023-02-17 03:06:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 29 remaining) [2023-02-17 03:06:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 29 remaining) [2023-02-17 03:06:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 29 remaining) [2023-02-17 03:06:52,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 29 remaining) [2023-02-17 03:06:52,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 29 remaining) [2023-02-17 03:06:52,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 29 remaining) [2023-02-17 03:06:52,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 29 remaining) [2023-02-17 03:06:52,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 29 remaining) [2023-02-17 03:06:52,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 29 remaining) [2023-02-17 03:06:52,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 29 remaining) [2023-02-17 03:06:52,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 29 remaining) [2023-02-17 03:06:52,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 29 remaining) [2023-02-17 03:06:52,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 29 remaining) [2023-02-17 03:06:52,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 29 remaining) [2023-02-17 03:06:52,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 29 remaining) [2023-02-17 03:06:52,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 29 remaining) [2023-02-17 03:06:52,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 29 remaining) [2023-02-17 03:06:52,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 29 remaining) [2023-02-17 03:06:52,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 29 remaining) [2023-02-17 03:06:52,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 29 remaining) [2023-02-17 03:06:52,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-17 03:06:53,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:06:53,143 INFO L445 BasicCegarLoop]: Path program 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] [2023-02-17 03:06:53,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 03:06:53,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 03:06:53 BoogieIcfgContainer [2023-02-17 03:06:53,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 03:06:53,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 03:06:53,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 03:06:53,183 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 03:06:53,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:04:20" (3/4) ... [2023-02-17 03:06:53,186 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 03:06:53,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 03:06:53,187 INFO L158 Benchmark]: Toolchain (without parser) took 153739.17ms. Allocated memory was 88.1MB in the beginning and 465.6MB in the end (delta: 377.5MB). Free memory was 62.5MB in the beginning and 273.0MB in the end (delta: -210.5MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. [2023-02-17 03:06:53,187 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 58.7MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:06:53,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.22ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 56.2MB in the end (delta: 6.3MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2023-02-17 03:06:53,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 53.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 03:06:53,187 INFO L158 Benchmark]: Boogie Preprocessor took 22.66ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 52.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:06:53,188 INFO L158 Benchmark]: RCFGBuilder took 467.40ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 62.0MB in the end (delta: -10.0MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-02-17 03:06:53,188 INFO L158 Benchmark]: TraceAbstraction took 152755.15ms. Allocated memory was 88.1MB in the beginning and 465.6MB in the end (delta: 377.5MB). Free memory was 61.5MB in the beginning and 273.0MB in the end (delta: -211.4MB). Peak memory consumption was 166.4MB. Max. memory is 16.1GB. [2023-02-17 03:06:53,188 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 465.6MB. Free memory is still 273.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:06:53,189 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 58.7MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.22ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 56.2MB in the end (delta: 6.3MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 53.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.66ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 52.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 467.40ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 62.0MB in the end (delta: -10.0MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 152755.15ms. Allocated memory was 88.1MB in the beginning and 465.6MB in the end (delta: 377.5MB). Free memory was 61.5MB in the beginning and 273.0MB in the end (delta: -211.4MB). Peak memory consumption was 166.4MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 465.6MB. Free memory is still 273.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 780]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 780. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L757] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L781] CALL entry_point() [L776] CALL alloc_13() [L763] CALL, EXPR ldv_malloc(sizeof(struct A13)) VAL [\old(size)=12, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L763] RET, EXPR ldv_malloc(sizeof(struct A13)) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct A13))={6:0}] [L763] struct A13 *p = (struct A13 *)ldv_malloc(sizeof(struct A13)); [L764] COND TRUE \read(*p) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L765] CALL ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={2:0}, head={2:0}, ldv_global_msg_list={1:0}, new={6:4}] [L559] EXPR head->next VAL [global_list_13={2:0}, head={2:0}, head={2:0}, head->next={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}] [L559] CALL __ldv_list_add(new, head, head->next) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, next={2:0}, prev={2:0}] [L547] next->prev = new VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L548] new->next = next VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L549] new->prev = prev VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L550] prev->next = new VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L559] RET __ldv_list_add(new, head, head->next) VAL [global_list_13={2:0}, head={2:0}, head={2:0}, head->next={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}] [L765] RET ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L776] RET alloc_13() [L777] CALL free_unsafe_13() [L769] struct A13 *p; [L770] struct A13 *n; VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L771] EXPR (&global_list_13)->next VAL [(&global_list_13)->next={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L771] const typeof( ((typeof(*p) *)0)->list ) *__mptr = ((&global_list_13)->next); [L771] p = ({ const typeof( ((typeof(*p) *)0)->list ) *__mptr = ((&global_list_13)->next); (typeof(*p) *)( (char *)__mptr - ((size_t) &((typeof(*p) *)0)->list) );}) VAL [__mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L771] EXPR (p)->list.next VAL [(p)->list.next={2:0}, __mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L771] const typeof( ((typeof(*(p)) *)0)->list ) *__mptr = ((p)->list.next); [L771] n = ({ const typeof( ((typeof(*(p)) *)0)->list ) *__mptr = ((p)->list.next); (typeof(*(p)) *)( (char *)__mptr - ((size_t) &((typeof(*(p)) *)0)->list) );}) VAL [__mptr={2:0}, __mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={6:0}] [L771] COND TRUE &p->list != (&global_list_13) VAL [__mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={6:0}] [L772] CALL ldv_list_del(&p->list) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L567] EXPR entry->prev VAL [entry={6:4}, entry={6:4}, entry->prev={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L567] EXPR entry->next VAL [entry={6:4}, entry={6:4}, entry->next={2:0}, entry->prev={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L567] CALL __ldv_list_del(entry->prev, entry->next) [L554] next->prev = prev VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L555] prev->next = next VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L567] RET __ldv_list_del(entry->prev, entry->next) [L772] RET ldv_list_del(&p->list) VAL [__mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={6:0}] [L771] p = n VAL [__mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L771] EXPR (n)->list.next VAL [(n)->list.next={2:0}, __mptr={2:0}, __mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L771] const typeof( ((typeof(*(n)) *)0)->list ) *__mptr = ((n)->list.next); [L771] n = ({ const typeof( ((typeof(*(n)) *)0)->list ) *__mptr = ((n)->list.next); (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) );}) VAL [__mptr={2:0}, __mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L771] COND FALSE !(&p->list != (&global_list_13)) VAL [__mptr={2:0}, __mptr={2:0}, __mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L777] RET free_unsafe_13() [L778] CALL LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, list={2:0}] [L540] list->next = list VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, list={2:0}, list={2:0}] [L541] list->prev = list VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, list={2:0}, list={2:0}] [L778] RET LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L781] RET entry_point() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 82 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 152.7s, OverallIterations: 32, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 2507 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2465 mSDsluCounter, 7615 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6333 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12253 IncrementalHoareTripleChecker+Invalid, 12685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 1282 mSDtfsCounter, 12253 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1230 GetRequests, 643 SyntacticMatches, 6 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, InterpolantAutomatonStates: 420, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 276 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 116.2s InterpolantComputationTime, 951 NumberOfCodeBlocks, 951 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 957 ConstructedInterpolants, 146 QuantifiedInterpolants, 24726 SizeOfPredicates, 396 NumberOfNonLiveVariables, 4833 ConjunctsInSsa, 884 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 8/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-17 03:06:53,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample