./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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_test11_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 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:23:59,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:23:59,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:23:59,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:23:59,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:23:59,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:23:59,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:23:59,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:23:59,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:23:59,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:23:59,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:23:59,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:23:59,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:23:59,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:23:59,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:23:59,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:23:59,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:23:59,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:23:59,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:23:59,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:23:59,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:23:59,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:23:59,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:23:59,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:23:59,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:23:59,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:23:59,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:23:59,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:23:59,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:23:59,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:23:59,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:23:59,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:23:59,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:23:59,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:23:59,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:23:59,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:23:59,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:23:59,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:23:59,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:23:59,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:23:59,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:23:59,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:23:59,399 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:23:59,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:23:59,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:23:59,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:23:59,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:23:59,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:23:59,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:23:59,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:23:59,403 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:23:59,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:23:59,403 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:23:59,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:23:59,404 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:23:59,405 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:23:59,405 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:23:59,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:23:59,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:23:59,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:23:59,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:23:59,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:23:59,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:23:59,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:23:59,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:23:59,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:23:59,407 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:23:59,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:23:59,407 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:23:59,407 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 -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2023-02-16 03:23:59,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:23:59,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:23:59,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:23:59,636 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:23:59,636 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:23:59,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-16 03:24:00,539 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:24:00,746 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:24:00,746 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-16 03:24:00,756 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1161a8f4a/e4fefb31073d45f08dd107a88cb9a16a/FLAGe2bacc935 [2023-02-16 03:24:00,765 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1161a8f4a/e4fefb31073d45f08dd107a88cb9a16a [2023-02-16 03:24:00,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:24:00,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:24:00,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:00,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:24:00,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:24:00,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:00" (1/1) ... [2023-02-16 03:24:00,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37180f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:00, skipping insertion in model container [2023-02-16 03:24:00,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:00" (1/1) ... [2023-02-16 03:24:00,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:24:00,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:24:01,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:01,104 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-16 03:24:01,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@22687804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:01, skipping insertion in model container [2023-02-16 03:24:01,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:01,106 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:24:01,108 INFO L158 Benchmark]: Toolchain (without parser) took 339.67ms. Allocated memory is still 172.0MB. Free memory was 134.2MB in the beginning and 119.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:24:01,108 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:24:01,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.22ms. Allocated memory is still 172.0MB. Free memory was 134.1MB in the beginning and 120.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:24:01,109 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.14ms. Allocated memory is still 111.1MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.22ms. Allocated memory is still 172.0MB. Free memory was 134.1MB in the beginning and 120.3MB in the end (delta: 13.8MB). 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_test11_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 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:24:02,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:24:02,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:24:02,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:24:02,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:24:02,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:24:02,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:24:02,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:24:02,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:24:02,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:24:02,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:24:02,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:24:02,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:24:02,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:24:02,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:24:02,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:24:02,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:24:02,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:24:02,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:24:02,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:24:02,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:24:02,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:24:02,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:24:02,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:24:02,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:24:02,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:24:02,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:24:02,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:24:02,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:24:02,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:24:02,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:24:02,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:24:02,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:24:02,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:24:02,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:24:02,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:24:02,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:24:02,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:24:02,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:24:02,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:24:02,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:24:02,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:24:02,959 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:24:02,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:24:02,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:24:02,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:24:02,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:24:02,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:24:02,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:24:02,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:24:02,962 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:24:02,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:24:02,963 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:24:02,963 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:24:02,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:24:02,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:24:02,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:24:02,963 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:24:02,964 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:24:02,964 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:24:02,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:24:02,964 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:24:02,964 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:24:02,964 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:24:02,964 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:24:02,965 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:24:02,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:24:02,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:24:02,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:24:02,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:24:02,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:24:02,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:24:02,966 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:24:02,966 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:02,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:24:02,967 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:24:02,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:24:02,967 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:24:02,967 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:24:02,967 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 -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2023-02-16 03:24:03,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:24:03,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:24:03,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:24:03,268 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:24:03,268 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:24:03,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-16 03:24:04,250 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:24:04,508 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:24:04,510 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-16 03:24:04,524 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9dc7b1b/d6d19ecd9d164015920554744238f79d/FLAG8053c1eb4 [2023-02-16 03:24:04,535 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9dc7b1b/d6d19ecd9d164015920554744238f79d [2023-02-16 03:24:04,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:24:04,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:24:04,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:04,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:24:04,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:24:04,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:04,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa69067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04, skipping insertion in model container [2023-02-16 03:24:04,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:04,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:24:04,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:24:04,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:04,827 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:24:04,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:24:04,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:04,901 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:24:04,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:04,992 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:24:04,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04 WrapperNode [2023-02-16 03:24:04,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:04,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:24:04,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:24:04,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:24:04,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,055 INFO L138 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 92 [2023-02-16 03:24:05,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:24:05,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:24:05,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:24:05,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:24:05,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,099 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:24:05,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:24:05,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:24:05,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:24:05,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (1/1) ... [2023-02-16 03:24:05,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:24:05,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:24:05,141 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-16 03:24:05,143 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-16 03:24:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-16 03:24:05,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-16 03:24:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2023-02-16 03:24:05,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2023-02-16 03:24:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:24:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:24:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:24:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:24:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:24:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:24:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:24:05,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:24:05,379 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:24:05,394 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:24:05,634 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:24:05,639 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:24:05,639 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-16 03:24:05,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:24:05 BoogieIcfgContainer [2023-02-16 03:24:05,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:24:05,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:24:05,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:24:05,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:24:05,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:24:04" (1/3) ... [2023-02-16 03:24:05,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd7a555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:24:05, skipping insertion in model container [2023-02-16 03:24:05,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04" (2/3) ... [2023-02-16 03:24:05,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd7a555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:24:05, skipping insertion in model container [2023-02-16 03:24:05,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:24:05" (3/3) ... [2023-02-16 03:24:05,649 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_2.i [2023-02-16 03:24:05,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:24:05,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-02-16 03:24:05,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:24:05,708 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;@678a219c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:24:05,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-02-16 03:24:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:24:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:24:05,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:05,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:05,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1738627509, now seen corresponding path program 1 times [2023-02-16 03:24:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759799383] [2023-02-16 03:24:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:05,729 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-16 03:24:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:05,731 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-16 03:24:05,732 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-16 03:24:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:05,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:05,855 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-16 03:24:05,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:05,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:05,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759799383] [2023-02-16 03:24:05,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759799383] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:05,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:05,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093383597] [2023-02-16 03:24:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:05,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:05,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:05,892 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-16 03:24:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:06,004 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2023-02-16 03:24:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2023-02-16 03:24:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:06,013 INFO L225 Difference]: With dead ends: 157 [2023-02-16 03:24:06,013 INFO L226 Difference]: Without dead ends: 153 [2023-02-16 03:24:06,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-16 03:24:06,021 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:06,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 350 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-16 03:24:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 87. [2023-02-16 03:24:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-16 03:24:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-02-16 03:24:06,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 11 [2023-02-16 03:24:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:06,053 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-02-16 03:24:06,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-16 03:24:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-02-16 03:24:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:24:06,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:06,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:06,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-16 03:24:06,261 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-16 03:24:06,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash -851123828, now seen corresponding path program 1 times [2023-02-16 03:24:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:06,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759748453] [2023-02-16 03:24:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:06,265 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-16 03:24:06,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:06,266 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-16 03:24:06,269 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-16 03:24:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:06,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:06,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:06,322 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-16 03:24:06,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:06,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759748453] [2023-02-16 03:24:06,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759748453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:06,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:06,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:24:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911170599] [2023-02-16 03:24:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:06,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:24:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:24:06,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:24:06,325 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-16 03:24:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:06,474 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2023-02-16 03:24:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:24:06,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2023-02-16 03:24:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:06,475 INFO L225 Difference]: With dead ends: 153 [2023-02-16 03:24:06,475 INFO L226 Difference]: Without dead ends: 151 [2023-02-16 03:24:06,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:24:06,476 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 66 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:06,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 300 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-16 03:24:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2023-02-16 03:24:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:24:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-02-16 03:24:06,483 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 11 [2023-02-16 03:24:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:06,483 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-02-16 03:24:06,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-16 03:24:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-02-16 03:24:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:06,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:06,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:06,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-16 03:24:06,693 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-16 03:24:06,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash -470294884, now seen corresponding path program 1 times [2023-02-16 03:24:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:06,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446595711] [2023-02-16 03:24:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:06,694 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-16 03:24:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:06,697 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-16 03:24:06,699 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-16 03:24:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:06,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:06,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:24:06,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:06,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:06,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446595711] [2023-02-16 03:24:06,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446595711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:06,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:06,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320797515] [2023-02-16 03:24:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:06,811 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:24:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:06,884 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2023-02-16 03:24:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:06,885 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-16 03:24:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:06,886 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:24:06,886 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:24:06,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-16 03:24:06,887 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:06,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 444 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:24:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 87. [2023-02-16 03:24:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-16 03:24:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2023-02-16 03:24:06,905 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 17 [2023-02-16 03:24:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:06,905 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2023-02-16 03:24:06,905 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:24:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2023-02-16 03:24:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:06,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:06,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:06,920 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-16 03:24:07,113 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-16 03:24:07,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash -470294895, now seen corresponding path program 1 times [2023-02-16 03:24:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:07,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861396926] [2023-02-16 03:24:07,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:07,114 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-16 03:24:07,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:07,118 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-16 03:24:07,120 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-16 03:24:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:07,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:24:07,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:07,184 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 7 [2023-02-16 03:24:07,222 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:07,257 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:07,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:24:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:24:07,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:24:07,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861396926] [2023-02-16 03:24:07,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861396926] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:07,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:07,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:24:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300628794] [2023-02-16 03:24:07,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:07,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:24:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:24:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:24:07,380 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:07,619 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2023-02-16 03:24:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:24:07,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-16 03:24:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:07,620 INFO L225 Difference]: With dead ends: 114 [2023-02-16 03:24:07,620 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 03:24:07,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:24:07,621 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 70 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:07,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2023-02-16 03:24:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 03:24:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2023-02-16 03:24:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-16 03:24:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-16 03:24:07,626 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 17 [2023-02-16 03:24:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:07,626 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-16 03:24:07,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-16 03:24:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:07,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:07,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:07,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-16 03:24:07,827 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-16 03:24:07,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash -470294894, now seen corresponding path program 1 times [2023-02-16 03:24:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:07,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053505071] [2023-02-16 03:24:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:07,829 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-16 03:24:07,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:07,830 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-16 03:24:07,833 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-16 03:24:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:07,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:24:07,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:07,888 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-16 03:24:07,892 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 7 [2023-02-16 03:24:07,972 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-16 03:24:07,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:07,986 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-16 03:24:07,992 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:07,993 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 13 treesize of output 13 [2023-02-16 03:24:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:24:08,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:08,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:08,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053505071] [2023-02-16 03:24:08,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053505071] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:08,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1157873279] [2023-02-16 03:24:08,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:08,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:08,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:08,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:08,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-16 03:24:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:08,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:24:08,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:08,264 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 7 [2023-02-16 03:24:08,269 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-16 03:24:08,322 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_33 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_33))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:08,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:08,334 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-16 03:24:08,339 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:08,339 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 13 treesize of output 13 [2023-02-16 03:24:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:24:08,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:08,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1157873279] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:08,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:08,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-16 03:24:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172626079] [2023-02-16 03:24:08,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:08,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:24:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:24:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=2, NotChecked=34, Total=132 [2023-02-16 03:24:08,477 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:08,990 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2023-02-16 03:24:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:24:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-16 03:24:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:08,991 INFO L225 Difference]: With dead ends: 211 [2023-02-16 03:24:08,991 INFO L226 Difference]: Without dead ends: 211 [2023-02-16 03:24:08,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=105, Unknown=2, NotChecked=42, Total=182 [2023-02-16 03:24:08,992 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:08,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 491 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 527 Invalid, 0 Unknown, 428 Unchecked, 0.4s Time] [2023-02-16 03:24:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-16 03:24:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 141. [2023-02-16 03:24:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 123 states have internal predecessors, (161), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 15 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-16 03:24:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 193 transitions. [2023-02-16 03:24:09,000 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 193 transitions. Word has length 17 [2023-02-16 03:24:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:09,000 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 193 transitions. [2023-02-16 03:24:09,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 193 transitions. [2023-02-16 03:24:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:09,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:09,001 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:09,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:09,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 (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:09,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:24:09,404 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash -763697902, now seen corresponding path program 1 times [2023-02-16 03:24:09,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:09,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260334764] [2023-02-16 03:24:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:09,405 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-16 03:24:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:09,413 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-16 03:24:09,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 03:24:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:09,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:24:09,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:24:09,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:09,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:09,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260334764] [2023-02-16 03:24:09,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260334764] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:09,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:09,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:09,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477948820] [2023-02-16 03:24:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:09,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:09,507 INFO L87 Difference]: Start difference. First operand 141 states and 193 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:24:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:09,533 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2023-02-16 03:24:09,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:09,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-16 03:24:09,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:09,534 INFO L225 Difference]: With dead ends: 123 [2023-02-16 03:24:09,534 INFO L226 Difference]: Without dead ends: 121 [2023-02-16 03:24:09,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-16 03:24:09,535 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:09,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:24:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-16 03:24:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-16 03:24:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.619047619047619) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-16 03:24:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 158 transitions. [2023-02-16 03:24:09,540 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 158 transitions. Word has length 17 [2023-02-16 03:24:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:09,540 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 158 transitions. [2023-02-16 03:24:09,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:24:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2023-02-16 03:24:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:24:09,541 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:09,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:09,555 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-16 03:24:09,747 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-16 03:24:09,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -806735705, now seen corresponding path program 1 times [2023-02-16 03:24:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906228999] [2023-02-16 03:24:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:09,749 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-16 03:24:09,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:09,751 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-16 03:24:09,752 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-16 03:24:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:09,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:24:09,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:24:09,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:24:10,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:10,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906228999] [2023-02-16 03:24:10,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906228999] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:10,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:10,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:24:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015431524] [2023-02-16 03:24:10,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:10,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:24:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:10,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:24:10,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:24:10,052 INFO L87 Difference]: Start difference. First operand 121 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:24:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:10,233 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2023-02-16 03:24:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:24:10,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-02-16 03:24:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:10,234 INFO L225 Difference]: With dead ends: 124 [2023-02-16 03:24:10,234 INFO L226 Difference]: Without dead ends: 122 [2023-02-16 03:24:10,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:24:10,235 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 71 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:10,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 279 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:24:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-16 03:24:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-16 03:24:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-16 03:24:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2023-02-16 03:24:10,239 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 18 [2023-02-16 03:24:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:10,240 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2023-02-16 03:24:10,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:24:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2023-02-16 03:24:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:24:10,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:10,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:10,255 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-16 03:24:10,451 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-16 03:24:10,452 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1173731936, now seen corresponding path program 1 times [2023-02-16 03:24:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:10,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374867245] [2023-02-16 03:24:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:10,452 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-16 03:24:10,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:10,453 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-16 03:24:10,454 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-16 03:24:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:10,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:24:10,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:10,592 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)))) is different from true [2023-02-16 03:24:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:24:10,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:10,703 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ bv0 1))))) is different from false [2023-02-16 03:24:10,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374867245] [2023-02-16 03:24:10,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374867245] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1309577583] [2023-02-16 03:24:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:10,704 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:10,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:10,706 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:10,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-16 03:24:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:10,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:24:10,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:10,906 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|))))) is different from true [2023-02-16 03:24:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:24:10,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:10,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21|))))) is different from false [2023-02-16 03:24:10,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1309577583] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:10,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:10,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-16 03:24:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329796540] [2023-02-16 03:24:10,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:10,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:24:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:24:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=127, Unknown=4, NotChecked=100, Total=272 [2023-02-16 03:24:10,975 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand has 13 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:24:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:11,443 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2023-02-16 03:24:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:24:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-02-16 03:24:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:11,445 INFO L225 Difference]: With dead ends: 177 [2023-02-16 03:24:11,445 INFO L226 Difference]: Without dead ends: 172 [2023-02-16 03:24:11,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=277, Unknown=4, NotChecked=148, Total=506 [2023-02-16 03:24:11,446 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 188 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:11,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 436 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 391 Invalid, 0 Unknown, 257 Unchecked, 0.4s Time] [2023-02-16 03:24:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-16 03:24:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 117. [2023-02-16 03:24:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 103 states have internal predecessors, (130), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-16 03:24:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2023-02-16 03:24:11,454 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 21 [2023-02-16 03:24:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:11,454 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2023-02-16 03:24:11,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:24:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2023-02-16 03:24:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:24:11,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:11,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:11,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:11,664 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-16 03:24:11,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:24:11,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash -624729604, now seen corresponding path program 1 times [2023-02-16 03:24:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:11,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666782747] [2023-02-16 03:24:11,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:11,859 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-16 03:24:11,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:11,860 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-16 03:24:11,862 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-16 03:24:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:11,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:24:11,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:11,928 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 7 [2023-02-16 03:24:11,967 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-16 03:24:11,977 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:24:11,977 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 14 treesize of output 20 [2023-02-16 03:24:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-16 03:24:12,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:24:12,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:12,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666782747] [2023-02-16 03:24:12,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666782747] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:12,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:12,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:24:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28435060] [2023-02-16 03:24:12,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:12,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:24:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:12,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:24:12,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:24:12,098 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:24:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:12,310 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2023-02-16 03:24:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:24:12,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-16 03:24:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:12,311 INFO L225 Difference]: With dead ends: 144 [2023-02-16 03:24:12,311 INFO L226 Difference]: Without dead ends: 144 [2023-02-16 03:24:12,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:24:12,312 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:12,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 301 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 254 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2023-02-16 03:24:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-16 03:24:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2023-02-16 03:24:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 113 states have internal predecessors, (148), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-16 03:24:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2023-02-16 03:24:12,316 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 25 [2023-02-16 03:24:12,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:12,317 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2023-02-16 03:24:12,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:24:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2023-02-16 03:24:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:24:12,317 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:12,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:12,341 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-16 03:24:12,518 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-16 03:24:12,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash -624729603, now seen corresponding path program 1 times [2023-02-16 03:24:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:12,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175855307] [2023-02-16 03:24:12,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:12,519 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-16 03:24:12,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:12,520 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-16 03:24:12,521 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-16 03:24:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:12,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:24:12,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:12,585 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-16 03:24:12,644 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|))) is different from true [2023-02-16 03:24:12,655 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:24:12,655 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 14 [2023-02-16 03:24:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-16 03:24:12,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:12,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175855307] [2023-02-16 03:24:12,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175855307] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [427710390] [2023-02-16 03:24:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:12,808 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:12,810 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:12,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-02-16 03:24:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:12,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:24:12,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:12,932 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-16 03:24:12,936 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 7 [2023-02-16 03:24:13,038 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:13,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:13,055 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-16 03:24:13,063 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:13,063 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 13 treesize of output 13 [2023-02-16 03:24:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-16 03:24:13,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:13,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [427710390] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:13,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:13,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-16 03:24:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423803636] [2023-02-16 03:24:13,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:13,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:24:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:24:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2023-02-16 03:24:13,202 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:24:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:13,738 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2023-02-16 03:24:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:24:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-02-16 03:24:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:13,740 INFO L225 Difference]: With dead ends: 247 [2023-02-16 03:24:13,740 INFO L226 Difference]: Without dead ends: 247 [2023-02-16 03:24:13,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=224, Unknown=2, NotChecked=62, Total=342 [2023-02-16 03:24:13,741 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 108 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:13,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 736 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 564 Invalid, 0 Unknown, 398 Unchecked, 0.5s Time] [2023-02-16 03:24:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-16 03:24:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 184. [2023-02-16 03:24:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 161 states have internal predecessors, (225), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:24:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2023-02-16 03:24:13,746 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 25 [2023-02-16 03:24:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:13,746 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2023-02-16 03:24:13,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:24:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2023-02-16 03:24:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:24:13,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:13,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:13,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:13,958 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-16 03:24:14,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:24:14,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1130288229, now seen corresponding path program 1 times [2023-02-16 03:24:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:14,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918649375] [2023-02-16 03:24:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:14,157 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-16 03:24:14,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:14,159 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-16 03:24:14,160 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-16 03:24:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:14,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:24:14,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:24:14,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:14,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:14,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918649375] [2023-02-16 03:24:14,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918649375] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:14,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:14,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60851950] [2023-02-16 03:24:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:14,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:14,267 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:14,290 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2023-02-16 03:24:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-16 03:24:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:14,292 INFO L225 Difference]: With dead ends: 119 [2023-02-16 03:24:14,292 INFO L226 Difference]: Without dead ends: 117 [2023-02-16 03:24:14,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-16 03:24:14,292 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:14,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:24:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-16 03:24:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-02-16 03:24:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 103 states have internal predecessors, (128), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:24:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2023-02-16 03:24:14,295 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 25 [2023-02-16 03:24:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:14,296 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2023-02-16 03:24:14,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2023-02-16 03:24:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:24:14,296 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:14,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:14,305 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-16 03:24:14,505 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-16 03:24:14,505 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:14,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2108218693, now seen corresponding path program 1 times [2023-02-16 03:24:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:14,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300095734] [2023-02-16 03:24:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:14,506 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-16 03:24:14,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:14,507 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-16 03:24:14,509 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-16 03:24:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:14,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:14,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:24:14,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:14,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:14,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300095734] [2023-02-16 03:24:14,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300095734] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:14,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:14,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94268128] [2023-02-16 03:24:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:14,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:14,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:14,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:14,573 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:14,606 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2023-02-16 03:24:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:14,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-02-16 03:24:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:14,608 INFO L225 Difference]: With dead ends: 162 [2023-02-16 03:24:14,608 INFO L226 Difference]: Without dead ends: 162 [2023-02-16 03:24:14,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-16 03:24:14,608 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 53 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:14,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 339 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:24:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-16 03:24:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 117. [2023-02-16 03:24:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 103 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:24:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2023-02-16 03:24:14,611 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 26 [2023-02-16 03:24:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:14,612 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2023-02-16 03:24:14,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2023-02-16 03:24:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:24:14,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:14,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:14,622 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-16 03:24:14,819 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-16 03:24:14,820 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1299244922, now seen corresponding path program 1 times [2023-02-16 03:24:14,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:14,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193144216] [2023-02-16 03:24:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:14,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:14,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:14,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:14,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-16 03:24:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:14,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:24:14,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:24:15,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:24:15,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:15,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193144216] [2023-02-16 03:24:15,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193144216] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:15,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:15,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:24:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245598970] [2023-02-16 03:24:15,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:15,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:24:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:15,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:24:15,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:24:15,114 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:24:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:15,251 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2023-02-16 03:24:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:15,251 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-02-16 03:24:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:15,253 INFO L225 Difference]: With dead ends: 116 [2023-02-16 03:24:15,253 INFO L226 Difference]: Without dead ends: 116 [2023-02-16 03:24:15,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:24:15,255 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 114 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:15,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 250 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-16 03:24:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-16 03:24:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 102 states have internal predecessors, (124), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:24:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2023-02-16 03:24:15,264 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 26 [2023-02-16 03:24:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:15,264 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2023-02-16 03:24:15,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:24:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2023-02-16 03:24:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:24:15,269 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:15,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:15,278 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-16 03:24:15,474 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-16 03:24:15,475 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 930272189, now seen corresponding path program 1 times [2023-02-16 03:24:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:15,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10065311] [2023-02-16 03:24:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:15,475 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-16 03:24:15,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:15,477 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-16 03:24:15,478 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-16 03:24:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:15,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:24:15,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:15,561 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 7 [2023-02-16 03:24:15,572 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-16 03:24:15,584 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:24:15,584 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 14 treesize of output 20 [2023-02-16 03:24:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:24:15,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:15,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:15,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10065311] [2023-02-16 03:24:15,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10065311] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:15,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:15,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:15,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849849549] [2023-02-16 03:24:15,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:15,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:24:15,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:15,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:24:15,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-16 03:24:15,611 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:15,731 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2023-02-16 03:24:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:24:15,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-02-16 03:24:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:15,733 INFO L225 Difference]: With dead ends: 145 [2023-02-16 03:24:15,733 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 03:24:15,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-16 03:24:15,733 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:15,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2023-02-16 03:24:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 03:24:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2023-02-16 03:24:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 101 states have internal predecessors, (122), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:24:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2023-02-16 03:24:15,736 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 27 [2023-02-16 03:24:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:15,736 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2023-02-16 03:24:15,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2023-02-16 03:24:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:24:15,737 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:15,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:15,749 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-16 03:24:15,937 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-16 03:24:15,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash 930272190, now seen corresponding path program 1 times [2023-02-16 03:24:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:15,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627713831] [2023-02-16 03:24:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:15,938 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-16 03:24:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:15,939 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-16 03:24:15,940 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-16 03:24:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:16,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:24:16,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:16,033 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-16 03:24:16,037 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 7 [2023-02-16 03:24:16,108 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_178 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_178))))) is different from true [2023-02-16 03:24:16,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:16,118 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-16 03:24:16,141 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:16,143 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 13 treesize of output 13 [2023-02-16 03:24:16,179 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_179 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_179))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:16,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:16,189 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-16 03:24:16,194 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:16,194 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 13 treesize of output 13 [2023-02-16 03:24:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-16 03:24:16,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:17,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:17,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627713831] [2023-02-16 03:24:17,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627713831] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:17,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [281529298] [2023-02-16 03:24:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:17,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:17,136 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:17,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-16 03:24:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:17,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-16 03:24:17,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:17,256 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-16 03:24:17,261 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 7 [2023-02-16 03:24:17,331 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:24:17,331 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 18 [2023-02-16 03:24:17,341 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:17,342 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 13 treesize of output 13 [2023-02-16 03:24:17,392 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_204 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_204))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:17,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:17,404 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-16 03:24:17,412 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:17,412 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 13 treesize of output 13 [2023-02-16 03:24:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-02-16 03:24:17,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:17,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [281529298] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:17,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:17,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2023-02-16 03:24:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187326171] [2023-02-16 03:24:17,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:17,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:24:17,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:24:17,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=153, Unknown=3, NotChecked=78, Total=272 [2023-02-16 03:24:17,553 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:24:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:18,326 INFO L93 Difference]: Finished difference Result 204 states and 224 transitions. [2023-02-16 03:24:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:24:18,327 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2023-02-16 03:24:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:18,327 INFO L225 Difference]: With dead ends: 204 [2023-02-16 03:24:18,327 INFO L226 Difference]: Without dead ends: 204 [2023-02-16 03:24:18,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=253, Unknown=3, NotChecked=102, Total=420 [2023-02-16 03:24:18,328 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 148 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 18 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:18,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 956 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 747 Invalid, 17 Unknown, 381 Unchecked, 0.6s Time] [2023-02-16 03:24:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-16 03:24:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2023-02-16 03:24:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 100 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:24:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2023-02-16 03:24:18,331 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 27 [2023-02-16 03:24:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:18,331 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2023-02-16 03:24:18,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:24:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2023-02-16 03:24:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:24:18,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:18,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:18,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-02-16 03:24:18,544 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-16 03:24:18,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:24:18,744 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 638376382, now seen corresponding path program 1 times [2023-02-16 03:24:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:18,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817977342] [2023-02-16 03:24:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:18,745 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-16 03:24:18,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:18,746 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-16 03:24:18,748 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-16 03:24:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:18,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:24:18,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:18,872 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-16 03:24:18,889 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 7 [2023-02-16 03:24:18,959 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:24:18,959 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 31 treesize of output 29 [2023-02-16 03:24:19,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:24:19,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-02-16 03:24:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:24:19,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:19,211 INFO L321 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2023-02-16 03:24:19,211 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 69 treesize of output 68 [2023-02-16 03:24:19,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:19,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817977342] [2023-02-16 03:24:19,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817977342] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:19,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1697723243] [2023-02-16 03:24:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:19,271 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:19,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:19,272 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:19,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-16 03:24:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:19,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 03:24:19,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:19,391 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 7 [2023-02-16 03:24:19,497 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:19,497 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 13 treesize of output 13 [2023-02-16 03:24:19,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:21,591 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|))) is different from true [2023-02-16 03:24:21,653 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:24:21,654 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 30 treesize of output 31 [2023-02-16 03:24:21,724 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 27 treesize of output 15 [2023-02-16 03:24:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:24:21,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:21,741 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2023-02-16 03:24:21,741 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 23 treesize of output 22 [2023-02-16 03:24:21,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1697723243] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:21,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:21,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-16 03:24:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677450119] [2023-02-16 03:24:21,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:21,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 03:24:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:21,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 03:24:21,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=827, Unknown=10, NotChecked=58, Total=992 [2023-02-16 03:24:21,794 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:24:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:33,650 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2023-02-16 03:24:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:24:33,651 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-16 03:24:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:33,651 INFO L225 Difference]: With dead ends: 183 [2023-02-16 03:24:33,652 INFO L226 Difference]: Without dead ends: 183 [2023-02-16 03:24:33,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=376, Invalid=2164, Unknown=14, NotChecked=98, Total=2652 [2023-02-16 03:24:33,652 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 339 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:33,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1402 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1331 Invalid, 0 Unknown, 168 Unchecked, 1.0s Time] [2023-02-16 03:24:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-16 03:24:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 88. [2023-02-16 03:24:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:24:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-16 03:24:33,655 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2023-02-16 03:24:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:33,655 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-16 03:24:33,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:24:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-16 03:24:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:24:33,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:33,656 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:33,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:33,866 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-16 03:24:34,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:24:34,059 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:24:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash 638376383, now seen corresponding path program 1 times [2023-02-16 03:24:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615998685] [2023-02-16 03:24:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:34,060 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-16 03:24:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:34,062 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-16 03:24:34,063 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-16 03:24:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:34,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 03:24:34,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:34,160 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 7 [2023-02-16 03:24:34,200 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:34,200 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 13 treesize of output 13 [2023-02-16 03:24:34,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:34,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:34,360 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:24:34,361 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 43 [2023-02-16 03:24:34,364 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 33 treesize of output 33 [2023-02-16 03:24:34,424 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-16 03:24:34,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2023-02-16 03:24:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:24:34,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:34,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:24:34,715 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 50 treesize of output 54 [2023-02-16 03:24:34,775 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_6) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) (and .cse0 (or (and .cse0 (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32))))) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) |c_ULTIMATE.start_entry_point_~cfg~1#1.base|))) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv4 32)))))) is different from false [2023-02-16 03:24:34,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615998685] [2023-02-16 03:24:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615998685] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [170836050] [2023-02-16 03:24:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:34,846 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:34,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:34,847 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:34,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-16 03:24:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:34,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 03:24:34,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:34,983 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 7 [2023-02-16 03:24:35,113 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-16 03:24:37,181 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:37,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:24:37,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:37,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:37,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:24:37,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2023-02-16 03:24:37,446 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_304 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_304)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|))))) is different from true [2023-02-16 03:24:37,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:37,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-16 03:24:37,477 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-16 03:24:37,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 03:24:37,578 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:24:37,578 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 38 treesize of output 37 [2023-02-16 03:24:37,584 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 18 treesize of output 20 [2023-02-16 03:24:37,678 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 13 [2023-02-16 03:24:37,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-16 03:24:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-16 03:24:37,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:37,801 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_306) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2023-02-16 03:24:40,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [170836050] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:40,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:40,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2023-02-16 03:24:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467823031] [2023-02-16 03:24:40,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:40,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:24:40,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:40,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:24:40,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1004, Unknown=14, NotChecked=198, Total=1332 [2023-02-16 03:24:40,269 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 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-16 03:24:42,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:44,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:46,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:53,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:55,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:58,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:00,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:02,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:04,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:04,391 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2023-02-16 03:25:04,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:25:04,391 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-16 03:25:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:04,392 INFO L225 Difference]: With dead ends: 155 [2023-02-16 03:25:04,392 INFO L226 Difference]: Without dead ends: 153 [2023-02-16 03:25:04,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=252, Invalid=1637, Unknown=15, NotChecked=258, Total=2162 [2023-02-16 03:25:04,393 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 292 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 43 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:04,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 726 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 988 Invalid, 9 Unknown, 128 Unchecked, 19.6s Time] [2023-02-16 03:25:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-16 03:25:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2023-02-16 03:25:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:25:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-16 03:25:04,396 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 29 [2023-02-16 03:25:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:04,396 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-16 03:25:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 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-16 03:25:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-16 03:25:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:25:04,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:04,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-16 03:25:04,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:04,604 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 (23)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:04,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:25:04,797 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:25:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1844886222, now seen corresponding path program 1 times [2023-02-16 03:25:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:04,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757820100] [2023-02-16 03:25:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:04,798 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-16 03:25:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:04,799 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-16 03:25:04,799 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-16 03:25:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:04,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:25:04,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:07,114 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_322 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_322))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |c_#valid| (store (store .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)) |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)))) is different from true [2023-02-16 03:25:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:25:07,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:09,269 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret44#1.base_35| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_35|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_35| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))))) is different from false [2023-02-16 03:25:09,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757820100] [2023-02-16 03:25:09,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757820100] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [91745828] [2023-02-16 03:25:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:25:09,272 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:25:09,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-16 03:25:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:09,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:25:09,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:15,826 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((v_ArrVal_322 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_322))) (let ((.cse1 (store .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= (_ bv0 1) (bvadd (select .cse1 |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (= |c_#valid| (store .cse1 |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))))))) is different from true [2023-02-16 03:25:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:25:15,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:15,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-02-16 03:25:20,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [91745828] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:20,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:20,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2023-02-16 03:25:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34219362] [2023-02-16 03:25:20,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:20,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:25:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:20,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:25:20,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=636, Unknown=10, NotChecked=162, Total=930 [2023-02-16 03:25:20,546 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:25:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:25,701 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2023-02-16 03:25:25,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:25:25,701 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-02-16 03:25:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:25,702 INFO L225 Difference]: With dead ends: 128 [2023-02-16 03:25:25,702 INFO L226 Difference]: Without dead ends: 120 [2023-02-16 03:25:25,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=248, Invalid=1236, Unknown=10, NotChecked=228, Total=1722 [2023-02-16 03:25:25,703 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 37 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:25,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 505 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 556 Invalid, 4 Unknown, 262 Unchecked, 0.7s Time] [2023-02-16 03:25:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-16 03:25:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2023-02-16 03:25:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:25:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-16 03:25:25,705 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 32 [2023-02-16 03:25:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:25,705 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-16 03:25:25,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:25:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-16 03:25:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:25:25,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:25,706 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:25:25,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-02-16 03:25:25,912 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 (25)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:26,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:25:26,106 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:25:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash -316571990, now seen corresponding path program 1 times [2023-02-16 03:25:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924492910] [2023-02-16 03:25:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:26,107 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-16 03:25:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:26,108 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-16 03:25:26,109 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-16 03:25:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:26,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-16 03:25:26,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:26,231 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 7 [2023-02-16 03:25:26,274 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:26,275 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 13 treesize of output 13 [2023-02-16 03:25:26,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:25:26,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:25:28,326 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17|) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30|))) is different from true [2023-02-16 03:25:28,330 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 7 [2023-02-16 03:25:32,496 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:25:32,497 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 42 treesize of output 32 [2023-02-16 03:25:32,502 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 30 treesize of output 32 [2023-02-16 03:25:32,559 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 27 treesize of output 19 [2023-02-16 03:25:32,651 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:25:32,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-16 03:25:32,705 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_379 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_379))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:25:32,728 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:25:32,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:25:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-16 03:25:32,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:33,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |c_ULTIMATE.start_entry_point_#t~ret45#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_376) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (_ bv1 1)))) is different from false [2023-02-16 03:25:33,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 76 [2023-02-16 03:25:33,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_entry_point_#t~ret45#1.base_34| (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_376) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34|)) is different from false [2023-02-16 03:25:33,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:33,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924492910] [2023-02-16 03:25:33,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924492910] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:33,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [287258072] [2023-02-16 03:25:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:33,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:33,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:25:33,311 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:25:33,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-16 03:25:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:33,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-16 03:25:33,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:33,459 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 7 [2023-02-16 03:25:35,641 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:35,641 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 13 treesize of output 13 [2023-02-16 03:25:35,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:25:35,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:25:35,893 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 7 [2023-02-16 03:25:36,164 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:25:36,165 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 38 treesize of output 28 [2023-02-16 03:25:36,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 18 treesize of output 20 [2023-02-16 03:25:36,313 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-16 03:25:36,462 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:25:36,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-16 03:25:36,475 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_413 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_413))))) is different from true [2023-02-16 03:25:36,494 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:25:36,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:25:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-16 03:25:36,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:36,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 76 [2023-02-16 03:25:36,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_entry_point_#t~ret45#1.base_37| (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_376) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37|)) is different from false [2023-02-16 03:25:36,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [287258072] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:36,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:36,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2023-02-16 03:25:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263620477] [2023-02-16 03:25:36,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:36,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 03:25:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:36,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 03:25:36,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1432, Unknown=15, NotChecked=486, Total=2070 [2023-02-16 03:25:36,865 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:25:38,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:40,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:48,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:51,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:53,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:03,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:05,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:07,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:09,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:11,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:11,724 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2023-02-16 03:26:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:26:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2023-02-16 03:26:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:11,725 INFO L225 Difference]: With dead ends: 128 [2023-02-16 03:26:11,725 INFO L226 Difference]: Without dead ends: 128 [2023-02-16 03:26:11,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=366, Invalid=2609, Unknown=19, NotChecked=666, Total=3660 [2023-02-16 03:26:11,726 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 242 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 54 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:11,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1000 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1345 Invalid, 10 Unknown, 344 Unchecked, 21.7s Time] [2023-02-16 03:26:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-16 03:26:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2023-02-16 03:26:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.303030303030303) internal successors, (86), 80 states have internal predecessors, (86), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 03:26:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-02-16 03:26:11,729 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 38 [2023-02-16 03:26:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:11,729 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-02-16 03:26:11,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:26:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-02-16 03:26:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:26:11,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:11,729 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:11,739 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 (27)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:11,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-02-16 03:26:12,139 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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:12,140 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:26:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -316571989, now seen corresponding path program 1 times [2023-02-16 03:26:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:12,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046677857] [2023-02-16 03:26:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:12,140 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-16 03:26:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:12,141 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-16 03:26:12,143 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-16 03:26:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:12,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-16 03:26:12,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:12,250 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 7 [2023-02-16 03:26:12,294 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:12,294 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 13 treesize of output 13 [2023-02-16 03:26:12,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:26:12,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:26:14,354 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20|) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|))) is different from true [2023-02-16 03:26:16,388 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 7 [2023-02-16 03:26:16,393 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-16 03:26:18,611 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:26:18,611 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 55 treesize of output 41 [2023-02-16 03:26:18,615 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2023-02-16 03:26:18,846 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 03:26:18,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 45 [2023-02-16 03:26:18,850 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 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-16 03:26:18,991 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_449 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_449))))) is different from true [2023-02-16 03:26:19,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:26:19,002 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-16 03:26:19,013 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:19,013 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 13 treesize of output 13 [2023-02-16 03:26:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-16 03:26:19,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:23,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:23,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046677857] [2023-02-16 03:26:23,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046677857] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:23,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1957561790] [2023-02-16 03:26:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:23,709 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:26:23,710 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:26:23,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-16 03:26:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:23,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-16 03:26:23,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:23,924 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 7 [2023-02-16 03:26:24,089 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:24,089 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 13 treesize of output 13 [2023-02-16 03:26:24,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:26:24,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:26:24,402 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 7 [2023-02-16 03:26:24,407 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-16 03:26:24,752 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:26:24,753 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 47 treesize of output 33 [2023-02-16 03:26:24,758 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 27 treesize of output 22 [2023-02-16 03:26:25,130 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-16 03:26:25,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 44 [2023-02-16 03:26:25,141 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:26:25,141 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 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:26:25,160 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_484 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_484))))) is different from true [2023-02-16 03:26:25,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:26:25,169 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-16 03:26:25,177 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:25,178 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 13 treesize of output 13 [2023-02-16 03:26:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:26:25,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:25,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1957561790] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:25,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:26:25,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2023-02-16 03:26:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134945375] [2023-02-16 03:26:25,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:26:25,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-16 03:26:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-16 03:26:25,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1436, Unknown=5, NotChecked=234, Total=1806 [2023-02-16 03:26:25,974 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:26:28,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:30,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:34,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:36,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:45,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:47,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:49,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:51,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:54,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:56,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:58,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:58,291 INFO L93 Difference]: Finished difference Result 189 states and 207 transitions. [2023-02-16 03:26:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:26:58,292 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2023-02-16 03:26:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:58,293 INFO L225 Difference]: With dead ends: 189 [2023-02-16 03:26:58,293 INFO L226 Difference]: Without dead ends: 189 [2023-02-16 03:26:58,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=306, Invalid=2670, Unknown=6, NotChecked=324, Total=3306 [2023-02-16 03:26:58,294 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 284 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 53 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:58,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2362 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2404 Invalid, 11 Unknown, 600 Unchecked, 24.9s Time] [2023-02-16 03:26:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-02-16 03:26:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 93. [2023-02-16 03:26:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 80 states have internal predecessors, (85), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 03:26:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2023-02-16 03:26:58,297 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 38 [2023-02-16 03:26:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:58,298 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2023-02-16 03:26:58,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:26:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2023-02-16 03:26:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:26:58,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:58,298 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:58,309 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 (29)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:58,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-02-16 03:26:58,708 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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:58,708 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:26:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1161043861, now seen corresponding path program 1 times [2023-02-16 03:26:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:58,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946356375] [2023-02-16 03:26:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:58,709 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-16 03:26:58,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:58,717 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-16 03:26:58,719 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-16 03:26:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:58,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:26:58,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:26:58,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:26:58,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:58,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946356375] [2023-02-16 03:26:58,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946356375] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:26:58,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:26:58,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:26:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625684746] [2023-02-16 03:26:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:26:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:26:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:58,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:26:58,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:26:58,828 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:26:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:58,849 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-16 03:26:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:26:58,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-02-16 03:26:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:58,850 INFO L225 Difference]: With dead ends: 81 [2023-02-16 03:26:58,850 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 03:26:58,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 03:26:58,850 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:58,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:26:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 03:26:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-02-16 03:26:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 66 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:26:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-02-16 03:26:58,852 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 38 [2023-02-16 03:26:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:58,852 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-02-16 03:26:58,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:26:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-02-16 03:26:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:26:58,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:58,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:58,882 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 (31)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:59,053 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-16 03:26:59,053 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:26:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash 717010680, now seen corresponding path program 1 times [2023-02-16 03:26:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:59,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28045207] [2023-02-16 03:26:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:59,054 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-16 03:26:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:59,055 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-16 03:26:59,057 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-16 03:26:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:59,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:26:59,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:26:59,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:26:59,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:59,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28045207] [2023-02-16 03:26:59,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28045207] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:26:59,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:26:59,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:26:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397546240] [2023-02-16 03:26:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:26:59,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:26:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:26:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:26:59,159 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 03:26:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:59,184 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2023-02-16 03:26:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:26:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-02-16 03:26:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:59,185 INFO L225 Difference]: With dead ends: 116 [2023-02-16 03:26:59,185 INFO L226 Difference]: Without dead ends: 116 [2023-02-16 03:26:59,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-16 03:26:59,186 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:59,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 282 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:26:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-16 03:26:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2023-02-16 03:26:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.280701754385965) internal successors, (73), 69 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-16 03:26:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-16 03:26:59,187 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 40 [2023-02-16 03:26:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:59,188 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-16 03:26:59,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 03:26:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-16 03:26:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:26:59,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:59,188 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:59,197 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-16 03:26:59,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-16 03:26:59,389 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:26:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1835146281, now seen corresponding path program 1 times [2023-02-16 03:26:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:59,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458522526] [2023-02-16 03:26:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:59,389 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-16 03:26:59,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:59,390 INFO L229 MonitoredProcess]: Starting monitored process 33 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-16 03:26:59,393 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 (33)] Waiting until timeout for monitored process [2023-02-16 03:26:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:59,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:26:59,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:26:59,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:26:59,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:59,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458522526] [2023-02-16 03:26:59,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458522526] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:26:59,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:26:59,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:26:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797247728] [2023-02-16 03:26:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:26:59,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:26:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:26:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:26:59,513 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:26:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:59,710 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2023-02-16 03:26:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:26:59,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-16 03:26:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:59,711 INFO L225 Difference]: With dead ends: 111 [2023-02-16 03:26:59,711 INFO L226 Difference]: Without dead ends: 111 [2023-02-16 03:26:59,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:26:59,712 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:59,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 317 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:26:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-16 03:26:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2023-02-16 03:26:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:26:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-16 03:26:59,714 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 40 [2023-02-16 03:26:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:59,714 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-16 03:26:59,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:26:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-16 03:26:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:26:59,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:59,714 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:59,721 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 (33)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:59,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:26:59,917 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:26:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1835146280, now seen corresponding path program 1 times [2023-02-16 03:26:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:59,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723872066] [2023-02-16 03:26:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:59,918 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-16 03:26:59,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:59,921 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-16 03:26:59,921 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-16 03:27:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:00,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-16 03:27:00,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:00,027 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-16 03:27:00,031 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 7 [2023-02-16 03:27:00,097 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_564 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_564))))) is different from true [2023-02-16 03:27:00,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:00,111 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-16 03:27:00,116 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:00,116 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 13 treesize of output 13 [2023-02-16 03:27:00,156 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_565 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_565))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:00,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:00,179 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-16 03:27:00,185 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:00,185 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 13 treesize of output 13 [2023-02-16 03:27:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-16 03:27:00,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:04,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:04,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723872066] [2023-02-16 03:27:04,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723872066] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:04,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1360659424] [2023-02-16 03:27:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:04,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:04,939 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:04,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-02-16 03:27:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:05,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-16 03:27:05,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:05,119 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 7 [2023-02-16 03:27:05,123 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-16 03:27:05,222 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:27:05,222 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 18 [2023-02-16 03:27:05,235 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:05,235 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 13 treesize of output 13 [2023-02-16 03:27:05,317 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_590 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_590))))) is different from true [2023-02-16 03:27:05,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:05,329 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-16 03:27:05,338 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:05,338 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 13 treesize of output 13 [2023-02-16 03:27:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-16 03:27:05,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:06,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1360659424] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:06,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:06,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 16 [2023-02-16 03:27:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341523749] [2023-02-16 03:27:06,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:06,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 03:27:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:06,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 03:27:06,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=333, Unknown=4, NotChecked=114, Total=506 [2023-02-16 03:27:06,379 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:27:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:07,143 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2023-02-16 03:27:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:27:07,144 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2023-02-16 03:27:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:07,144 INFO L225 Difference]: With dead ends: 121 [2023-02-16 03:27:07,144 INFO L226 Difference]: Without dead ends: 121 [2023-02-16 03:27:07,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=89, Invalid=519, Unknown=4, NotChecked=144, Total=756 [2023-02-16 03:27:07,145 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 98 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 10 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:07,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 746 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 500 Invalid, 9 Unknown, 351 Unchecked, 0.5s Time] [2023-02-16 03:27:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-16 03:27:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2023-02-16 03:27:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-16 03:27:07,147 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 40 [2023-02-16 03:27:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:07,147 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-16 03:27:07,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:27:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-16 03:27:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:27:07,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:07,148 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:07,168 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-16 03:27:07,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:07,548 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,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:07,548 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 752121782, now seen corresponding path program 1 times [2023-02-16 03:27:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786600106] [2023-02-16 03:27:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:07,549 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-16 03:27:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:07,550 INFO L229 MonitoredProcess]: Starting monitored process 36 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-16 03:27:07,552 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 (36)] Waiting until timeout for monitored process [2023-02-16 03:27:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:07,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:27:07,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:07,682 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 7 [2023-02-16 03:27:07,701 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-16 03:27:07,713 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:27:07,714 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 14 treesize of output 20 [2023-02-16 03:27:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:27:07,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:07,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:07,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786600106] [2023-02-16 03:27:07,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786600106] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:07,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:07,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:27:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010543391] [2023-02-16 03:27:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:07,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-02-16 03:27:07,737 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:07,861 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-02-16 03:27:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-02-16 03:27:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:07,862 INFO L225 Difference]: With dead ends: 94 [2023-02-16 03:27:07,862 INFO L226 Difference]: Without dead ends: 94 [2023-02-16 03:27:07,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:27:07,863 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:07,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 197 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2023-02-16 03:27:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-16 03:27:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2023-02-16 03:27:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 74 states have internal predecessors, (77), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-02-16 03:27:07,864 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 41 [2023-02-16 03:27:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:07,865 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-02-16 03:27:07,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-02-16 03:27:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:27:07,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:07,865 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:07,873 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 (36)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:08,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:08,073 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 752121783, now seen corresponding path program 1 times [2023-02-16 03:27:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:08,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065700590] [2023-02-16 03:27:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:08,074 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-16 03:27:08,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:08,075 INFO L229 MonitoredProcess]: Starting monitored process 37 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-16 03:27:08,114 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 (37)] Waiting until timeout for monitored process [2023-02-16 03:27:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:08,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 03:27:08,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:08,211 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 7 [2023-02-16 03:27:08,216 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-16 03:27:08,283 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_650 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_650))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:08,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:08,293 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-16 03:27:08,299 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:08,300 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 13 treesize of output 13 [2023-02-16 03:27:08,336 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_651 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_651))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:08,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:08,343 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-16 03:27:08,350 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:08,350 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 13 treesize of output 13 [2023-02-16 03:27:08,430 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_652 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_652))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:08,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:08,440 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-16 03:27:08,445 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:08,445 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 13 treesize of output 13 [2023-02-16 03:27:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2023-02-16 03:27:08,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:10,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:10,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065700590] [2023-02-16 03:27:10,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065700590] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:10,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1424369413] [2023-02-16 03:27:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:10,828 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:10,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-02-16 03:27:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:11,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 03:27:11,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:11,031 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-16 03:27:11,035 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 7 [2023-02-16 03:27:11,126 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:27:11,126 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 18 [2023-02-16 03:27:11,139 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:11,139 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 13 treesize of output 13 [2023-02-16 03:27:11,209 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_685 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_685))))) is different from true [2023-02-16 03:27:11,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:11,217 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-16 03:27:11,221 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:11,222 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 13 treesize of output 13 [2023-02-16 03:27:11,256 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_686 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_686))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:11,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:11,264 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-16 03:27:11,269 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:11,269 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 13 treesize of output 13 [2023-02-16 03:27:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2023-02-16 03:27:11,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:13,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1424369413] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:13,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:13,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2023-02-16 03:27:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307888126] [2023-02-16 03:27:13,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:13,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:27:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:27:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=269, Unknown=6, NotChecked=180, Total=506 [2023-02-16 03:27:13,474 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 03:27:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:14,232 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2023-02-16 03:27:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:27:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2023-02-16 03:27:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:14,234 INFO L225 Difference]: With dead ends: 126 [2023-02-16 03:27:14,234 INFO L226 Difference]: Without dead ends: 126 [2023-02-16 03:27:14,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=86, Invalid=480, Unknown=6, NotChecked=240, Total=812 [2023-02-16 03:27:14,234 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 128 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 13 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:14,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 691 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 536 Invalid, 7 Unknown, 455 Unchecked, 0.5s Time] [2023-02-16 03:27:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-16 03:27:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2023-02-16 03:27:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 73 states have internal predecessors, (76), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2023-02-16 03:27:14,236 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 41 [2023-02-16 03:27:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:14,236 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2023-02-16 03:27:14,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 03:27:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2023-02-16 03:27:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:27:14,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:14,237 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:14,245 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 (37)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:14,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:14,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:14,645 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1833421355, now seen corresponding path program 1 times [2023-02-16 03:27:14,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:14,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048010461] [2023-02-16 03:27:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:14,646 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-16 03:27:14,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:14,647 INFO L229 MonitoredProcess]: Starting monitored process 39 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-16 03:27:14,649 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 (39)] Waiting until timeout for monitored process [2023-02-16 03:27:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:14,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-16 03:27:14,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:14,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:15,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:15,328 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 24 treesize of output 28 [2023-02-16 03:27:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:15,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:15,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048010461] [2023-02-16 03:27:15,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048010461] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:15,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:15,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-16 03:27:15,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567435683] [2023-02-16 03:27:15,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:15,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:27:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:15,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:27:15,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:27:15,640 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-16 03:27:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:16,153 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-16 03:27:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:27:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 46 [2023-02-16 03:27:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:16,154 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:27:16,154 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:27:16,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:27:16,155 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 136 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:16,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 412 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:27:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:27:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-16 03:27:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 72 states have internal predecessors, (75), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-02-16 03:27:16,157 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 46 [2023-02-16 03:27:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:16,157 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-02-16 03:27:16,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-16 03:27:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-02-16 03:27:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:27:16,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:16,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:16,165 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 (39)] Ended with exit code 0 [2023-02-16 03:27:16,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:16,358 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1833421356, now seen corresponding path program 1 times [2023-02-16 03:27:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:16,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451703862] [2023-02-16 03:27:16,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:16,358 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-16 03:27:16,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:16,360 INFO L229 MonitoredProcess]: Starting monitored process 40 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-16 03:27:16,361 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 (40)] Waiting until timeout for monitored process [2023-02-16 03:27:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:16,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:27:16,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:27:16,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:16,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:16,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451703862] [2023-02-16 03:27:16,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451703862] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:16,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:16,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:27:16,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902548788] [2023-02-16 03:27:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:16,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:16,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:16,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:16,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:27:16,523 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:16,745 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-16 03:27:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:27:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2023-02-16 03:27:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:16,747 INFO L225 Difference]: With dead ends: 112 [2023-02-16 03:27:16,747 INFO L226 Difference]: Without dead ends: 112 [2023-02-16 03:27:16,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:27:16,747 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:16,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 192 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:27:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-16 03:27:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2023-02-16 03:27:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-16 03:27:16,749 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 46 [2023-02-16 03:27:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:16,749 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-16 03:27:16,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-16 03:27:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:27:16,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:16,750 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:16,774 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 (40)] Ended with exit code 0 [2023-02-16 03:27:16,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:16,950 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1963012722, now seen corresponding path program 1 times [2023-02-16 03:27:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:16,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592035448] [2023-02-16 03:27:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:16,951 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-16 03:27:16,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:16,953 INFO L229 MonitoredProcess]: Starting monitored process 41 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-16 03:27:16,956 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 (41)] Waiting until timeout for monitored process [2023-02-16 03:27:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:17,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:27:17,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 03:27:17,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:17,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:17,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592035448] [2023-02-16 03:27:17,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592035448] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:17,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:17,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:27:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561413680] [2023-02-16 03:27:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:17,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:17,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:27:17,145 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:17,296 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-02-16 03:27:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:27:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2023-02-16 03:27:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:17,297 INFO L225 Difference]: With dead ends: 94 [2023-02-16 03:27:17,297 INFO L226 Difference]: Without dead ends: 94 [2023-02-16 03:27:17,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:17,297 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 82 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:17,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 230 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:27:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-16 03:27:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2023-02-16 03:27:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 71 states have internal predecessors, (74), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-16 03:27:17,299 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 47 [2023-02-16 03:27:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:17,299 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-16 03:27:17,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-16 03:27:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:27:17,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:17,300 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:17,315 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 (41)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:17,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:17,500 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1021505201, now seen corresponding path program 1 times [2023-02-16 03:27:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:17,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595130874] [2023-02-16 03:27:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:17,501 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-16 03:27:17,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:17,502 INFO L229 MonitoredProcess]: Starting monitored process 42 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-16 03:27:17,504 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 (42)] Waiting until timeout for monitored process [2023-02-16 03:27:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:17,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-16 03:27:17,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:17,782 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-16 03:27:17,789 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-16 03:27:17,877 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-16 03:27:17,879 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-16 03:27:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:17,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:18,323 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 27 treesize of output 21 [2023-02-16 03:27:18,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:18,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:18,426 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 30 treesize of output 24 [2023-02-16 03:27:18,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 03:27:18,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:18,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595130874] [2023-02-16 03:27:18,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595130874] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:18,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:27:18,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 19 [2023-02-16 03:27:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406446287] [2023-02-16 03:27:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:18,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:27:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:27:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:27:18,520 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:18,982 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-02-16 03:27:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:27:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-02-16 03:27:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:18,983 INFO L225 Difference]: With dead ends: 78 [2023-02-16 03:27:18,983 INFO L226 Difference]: Without dead ends: 78 [2023-02-16 03:27:18,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2023-02-16 03:27:18,984 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 133 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:18,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 361 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:27:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-16 03:27:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-16 03:27:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 65 states have internal predecessors, (67), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-02-16 03:27:18,986 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 51 [2023-02-16 03:27:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:18,986 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-02-16 03:27:18,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-02-16 03:27:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 03:27:18,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:18,986 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:18,997 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 (42)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:19,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:19,187 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:19,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1601898209, now seen corresponding path program 1 times [2023-02-16 03:27:19,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:19,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455417803] [2023-02-16 03:27:19,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:19,188 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-16 03:27:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:19,189 INFO L229 MonitoredProcess]: Starting monitored process 43 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-16 03:27:19,190 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 (43)] Waiting until timeout for monitored process [2023-02-16 03:27:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:19,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:27:19,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:19,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:19,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:19,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455417803] [2023-02-16 03:27:19,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455417803] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:19,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:19,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-16 03:27:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603306446] [2023-02-16 03:27:19,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:19,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:19,427 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:19,461 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-16 03:27:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-02-16 03:27:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:19,462 INFO L225 Difference]: With dead ends: 77 [2023-02-16 03:27:19,462 INFO L226 Difference]: Without dead ends: 77 [2023-02-16 03:27:19,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:19,463 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:19,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 191 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:27:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-16 03:27:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-16 03:27:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.11864406779661) internal successors, (66), 64 states have internal predecessors, (66), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-16 03:27:19,465 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 52 [2023-02-16 03:27:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:19,465 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-16 03:27:19,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-16 03:27:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 03:27:19,466 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:19,466 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:19,488 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 (43)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:19,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:19,674 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1880762957, now seen corresponding path program 1 times [2023-02-16 03:27:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:19,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257726575] [2023-02-16 03:27:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:19,675 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-16 03:27:19,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:19,676 INFO L229 MonitoredProcess]: Starting monitored process 44 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-16 03:27:19,679 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 (44)] Waiting until timeout for monitored process [2023-02-16 03:27:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:19,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:19,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:27:20,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:20,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257726575] [2023-02-16 03:27:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257726575] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:20,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:20,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:27:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807854386] [2023-02-16 03:27:20,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:20,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:27:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:27:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:20,269 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-16 03:27:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:20,455 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-02-16 03:27:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:20,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 53 [2023-02-16 03:27:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:20,457 INFO L225 Difference]: With dead ends: 78 [2023-02-16 03:27:20,457 INFO L226 Difference]: Without dead ends: 78 [2023-02-16 03:27:20,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:20,457 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:20,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 197 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:27:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-16 03:27:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-02-16 03:27:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 63 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-02-16 03:27:20,459 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 53 [2023-02-16 03:27:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:20,459 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-02-16 03:27:20,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-16 03:27:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-02-16 03:27:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-16 03:27:20,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:20,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:20,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:20,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:20,660 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1825890595, now seen corresponding path program 1 times [2023-02-16 03:27:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:20,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450172665] [2023-02-16 03:27:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:20,661 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-16 03:27:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:20,662 INFO L229 MonitoredProcess]: Starting monitored process 45 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-16 03:27:20,666 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 (45)] Waiting until timeout for monitored process [2023-02-16 03:27:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:20,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:20,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:20,782 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 7 [2023-02-16 03:27:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:20,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:20,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450172665] [2023-02-16 03:27:20,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450172665] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:20,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:20,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:27:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709102125] [2023-02-16 03:27:20,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:20,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:27:20,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:20,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:27:20,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:27:20,943 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-16 03:27:22,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:27:23,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:27:24,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:27:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:24,820 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2023-02-16 03:27:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-02-16 03:27:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:24,821 INFO L225 Difference]: With dead ends: 75 [2023-02-16 03:27:24,821 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 03:27:24,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:24,822 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:24,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 151 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 3 Unknown, 0 Unchecked, 3.9s Time] [2023-02-16 03:27:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 03:27:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-16 03:27:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 62 states have internal predecessors, (64), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2023-02-16 03:27:24,824 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 54 [2023-02-16 03:27:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:24,824 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-02-16 03:27:24,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-16 03:27:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2023-02-16 03:27:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-16 03:27:24,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:24,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:24,843 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 (45)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:25,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:25,025 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -653967976, now seen corresponding path program 1 times [2023-02-16 03:27:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:25,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712394795] [2023-02-16 03:27:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:25,026 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-16 03:27:25,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:25,027 INFO L229 MonitoredProcess]: Starting monitored process 46 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-16 03:27:25,029 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 (46)] Waiting until timeout for monitored process [2023-02-16 03:27:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:25,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:27:25,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:25,177 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 7 [2023-02-16 03:27:25,234 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:25,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:25,360 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 14 treesize of output 20 [2023-02-16 03:27:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:27:25,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:27:25,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712394795] [2023-02-16 03:27:25,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712394795] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:25,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:25,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-02-16 03:27:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785129520] [2023-02-16 03:27:25,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:25,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:27:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:27:25,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:27:25,625 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 03:27:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:25,971 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2023-02-16 03:27:25,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:27:25,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2023-02-16 03:27:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:25,972 INFO L225 Difference]: With dead ends: 74 [2023-02-16 03:27:25,972 INFO L226 Difference]: Without dead ends: 74 [2023-02-16 03:27:25,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:27:25,972 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:25,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 228 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 331 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:27:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-16 03:27:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-02-16 03:27:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-02-16 03:27:25,974 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 57 [2023-02-16 03:27:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:25,974 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-02-16 03:27:25,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 03:27:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-02-16 03:27:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 03:27:25,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:25,974 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:27:25,984 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 (46)] Ended with exit code 0 [2023-02-16 03:27:26,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:26,175 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash -388191190, now seen corresponding path program 1 times [2023-02-16 03:27:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:26,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985838733] [2023-02-16 03:27:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:26,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:26,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:26,177 INFO L229 MonitoredProcess]: Starting monitored process 47 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-16 03:27:26,178 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 (47)] Waiting until timeout for monitored process [2023-02-16 03:27:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:26,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:27:26,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:26,327 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 7 [2023-02-16 03:27:26,391 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:26,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:26,462 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:26,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:26,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:26,679 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 14 treesize of output 20 [2023-02-16 03:27:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:26,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:26,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:26,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985838733] [2023-02-16 03:27:26,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985838733] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:26,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1165930936] [2023-02-16 03:27:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:26,973 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:26,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:26,974 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:26,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2023-02-16 03:27:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:27,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:27:27,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:27,190 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 7 [2023-02-16 03:27:27,219 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:27,219 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 13 treesize of output 13 [2023-02-16 03:27:27,263 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:27,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:27:27,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:27,562 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 14 treesize of output 20 [2023-02-16 03:27:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:27,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:27,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:27,800 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 25 treesize of output 31 [2023-02-16 03:27:27,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1165930936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:27,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:27,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2023-02-16 03:27:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279860428] [2023-02-16 03:27:27,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:27,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:27:27,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:27:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:27:27,855 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 03:27:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:28,249 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-02-16 03:27:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:27:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 60 [2023-02-16 03:27:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:28,250 INFO L225 Difference]: With dead ends: 73 [2023-02-16 03:27:28,250 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 03:27:28,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 168 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-16 03:27:28,250 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:28,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 223 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 390 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:27:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 03:27:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-16 03:27:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 60 states have internal predecessors, (62), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:27:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-02-16 03:27:28,252 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 60 [2023-02-16 03:27:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:28,252 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-02-16 03:27:28,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 03:27:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-02-16 03:27:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-16 03:27:28,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:28,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:27:28,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:28,462 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 (47)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:28,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 03:27:28,653 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-16 03:27:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash 610425485, now seen corresponding path program 1 times [2023-02-16 03:27:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:28,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268802252] [2023-02-16 03:27:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:28,654 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-16 03:27:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:28,655 INFO L229 MonitoredProcess]: Starting monitored process 49 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-16 03:27:28,658 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 (49)] Waiting until timeout for monitored process [2023-02-16 03:27:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:28,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 03:27:28,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:29,385 INFO L321 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2023-02-16 03:27:29,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 168 [2023-02-16 03:27:44,027 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~fe~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32)) (v_ArrVal_1004 (_ BitVec 1)) (v_ArrVal_998 (_ BitVec 1))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_1004))) (let ((.cse0 (store .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_998))) (let ((.cse1 (store .cse0 |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 1)))) (let ((.cse2 (store .cse1 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~fe~1#1.base|)) (not (= (_ bv0 32) |ULTIMATE.start_entry_point_~c11~0#1.base|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (= (_ bv0 1) (bvadd (select .cse1 |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))) (not (= (_ bv0 32) |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |c_#valid| (store .cse2 |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= (_ bv0 1) (bvadd (select .cse2 |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))))))))) is different from true [2023-02-16 03:27:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-16 03:27:44,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:44,386 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:27:44,390 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:27:44,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-16 03:27:44,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-16 03:27:45,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (_ bv0 32) |c_ULTIMATE.start_entry_point_~c11~0#1.base|)))) (and (or (and (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ BitVec 32))) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (or (not (= (_ bv0 1) (bvadd (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67|)))))) (or .cse1 (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67|))))))) (not (= (_ bv0 32) |c_ULTIMATE.start_entry_point_~cfg~1#1.base|))) (or .cse1 (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ BitVec 32))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ bv0 1)))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store .cse2 |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (not (= (_ bv0 1) (bvadd (select .cse2 |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67|))))))) (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ BitVec 32))) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67| (_ bv0 1)))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (or (not (= (_ bv0 1) (bvadd (select .cse3 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store .cse3 |c_ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (not (= (_ bv0 1) (bvadd (select .cse4 |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_67|))))))))) is different from false [2023-02-16 03:27:45,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:45,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268802252] [2023-02-16 03:27:45,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268802252] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:45,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [68990061] [2023-02-16 03:27:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:45,010 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:45,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:45,011 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:45,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process [2023-02-16 03:27:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:45,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-16 03:27:45,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:47,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:27:48,085 INFO L321 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-02-16 03:27:48,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 36 [2023-02-16 03:27:48,453 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:27:48,453 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:48,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:27:49,176 INFO L321 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-02-16 03:27:49,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 75 [2023-02-16 03:27:49,382 INFO L321 Elim1Store]: treesize reduction 106, result has 32.1 percent of original size [2023-02-16 03:27:49,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 121 [2023-02-16 03:27:49,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 7 [2023-02-16 03:27:49,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-16 03:28:35,690 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1035 (_ BitVec 1)) (v_ArrVal_1044 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~fe~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (let ((.cse2 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_1035))) (let ((.cse0 (store .cse2 |ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_1044))) (let ((.cse3 (store .cse0 |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 1)))) (let ((.cse1 (store .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (and (not (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32))) (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~fe~1#1.base|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (= (_ bv0 1) (bvadd (select .cse1 |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (select .cse2 |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |c_#valid| (store .cse1 |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)))) is different from true [2023-02-16 03:28:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-16 03:28:35,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:28:36,398 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:28:36,401 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:28:36,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-16 03:28:36,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-16 03:28:45,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [68990061] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:28:45,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:28:45,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 38 [2023-02-16 03:28:45,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080399522] [2023-02-16 03:28:45,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:28:45,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-16 03:28:45,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:28:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-16 03:28:45,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2019, Unknown=33, NotChecked=282, Total=2550 [2023-02-16 03:28:45,429 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 39 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-16 03:28:47,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]