./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-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_test10-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 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:23:20,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:23:20,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:23:20,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:23:20,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:23:20,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:23:20,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:23:20,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:23:20,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:23:20,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:23:20,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:23:20,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:23:20,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:23:20,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:23:20,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:23:20,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:23:20,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:23:20,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:23:20,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:23:20,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:23:20,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:23:20,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:23:20,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:23:20,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:23:20,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:23:20,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:23:20,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:23:20,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:23:20,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:23:20,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:23:20,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:23:20,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:23:20,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:23:20,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:23:20,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:23:20,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:23:20,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:23:20,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:23:20,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:23:20,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:23:20,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:23:20,953 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:20,966 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:23:20,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:23:20,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:23:20,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:23:20,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:23:20,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:23:20,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:23:20,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:23:20,968 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:23:20,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:23:20,969 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:23:20,969 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:23:20,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:23:20,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:23:20,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:23:20,969 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:23:20,969 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:23:20,970 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:23:20,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:23:20,970 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:23:20,970 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:23:20,970 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:23:20,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:23:20,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:23:20,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:23:20,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:23:20,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:23:20,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:23:20,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:23:20,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:23:20,972 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:23:20,972 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:23:20,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:23:20,972 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:23:20,972 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 -> 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 [2023-02-16 03:23:21,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:23:21,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:23:21,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:23:21,157 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:23:21,157 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:23:21,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2023-02-16 03:23:22,110 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:23:22,388 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:23:22,388 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2023-02-16 03:23:22,400 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60f30bc0/e971e3259b6e4a66b35199886045813f/FLAGf45247c82 [2023-02-16 03:23:22,414 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60f30bc0/e971e3259b6e4a66b35199886045813f [2023-02-16 03:23:22,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:23:22,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:23:22,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:22,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:23:22,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:23:22,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:22" (1/1) ... [2023-02-16 03:23:22,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775ab9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:22, skipping insertion in model container [2023-02-16 03:23:22,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:22" (1/1) ... [2023-02-16 03:23:22,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:23:22,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:23:22,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:22,793 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:23:22,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d00ff91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:22, skipping insertion in model container [2023-02-16 03:23:22,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:22,794 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:23:22,796 INFO L158 Benchmark]: Toolchain (without parser) took 377.34ms. Allocated memory is still 130.0MB. Free memory was 98.7MB in the beginning and 85.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:23:22,796 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:23:22,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.31ms. Allocated memory is still 130.0MB. Free memory was 98.7MB in the beginning and 85.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:23:22,798 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.31ms. Allocated memory is still 130.0MB. Free memory was 98.7MB in the beginning and 85.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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_test10-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 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:23:24,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:23:24,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:23:24,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:23:24,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:23:24,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:23:24,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:23:24,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:23:24,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:23:24,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:23:24,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:23:24,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:23:24,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:23:24,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:23:24,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:23:24,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:23:24,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:23:24,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:23:24,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:23:24,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:23:24,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:23:24,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:23:24,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:23:24,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:23:24,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:23:24,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:23:24,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:23:24,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:23:24,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:23:24,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:23:24,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:23:24,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:23:24,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:23:24,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:23:24,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:23:24,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:23:24,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:23:24,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:23:24,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:23:24,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:23:24,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:23:24,475 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:23:24,501 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:23:24,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:23:24,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:23:24,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:23:24,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:23:24,503 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:23:24,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:23:24,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:23:24,503 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:23:24,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:23:24,504 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:23:24,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:23:24,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:23:24,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:23:24,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:23:24,505 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:23:24,505 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:23:24,505 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:23:24,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:23:24,506 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:23:24,506 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:23:24,506 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:23:24,506 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:23:24,506 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:23:24,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:23:24,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:23:24,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:23:24,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:23:24,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:23:24,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:23:24,508 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:23:24,508 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:24,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:23:24,508 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:23:24,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:23:24,508 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:23:24,509 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:23:24,509 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 -> 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 [2023-02-16 03:23:24,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:23:24,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:23:24,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:23:24,789 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:23:24,789 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:23:24,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2023-02-16 03:23:25,796 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:23:26,094 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:23:26,094 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2023-02-16 03:23:26,111 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63fe5d722/deb34e8826f14f8682b432f883e7cc9a/FLAG683c95cec [2023-02-16 03:23:26,121 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63fe5d722/deb34e8826f14f8682b432f883e7cc9a [2023-02-16 03:23:26,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:23:26,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:23:26,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:26,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:23:26,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:23:26,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365b9a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26, skipping insertion in model container [2023-02-16 03:23:26,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:23:26,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:23:26,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:26,465 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:23:26,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:23:26,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:26,554 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:23:26,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:26,617 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:23:26,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26 WrapperNode [2023-02-16 03:23:26,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:26,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:23:26,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:23:26,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:23:26,623 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:23:26" (1/1) ... [2023-02-16 03:23:26,641 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:23:26" (1/1) ... [2023-02-16 03:23:26,664 INFO L138 Inliner]: procedures = 167, calls = 92, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 78 [2023-02-16 03:23:26,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:23:26,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:23:26,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:23:26,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:23:26,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,681 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:23:26,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:23:26,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:23:26,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:23:26,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (1/1) ... [2023-02-16 03:23:26,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:23:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:23:26,708 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:23:26,714 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:23:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-16 03:23:26,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-16 03:23:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:23:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:23:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:23:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:23:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:23:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:23:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:23:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:23:26,844 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:23:26,846 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:23:27,196 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:23:27,201 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:23:27,201 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-16 03:23:27,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:23:27 BoogieIcfgContainer [2023-02-16 03:23:27,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:23:27,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:23:27,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:23:27,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:23:27,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:23:26" (1/3) ... [2023-02-16 03:23:27,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d33237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:23:27, skipping insertion in model container [2023-02-16 03:23:27,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:26" (2/3) ... [2023-02-16 03:23:27,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d33237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:23:27, skipping insertion in model container [2023-02-16 03:23:27,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:23:27" (3/3) ... [2023-02-16 03:23:27,207 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test10-2.i [2023-02-16 03:23:27,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:23:27,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-02-16 03:23:27,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:23:27,269 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;@1a71b7d5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:23:27,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2023-02-16 03:23:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 87 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:23:27,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:27,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:27,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:27,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1192529059, now seen corresponding path program 1 times [2023-02-16 03:23:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:27,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877318333] [2023-02-16 03:23:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:27,295 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:23:27,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:27,297 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:23:27,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 03:23:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:27,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:23:27,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:27,417 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:23:27,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:27,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:27,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877318333] [2023-02-16 03:23:27,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877318333] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:27,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:27,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:23:27,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218403398] [2023-02-16 03:23:27,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:27,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:23:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:23:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:23:27,460 INFO L87 Difference]: Start difference. First operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 87 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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:23:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:27,636 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2023-02-16 03:23:27,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:23:27,638 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:23:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:27,644 INFO L225 Difference]: With dead ends: 180 [2023-02-16 03:23:27,645 INFO L226 Difference]: Without dead ends: 176 [2023-02-16 03:23:27,646 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:23:27,648 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 83 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:27,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 485 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-16 03:23:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 95. [2023-02-16 03:23:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-16 03:23:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2023-02-16 03:23:27,679 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 11 [2023-02-16 03:23:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:27,679 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2023-02-16 03:23:27,680 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:23:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2023-02-16 03:23:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:23:27,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:27,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:27,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:27,889 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:23:27,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2080032740, now seen corresponding path program 1 times [2023-02-16 03:23:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:27,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083742635] [2023-02-16 03:23:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:27,891 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:23:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:27,893 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:23:27,894 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:23:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:27,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:23:27,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:28,004 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:23:28,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:28,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:28,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083742635] [2023-02-16 03:23:28,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083742635] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:28,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:28,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:23:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373362166] [2023-02-16 03:23:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:28,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:23:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:23:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:23:28,007 INFO L87 Difference]: Start difference. First operand 95 states and 104 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:23:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:28,199 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2023-02-16 03:23:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:23:28,199 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:23:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:28,200 INFO L225 Difference]: With dead ends: 163 [2023-02-16 03:23:28,200 INFO L226 Difference]: Without dead ends: 161 [2023-02-16 03:23:28,201 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:23:28,201 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 63 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:28,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 281 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:23:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-16 03:23:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 91. [2023-02-16 03:23:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2023-02-16 03:23:28,207 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 11 [2023-02-16 03:23:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:28,207 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2023-02-16 03:23:28,208 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:23:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2023-02-16 03:23:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:23:28,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:28,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:28,216 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:23:28,413 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:23:28,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash -895923568, now seen corresponding path program 1 times [2023-02-16 03:23:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:28,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671127170] [2023-02-16 03:23:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:28,415 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:23:28,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:28,416 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:23:28,418 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:23:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:28,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:23:28,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:28,495 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:23:28,530 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:23:28,571 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:23:28,571 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:23:28,580 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:23:28,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:28,725 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:23:28,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671127170] [2023-02-16 03:23:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671127170] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:28,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:23:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087379364] [2023-02-16 03:23:28,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:28,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:23:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:23:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:23:28,728 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:23:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:29,018 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2023-02-16 03:23:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:23:29,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 15 [2023-02-16 03:23:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:29,020 INFO L225 Difference]: With dead ends: 102 [2023-02-16 03:23:29,020 INFO L226 Difference]: Without dead ends: 102 [2023-02-16 03:23:29,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 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:23:29,021 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 66 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:29,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 198 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 318 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2023-02-16 03:23:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-16 03:23:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2023-02-16 03:23:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 90 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-16 03:23:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2023-02-16 03:23:29,026 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 15 [2023-02-16 03:23:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:29,027 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2023-02-16 03:23:29,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:23:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2023-02-16 03:23:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:23:29,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:29,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:29,049 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:23:29,234 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:23:29,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash -895923567, now seen corresponding path program 1 times [2023-02-16 03:23:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:29,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081213958] [2023-02-16 03:23:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:29,237 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:23:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:29,238 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:23:29,239 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:23:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:29,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:23:29,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:29,301 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:23:29,385 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:23:29,406 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:29,406 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:23:29,419 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:23:29,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:29,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:29,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081213958] [2023-02-16 03:23:29,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081213958] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:29,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1725271955] [2023-02-16 03:23:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:29,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:29,553 INFO L229 MonitoredProcess]: Starting monitored process 6 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:23:29,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-02-16 03:23:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:23:29,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:29,637 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:23:29,643 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:23:29,754 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_24 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_24))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:23:29,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:23:29,772 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:23:29,781 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:29,781 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:23:29,786 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:23:29,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:31,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1725271955] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:31,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:31,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-16 03:23:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96494709] [2023-02-16 03:23:31,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:31,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:23:31,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:23:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2023-02-16 03:23:31,728 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:32,455 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2023-02-16 03:23:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:23:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-02-16 03:23:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:32,457 INFO L225 Difference]: With dead ends: 198 [2023-02-16 03:23:32,457 INFO L226 Difference]: Without dead ends: 198 [2023-02-16 03:23:32,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=54, Invalid=224, Unknown=2, NotChecked=62, Total=342 [2023-02-16 03:23:32,458 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 101 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:32,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 307 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 654 Invalid, 0 Unknown, 294 Unchecked, 0.6s Time] [2023-02-16 03:23:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-16 03:23:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2023-02-16 03:23:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 123 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-16 03:23:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 181 transitions. [2023-02-16 03:23:32,467 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 181 transitions. Word has length 15 [2023-02-16 03:23:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:32,468 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 181 transitions. [2023-02-16 03:23:32,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2023-02-16 03:23:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:23:32,468 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:32,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:32,477 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:23:32,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-02-16 03:23:32,869 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:32,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1602092369, now seen corresponding path program 1 times [2023-02-16 03:23:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:32,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198413563] [2023-02-16 03:23:32,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:32,870 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:23:32,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:32,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:32,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 03:23:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:32,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:23:32,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:32,950 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:23:32,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:32,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:32,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198413563] [2023-02-16 03:23:32,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198413563] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:32,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:32,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:23:32,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242403237] [2023-02-16 03:23:32,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:32,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:23:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:23:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:23:32,953 INFO L87 Difference]: Start difference. First operand 133 states and 181 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:23:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:32,986 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2023-02-16 03:23:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:23:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2023-02-16 03:23:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:32,988 INFO L225 Difference]: With dead ends: 88 [2023-02-16 03:23:32,988 INFO L226 Difference]: Without dead ends: 86 [2023-02-16 03:23:32,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:23:32,991 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:32,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:23:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-16 03:23:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-16 03:23:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 80 states have internal predecessors, (83), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-16 03:23:32,999 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 15 [2023-02-16 03:23:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:32,999 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-16 03:23:32,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:23:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-16 03:23:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:23:33,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:33,000 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:33,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:33,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:33,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash 684574475, now seen corresponding path program 1 times [2023-02-16 03:23:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:33,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320206348] [2023-02-16 03:23:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:33,202 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:23:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:33,203 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:23:33,203 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:23:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:33,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:23:33,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:33,278 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:23:33,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-16 03:23:33,300 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:23:33,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:33,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:33,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320206348] [2023-02-16 03:23:33,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320206348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:33,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:33,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:23:33,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121369004] [2023-02-16 03:23:33,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:33,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:23:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:23:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:23:33,303 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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:23:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:33,393 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2023-02-16 03:23:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:23:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 20 [2023-02-16 03:23:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:33,394 INFO L225 Difference]: With dead ends: 95 [2023-02-16 03:23:33,394 INFO L226 Difference]: Without dead ends: 95 [2023-02-16 03:23:33,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:23:33,395 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 6 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:33,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 381 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-16 03:23:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2023-02-16 03:23:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 83 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-16 03:23:33,399 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 20 [2023-02-16 03:23:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:33,399 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-16 03:23:33,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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:23:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-16 03:23:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:23:33,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:33,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:33,413 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:23:33,606 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:23:33,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1122879988, now seen corresponding path program 1 times [2023-02-16 03:23:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:33,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34055607] [2023-02-16 03:23:33,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:33,607 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:23:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:33,608 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:23:33,610 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:23:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:33,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:23:33,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:33,757 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:23:33,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:33,828 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:23:33,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:33,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34055607] [2023-02-16 03:23:33,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34055607] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:33,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:33,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:23:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374128042] [2023-02-16 03:23:33,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:33,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:23:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:23:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:23:33,829 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:23:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:33,987 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2023-02-16 03:23:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:23:33,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 20 [2023-02-16 03:23:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:33,988 INFO L225 Difference]: With dead ends: 93 [2023-02-16 03:23:33,988 INFO L226 Difference]: Without dead ends: 91 [2023-02-16 03:23:33,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 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:23:33,989 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 189 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:33,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 231 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-16 03:23:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-16 03:23:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 83 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-02-16 03:23:33,992 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 20 [2023-02-16 03:23:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:33,993 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-02-16 03:23:33,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:23:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-02-16 03:23:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:23:33,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:33,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:34,002 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:23:34,200 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:23:34,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1782681151, now seen corresponding path program 1 times [2023-02-16 03:23:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:34,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488247427] [2023-02-16 03:23:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:34,201 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:23:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:34,202 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:23:34,204 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:23:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:34,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:23:34,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:34,353 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1))))) is different from true [2023-02-16 03:23:34,358 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:23:34,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:34,441 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret44#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_18|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_18| (_ bv0 1))))) is different from false [2023-02-16 03:23:34,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:34,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488247427] [2023-02-16 03:23:34,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488247427] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:34,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1610004215] [2023-02-16 03:23:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:34,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:34,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:34,444 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:23:34,454 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:23:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:34,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:23:34,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:34,666 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_~a10~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)))))) is different from true [2023-02-16 03:23:34,672 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:23:34,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:34,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret44#1.base_21| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_21| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_21|))))) is different from false [2023-02-16 03:23:34,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1610004215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:34,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:34,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-16 03:23:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304153636] [2023-02-16 03:23:34,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:34,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:23:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:23:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=127, Unknown=4, NotChecked=100, Total=272 [2023-02-16 03:23:34,736 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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:23:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:35,393 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2023-02-16 03:23:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:23:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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 23 [2023-02-16 03:23:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:35,394 INFO L225 Difference]: With dead ends: 138 [2023-02-16 03:23:35,394 INFO L226 Difference]: Without dead ends: 133 [2023-02-16 03:23:35,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 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:23:35,394 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 125 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:35,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 396 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 575 Invalid, 2 Unknown, 267 Unchecked, 0.6s Time] [2023-02-16 03:23:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-16 03:23:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 84. [2023-02-16 03:23:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 77 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-16 03:23:35,398 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 23 [2023-02-16 03:23:35,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:35,398 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-16 03:23:35,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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:23:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-16 03:23:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:23:35,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:35,399 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:23:35,408 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:23:35,619 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:23:35,807 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:23:35,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash -931351798, now seen corresponding path program 1 times [2023-02-16 03:23:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:35,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377365443] [2023-02-16 03:23:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:35,808 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:23:35,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:35,809 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:23:35,810 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:23:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:35,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:23:35,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:35,868 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:23:35,880 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:23:35,898 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 19 treesize of output 11 [2023-02-16 03:23:35,919 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:23:35,929 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:23:35,930 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:23:35,938 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:23:35,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:36,052 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:23:36,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377365443] [2023-02-16 03:23:36,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377365443] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:36,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:36,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2023-02-16 03:23:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842164350] [2023-02-16 03:23:36,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:36,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:23:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:36,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:23:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:23:36,054 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:23:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:36,331 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-02-16 03:23:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:23:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:23:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:36,332 INFO L225 Difference]: With dead ends: 92 [2023-02-16 03:23:36,332 INFO L226 Difference]: Without dead ends: 92 [2023-02-16 03:23:36,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=85, Unknown=1, NotChecked=18, Total=132 [2023-02-16 03:23:36,332 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 6 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:36,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 324 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 319 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2023-02-16 03:23:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-16 03:23:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2023-02-16 03:23:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 82 states have internal predecessors, (86), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 03:23:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2023-02-16 03:23:36,335 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 25 [2023-02-16 03:23:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:36,336 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2023-02-16 03:23:36,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:23:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2023-02-16 03:23:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:23:36,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:36,336 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:23:36,347 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:23:36,537 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:23:36,537 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash -931351797, now seen corresponding path program 1 times [2023-02-16 03:23:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:36,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842295284] [2023-02-16 03:23:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:36,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:36,538 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:23:36,539 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:23:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:36,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:23:36,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:36,619 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:23:36,639 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:23:36,643 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:23:36,668 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:23:36,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:23:36,709 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:23:36,720 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:36,720 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:23:36,736 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:23:36,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:36,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:36,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842295284] [2023-02-16 03:23:36,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842295284] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:36,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354063064] [2023-02-16 03:23:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:36,877 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:36,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:36,878 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:23:36,879 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:23:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:36,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:23:36,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:36,987 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:23:36,990 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:23:37,041 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:23:37,045 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:23:37,088 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 28 treesize of output 16 [2023-02-16 03:23:37,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:23:37,136 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_133 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_133))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:23:37,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:23:37,147 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:23:37,153 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:37,153 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:23:37,157 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:23:37,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:37,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1354063064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:37,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:37,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-16 03:23:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585159633] [2023-02-16 03:23:37,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:37,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 03:23:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 03:23:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=230, Unknown=2, NotChecked=62, Total=342 [2023-02-16 03:23:37,274 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:23:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:37,769 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2023-02-16 03:23:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:23:37,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:23:37,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:37,771 INFO L225 Difference]: With dead ends: 93 [2023-02-16 03:23:37,771 INFO L226 Difference]: Without dead ends: 93 [2023-02-16 03:23:37,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=387, Unknown=2, NotChecked=82, Total=552 [2023-02-16 03:23:37,771 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 11 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:37,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 487 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 357 Invalid, 0 Unknown, 191 Unchecked, 0.4s Time] [2023-02-16 03:23:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-16 03:23:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-16 03:23:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 03:23:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-16 03:23:37,774 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 25 [2023-02-16 03:23:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:37,774 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-16 03:23:37,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:23:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-16 03:23:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:23:37,775 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:37,775 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:23:37,788 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:23:37,984 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:23:38,178 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:23:38,178 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1436910423, now seen corresponding path program 1 times [2023-02-16 03:23:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:38,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568730599] [2023-02-16 03:23:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:38,179 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:23:38,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:38,180 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:23:38,181 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:23:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:38,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:23:38,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:38,254 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:23:38,260 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:23:38,273 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:23:38,275 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:23:38,283 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:23:38,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:38,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:38,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568730599] [2023-02-16 03:23:38,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568730599] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:38,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:38,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:23:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536931315] [2023-02-16 03:23:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:38,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:23:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:38,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:23:38,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:23:38,284 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:23:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:38,362 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2023-02-16 03:23:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:23:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:23:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:38,363 INFO L225 Difference]: With dead ends: 86 [2023-02-16 03:23:38,363 INFO L226 Difference]: Without dead ends: 82 [2023-02-16 03:23:38,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:23:38,364 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:38,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 375 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-16 03:23:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-16 03:23:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-16 03:23:38,366 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 25 [2023-02-16 03:23:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:38,366 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-16 03:23:38,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:23:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-16 03:23:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:23:38,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:38,367 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] [2023-02-16 03:23:38,378 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 (15)] Ended with exit code 0 [2023-02-16 03:23:38,573 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:23:38,574 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash -412676065, now seen corresponding path program 1 times [2023-02-16 03:23:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:38,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937732743] [2023-02-16 03:23:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:38,574 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:23:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:38,575 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:23:38,576 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:23:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:38,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:23:38,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:38,662 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:23:38,710 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:38,710 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:23:38,722 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:23:40,757 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3|)))) is different from true [2023-02-16 03:23:40,794 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:40,794 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:23:40,816 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:23:40,828 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:23:40,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:40,853 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2023-02-16 03:23:40,853 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:23:40,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937732743] [2023-02-16 03:23:40,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937732743] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2037299945] [2023-02-16 03:23:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:40,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:40,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:40,897 INFO L229 MonitoredProcess]: Starting monitored process 17 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:23:40,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-02-16 03:23:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:41,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 03:23:41,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:41,011 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:23:41,028 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:41,030 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:23:41,038 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:23:43,050 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_4|)))) is different from true [2023-02-16 03:23:43,084 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:43,085 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:23:43,093 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:23:43,095 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:23:43,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:43,126 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2023-02-16 03:23:43,126 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:23:43,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2037299945] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:43,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:43,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2023-02-16 03:23:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713178690] [2023-02-16 03:23:43,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:43,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:23:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:23:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=147, Unknown=10, NotChecked=50, Total=240 [2023-02-16 03:23:43,156 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:55,717 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2023-02-16 03:23:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:23:55,718 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-16 03:23:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:55,718 INFO L225 Difference]: With dead ends: 121 [2023-02-16 03:23:55,718 INFO L226 Difference]: Without dead ends: 121 [2023-02-16 03:23:55,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=97, Invalid=447, Unknown=16, NotChecked=90, Total=650 [2023-02-16 03:23:55,719 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 104 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:55,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 427 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 507 Invalid, 0 Unknown, 234 Unchecked, 0.4s Time] [2023-02-16 03:23:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-16 03:23:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2023-02-16 03:23:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.6) internal successors, (80), 77 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-02-16 03:23:55,722 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 28 [2023-02-16 03:23:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:55,722 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-02-16 03:23:55,722 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-02-16 03:23:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:23:55,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:55,723 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] [2023-02-16 03:23:55,734 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:23:55,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:56,124 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:56,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:23:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash -412676064, now seen corresponding path program 1 times [2023-02-16 03:23:56,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:56,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290781233] [2023-02-16 03:23:56,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:56,125 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:23:56,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:56,126 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:23:56,126 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:23:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:56,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:23:56,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:56,206 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:23:56,252 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:56,252 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:23:56,268 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:23:56,272 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:23:56,393 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:56,394 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:23:56,398 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:23:56,433 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:23:56,436 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:23:56,460 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:23:56,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:56,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:23:56,579 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:23:56,622 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_3) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (or (forall ((v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_219) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32)))) (forall ((v_ArrVal_218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_218) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_219) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv4 32))))) is different from false [2023-02-16 03:23:56,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:56,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290781233] [2023-02-16 03:23:56,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290781233] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:56,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [361010214] [2023-02-16 03:23:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:56,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:56,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:56,644 INFO L229 MonitoredProcess]: Starting monitored process 19 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:23:56,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-02-16 03:23:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:56,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:23:56,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:56,765 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:23:56,786 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:56,786 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:23:56,799 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:23:56,803 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:23:56,901 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:56,901 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:23:56,906 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:23:56,922 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:23:56,924 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:23:56,942 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:23:56,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:56,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:23:56,980 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:23:57,042 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_244) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_ULTIMATE.start_entry_point_#t~mem47#1.base|)) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_5) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_5) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv4 32)))) (forall ((v_ArrVal_243 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_243) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2023-02-16 03:23:57,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [361010214] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:57,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:57,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2023-02-16 03:23:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807612861] [2023-02-16 03:23:57,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:57,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:23:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:23:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=178, Unknown=2, NotChecked=54, Total=272 [2023-02-16 03:23:57,062 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:23:59,083 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:01,697 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:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:01,831 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2023-02-16 03:24:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:24:01,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2023-02-16 03:24:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:01,832 INFO L225 Difference]: With dead ends: 126 [2023-02-16 03:24:01,832 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:24:01,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=497, Unknown=2, NotChecked=94, Total=702 [2023-02-16 03:24:01,833 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 106 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:01,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 469 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 535 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2023-02-16 03:24:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:24:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 86. [2023-02-16 03:24:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 78 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2023-02-16 03:24:01,835 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 28 [2023-02-16 03:24:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:01,835 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2023-02-16 03:24:01,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:24:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2023-02-16 03:24:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:24:01,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:01,836 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, 1] [2023-02-16 03:24:01,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:02,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-02-16 03:24:02,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:02,239 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1444706688, now seen corresponding path program 1 times [2023-02-16 03:24:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:02,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107593545] [2023-02-16 03:24:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:02,240 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:02,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:02,241 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:02,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-16 03:24:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:02,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:02,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:24:02,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:02,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:02,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107593545] [2023-02-16 03:24:02,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107593545] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:02,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:02,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:24:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639928390] [2023-02-16 03:24:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:02,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:24:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:24:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:24:02,314 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:02,400 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2023-02-16 03:24:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:24:02,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-02-16 03:24:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:02,401 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:24:02,401 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:24:02,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:02,401 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 30 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:02,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:24:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-16 03:24:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 77 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2023-02-16 03:24:02,403 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 30 [2023-02-16 03:24:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:02,403 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2023-02-16 03:24:02,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2023-02-16 03:24:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:24:02,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:02,404 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, 1] [2023-02-16 03:24:02,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:02,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:02,608 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:02,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1444706687, now seen corresponding path program 1 times [2023-02-16 03:24:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:02,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716998071] [2023-02-16 03:24:02,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:02,609 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:02,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:02,610 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:02,612 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:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:02,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:24:02,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:02,731 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:02,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:02,792 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 22 treesize of output 18 [2023-02-16 03:24:02,902 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:02,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:02,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716998071] [2023-02-16 03:24:02,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716998071] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:02,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:02,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-16 03:24:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300833726] [2023-02-16 03:24:02,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:24:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:24:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:24:02,904 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:24:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:03,152 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2023-02-16 03:24:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2023-02-16 03:24:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:03,153 INFO L225 Difference]: With dead ends: 84 [2023-02-16 03:24:03,153 INFO L226 Difference]: Without dead ends: 84 [2023-02-16 03:24:03,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:24:03,153 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 118 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:03,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 229 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:24:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-16 03:24:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-16 03:24:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-02-16 03:24:03,155 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 30 [2023-02-16 03:24:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:03,155 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-02-16 03:24:03,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:24:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-02-16 03:24:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:24:03,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:03,156 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, 1, 1] [2023-02-16 03:24:03,163 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:03,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:03,363 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1836234894, now seen corresponding path program 1 times [2023-02-16 03:24:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:03,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492222007] [2023-02-16 03:24:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:03,363 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:03,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:03,364 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:03,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-16 03:24:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:03,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 03:24:03,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:03,470 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:03,474 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:03,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:24:03,576 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:24:03,576 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 23 treesize of output 21 [2023-02-16 03:24:03,599 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:24:03,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:03,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:03,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:03,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492222007] [2023-02-16 03:24:03,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492222007] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:03,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:03,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:24:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099621089] [2023-02-16 03:24:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:03,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:24:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:24:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:24:03,610 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:24:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:03,813 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2023-02-16 03:24:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:24:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2023-02-16 03:24:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:03,813 INFO L225 Difference]: With dead ends: 96 [2023-02-16 03:24:03,813 INFO L226 Difference]: Without dead ends: 96 [2023-02-16 03:24:03,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:24:03,814 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 94 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:03,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 334 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-16 03:24:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2023-02-16 03:24:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 77 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2023-02-16 03:24:03,816 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 31 [2023-02-16 03:24:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:03,816 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2023-02-16 03:24:03,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:24:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2023-02-16 03:24:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:24:03,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:03,817 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, 1, 1] [2023-02-16 03:24:03,826 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 (22)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:04,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:04,024 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1836234347, now seen corresponding path program 1 times [2023-02-16 03:24:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:04,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670163818] [2023-02-16 03:24:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:04,025 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:04,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:04,025 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:04,027 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:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:04,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:24:04,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:04,108 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 19 treesize of output 11 [2023-02-16 03:24:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:24:04,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:04,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:04,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670163818] [2023-02-16 03:24:04,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670163818] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:04,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:04,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246314971] [2023-02-16 03:24:04,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:04,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:24:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:24:04,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:24:04,117 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:04,261 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2023-02-16 03:24:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-16 03:24:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:04,262 INFO L225 Difference]: With dead ends: 88 [2023-02-16 03:24:04,262 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 03:24:04,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:24:04,263 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 16 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:04,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 218 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 03:24:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-02-16 03:24:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-02-16 03:24:04,265 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 31 [2023-02-16 03:24:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:04,265 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-02-16 03:24:04,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-02-16 03:24:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:24:04,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:04,266 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, 1, 1] [2023-02-16 03:24:04,273 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:24:04,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:04,473 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1836234346, now seen corresponding path program 1 times [2023-02-16 03:24:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:04,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231514908] [2023-02-16 03:24:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:04,474 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:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:04,475 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:04,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-16 03:24:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:04,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:24:04,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:04,617 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 23 treesize of output 15 [2023-02-16 03:24:04,619 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 32 treesize of output 16 [2023-02-16 03:24:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:24:04,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:04,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:04,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231514908] [2023-02-16 03:24:04,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231514908] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:04,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:04,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224277187] [2023-02-16 03:24:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:04,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:24:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:04,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:24:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:24:04,656 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:05,106 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2023-02-16 03:24:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:05,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-16 03:24:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:05,106 INFO L225 Difference]: With dead ends: 94 [2023-02-16 03:24:05,106 INFO L226 Difference]: Without dead ends: 94 [2023-02-16 03:24:05,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:24:05,107 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 20 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:05,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 241 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:24:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-16 03:24:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2023-02-16 03:24:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2023-02-16 03:24:05,109 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 31 [2023-02-16 03:24:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:05,109 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2023-02-16 03:24:05,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2023-02-16 03:24:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:24:05,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:05,110 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, 1, 1, 1] [2023-02-16 03:24:05,120 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 (24)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:05,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:05,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1088706739, now seen corresponding path program 1 times [2023-02-16 03:24:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:05,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721122808] [2023-02-16 03:24:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:05,321 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,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:05,322 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:24:05,323 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:24:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:05,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:24:05,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:05,421 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:05,454 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:05,454 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:05,473 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 6 treesize of output 5 [2023-02-16 03:24:05,476 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:07,517 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_21| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_21| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_21|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13|)))) is different from true [2023-02-16 03:24:09,608 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:24:09,609 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 1 case distinctions, treesize of input 42 treesize of output 32 [2023-02-16 03:24:09,613 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 29 [2023-02-16 03:24:09,642 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 24 treesize of output 16 [2023-02-16 03:24:09,689 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:24:09,690 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 32 treesize of output 15 [2023-02-16 03:24:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:24:09,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:09,772 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |c_ULTIMATE.start_entry_point_#t~ret48#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_363) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))))) is different from false [2023-02-16 03:24:10,578 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret48#1.base_29| (_ BitVec 32))) (or (= (_ bv0 32) |v_ULTIMATE.start_entry_point_#t~ret48#1.base_29|) (forall ((v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_29|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_363) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))))))) is different from false [2023-02-16 03:24:10,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:10,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721122808] [2023-02-16 03:24:10,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721122808] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:10,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28022938] [2023-02-16 03:24:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:10,581 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:10,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:10,582 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:24:10,582 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:24:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:10,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 03:24:10,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:10,705 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:10,750 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:10,751 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:10,784 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:10,982 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:24:10,982 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 26 treesize of output 27 [2023-02-16 03:24:11,001 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 23 treesize of output 11 [2023-02-16 03:24:11,033 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:11,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:11,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [28022938] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:11,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:11,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2023-02-16 03:24:11,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456090683] [2023-02-16 03:24:11,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:11,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:24:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:24:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=523, Unknown=20, NotChecked=144, Total=756 [2023-02-16 03:24:11,161 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:24:13,186 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:15,203 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:18,343 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:20,388 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:22,619 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:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:23,133 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2023-02-16 03:24:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:24:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2023-02-16 03:24:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:23,134 INFO L225 Difference]: With dead ends: 127 [2023-02-16 03:24:23,134 INFO L226 Difference]: Without dead ends: 127 [2023-02-16 03:24:23,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=201, Invalid=1264, Unknown=29, NotChecked=228, Total=1722 [2023-02-16 03:24:23,135 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 128 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 38 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:23,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 733 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 878 Invalid, 5 Unknown, 121 Unchecked, 11.4s Time] [2023-02-16 03:24:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-16 03:24:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 89. [2023-02-16 03:24:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 80 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2023-02-16 03:24:23,137 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 32 [2023-02-16 03:24:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:23,137 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2023-02-16 03:24:23,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:24:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2023-02-16 03:24:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:24:23,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:23,139 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, 1] [2023-02-16 03:24:23,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:23,346 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:24:23,539 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:24:23,539 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 738912307, now seen corresponding path program 1 times [2023-02-16 03:24:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:23,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322159834] [2023-02-16 03:24:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:23,540 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:23,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:23,541 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:24:23,542 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:24:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:23,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:23,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:23,638 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 19 treesize of output 11 [2023-02-16 03:24:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:24:23,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:23,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:23,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322159834] [2023-02-16 03:24:23,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322159834] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:23,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:23,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:24:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204030007] [2023-02-16 03:24:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:23,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:23,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:23,649 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:23,789 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2023-02-16 03:24:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:24:23,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-02-16 03:24:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:23,790 INFO L225 Difference]: With dead ends: 90 [2023-02-16 03:24:23,790 INFO L226 Difference]: Without dead ends: 90 [2023-02-16 03:24:23,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:24:23,790 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:23,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 180 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-16 03:24:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-16 03:24:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 81 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-02-16 03:24:23,793 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 33 [2023-02-16 03:24:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:23,793 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-02-16 03:24:23,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-02-16 03:24:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:24:23,793 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:23,793 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] [2023-02-16 03:24:23,802 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:24:23,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:23,997 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:24:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1143014625, now seen corresponding path program 1 times [2023-02-16 03:24:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:23,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324487468] [2023-02-16 03:24:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:23,998 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:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:23,999 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:24,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-16 03:24:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:24,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 03:24:24,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:24,100 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:24,138 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:24,138 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:24,157 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:24,161 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 6 treesize of output 5 [2023-02-16 03:24:26,203 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_25| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_25|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_15|)))) is different from true [2023-02-16 03:24:26,210 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:30,302 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:24:30,303 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:24:30,307 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:24:30,386 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:24:30,427 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:24:30,427 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:24:30,455 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_432 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_432))))) is different from true [2023-02-16 03:24:30,472 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:30,473 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:30,492 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:24:30,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:30,716 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |c_ULTIMATE.start_entry_point_#t~ret48#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_430) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (_ bv1 1)))) is different from false [2023-02-16 03:24:30,733 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:24:30,744 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret48#1.base_35| (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_35|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_430) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret48#1.base_35|)) is different from false [2023-02-16 03:24:30,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324487468] [2023-02-16 03:24:30,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324487468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1414512216] [2023-02-16 03:24:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:30,746 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:30,747 INFO L229 MonitoredProcess]: Starting monitored process 29 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:30,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-02-16 03:24:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:30,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-16 03:24:30,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:30,921 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:33,041 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:33,042 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:33,074 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:33,077 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:35,169 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_27| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_27| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_27|) (_ bv0 32))))) is different from true [2023-02-16 03:24:35,174 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:43,319 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:24:43,320 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:24:43,324 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:24:43,434 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:24:43,507 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:24:43,508 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:24:43,522 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_466 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_466))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:43,541 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:43,542 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:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-16 03:24:43,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:43,816 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:24:43,825 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_entry_point_#t~ret48#1.base_38| (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_38|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_464) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret48#1.base_38|)) is different from false [2023-02-16 03:24:43,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1414512216] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:43,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:43,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2023-02-16 03:24:43,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485584075] [2023-02-16 03:24:43,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:43,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:24:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:24:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=894, Unknown=17, NotChecked=462, Total=1482 [2023-02-16 03:24:43,828 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:24:45,851 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:47,862 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,912 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,919 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:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:09,456 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2023-02-16 03:25:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:25:09,457 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2023-02-16 03:25:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:09,458 INFO L225 Difference]: With dead ends: 102 [2023-02-16 03:25:09,458 INFO L226 Difference]: Without dead ends: 102 [2023-02-16 03:25:09,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=258, Invalid=1819, Unknown=21, NotChecked=658, Total=2756 [2023-02-16 03:25:09,459 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 116 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 40 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:09,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 522 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 868 Invalid, 4 Unknown, 356 Unchecked, 9.1s Time] [2023-02-16 03:25:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-16 03:25:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2023-02-16 03:25:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 84 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:25:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2023-02-16 03:25:09,461 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 37 [2023-02-16 03:25:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:09,461 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2023-02-16 03:25:09,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:25:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2023-02-16 03:25:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:25:09,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:09,462 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] [2023-02-16 03:25:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:09,669 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 (28)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:09,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:09,862 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:25:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1143014624, now seen corresponding path program 1 times [2023-02-16 03:25:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:09,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802673444] [2023-02-16 03:25:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:09,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:09,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:09,864 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:25:09,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-16 03:25:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:09,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 03:25:09,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:09,986 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:10,029 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:10,029 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:10,042 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:10,047 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 6 treesize of output 5 [2023-02-16 03:25:12,099 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_18|)))) is different from true [2023-02-16 03:25:14,135 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:25:14,140 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:16,278 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:25:16,278 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:25:16,282 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:25:16,476 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 03:25:16,476 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:25:16,480 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:25:16,552 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_501 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_501))))) is different from true [2023-02-16 03:25:16,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:16,563 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:25:16,573 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:16,573 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:16,600 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:25:16,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:16,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:16,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802673444] [2023-02-16 03:25:16,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802673444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:16,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [356352963] [2023-02-16 03:25:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:16,933 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:16,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:25:16,934 INFO L229 MonitoredProcess]: Starting monitored process 31 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:16,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-02-16 03:25:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:17,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-16 03:25:17,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:17,117 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:17,284 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:17,284 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:17,338 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:17,346 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:25:17,701 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:25:17,711 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:17,976 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:25:17,977 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:25:17,984 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 67 treesize of output 53 [2023-02-16 03:25:18,335 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-16 03:25:18,336 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:25:18,350 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:25:18,350 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:25:18,369 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_536 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_536))))) is different from true [2023-02-16 03:25:18,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:18,381 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:25:18,390 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:18,391 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:18,394 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:25:18,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:20,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [356352963] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:20,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:20,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2023-02-16 03:25:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519014569] [2023-02-16 03:25:20,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:20,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-16 03:25:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-16 03:25:20,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1084, Unknown=3, NotChecked=204, Total=1406 [2023-02-16 03:25:20,652 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 36 states, 32 states have (on average 1.625) internal successors, (52), 27 states have internal predecessors, (52), 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:25:22,686 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:24,703 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:26,867 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:32,757 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:35,176 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:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:35,192 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2023-02-16 03:25:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:25:35,193 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.625) internal successors, (52), 27 states have internal predecessors, (52), 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 37 [2023-02-16 03:25:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:35,193 INFO L225 Difference]: With dead ends: 124 [2023-02-16 03:25:35,193 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:25:35,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=261, Invalid=2100, Unknown=3, NotChecked=288, Total=2652 [2023-02-16 03:25:35,194 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 117 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 41 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:35,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 800 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1149 Invalid, 5 Unknown, 330 Unchecked, 11.7s Time] [2023-02-16 03:25:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:25:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2023-02-16 03:25:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.403225806451613) internal successors, (87), 84 states have internal predecessors, (87), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:25:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2023-02-16 03:25:35,197 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 37 [2023-02-16 03:25:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:35,197 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2023-02-16 03:25:35,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.625) internal successors, (52), 27 states have internal predecessors, (52), 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:25:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2023-02-16 03:25:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:25:35,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:35,198 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, 1, 1, 1, 1] [2023-02-16 03:25:35,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:35,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:35,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:35,605 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:25:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1229276979, now seen corresponding path program 1 times [2023-02-16 03:25:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:35,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285584670] [2023-02-16 03:25:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:35,606 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:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:35,607 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:25:35,608 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:25:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:35,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:25:35,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:35,731 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,895 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-16 03:25:35,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 03:25:35,898 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 21 treesize of output 13 [2023-02-16 03:25:35,967 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:25:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:25:35,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:36,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:25:36,197 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 31 treesize of output 34 [2023-02-16 03:25:36,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-02-16 03:25:36,371 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 24 treesize of output 22 [2023-02-16 03:25:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:25:36,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:36,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285584670] [2023-02-16 03:25:36,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285584670] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:36,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:36,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2023-02-16 03:25:36,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308480539] [2023-02-16 03:25:36,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:36,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:25:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:36,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:25:36,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:25:36,404 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:25:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:37,046 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-02-16 03:25:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:25:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2023-02-16 03:25:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:37,047 INFO L225 Difference]: With dead ends: 97 [2023-02-16 03:25:37,047 INFO L226 Difference]: Without dead ends: 97 [2023-02-16 03:25:37,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2023-02-16 03:25:37,048 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 183 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:37,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 282 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:25:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-16 03:25:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-02-16 03:25:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:25:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-02-16 03:25:37,050 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 36 [2023-02-16 03:25:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:37,050 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-02-16 03:25:37,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:25:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-02-16 03:25:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:25:37,051 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:37,051 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] [2023-02-16 03:25:37,058 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:25:37,253 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:25:37,253 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:25:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1653548802, now seen corresponding path program 1 times [2023-02-16 03:25:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:37,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67419631] [2023-02-16 03:25:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:37,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:37,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:37,254 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:25:37,255 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:25:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:37,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:25:37,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:37,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:25:37,400 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:37,400 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:37,413 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:37,418 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 6 treesize of output 5 [2023-02-16 03:25:39,465 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_25|)))) is different from true [2023-02-16 03:25:41,589 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:25:41,590 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:25:41,595 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 39 treesize of output 33 [2023-02-16 03:25:41,698 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 03:25:41,699 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 69 treesize of output 36 [2023-02-16 03:25:41,702 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:25:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:25:41,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:52,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:25:52,897 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 2412 treesize of output 2170 [2023-02-16 03:25:52,993 INFO L321 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-02-16 03:25:52,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 1878 treesize of output 1561 [2023-02-16 03:25:53,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:53,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:53,386 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:25:53,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 816 treesize of output 814 [2023-02-16 03:25:54,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:25:54,303 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 393 treesize of output 345 [2023-02-16 03:25:54,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:25:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 03:25:54,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:54,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67419631] [2023-02-16 03:25:54,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67419631] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:54,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:54,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2023-02-16 03:25:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908162338] [2023-02-16 03:25:54,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:54,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 03:25:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 03:25:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=4, NotChecked=40, Total=506 [2023-02-16 03:25:54,536 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:26:05,018 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:27,503 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, 1] [2023-02-16 03:26:29,673 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 [1] [2023-02-16 03:26:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:31,136 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2023-02-16 03:26:31,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:26:31,137 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-02-16 03:26:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:31,137 INFO L225 Difference]: With dead ends: 114 [2023-02-16 03:26:31,137 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 03:26:31,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=165, Invalid=1018, Unknown=11, NotChecked=66, Total=1260 [2023-02-16 03:26:31,138 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:31,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 524 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 755 Invalid, 3 Unknown, 85 Unchecked, 9.4s Time] [2023-02-16 03:26:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 03:26:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2023-02-16 03:26:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 82 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:26:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2023-02-16 03:26:31,140 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 37 [2023-02-16 03:26:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:31,141 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2023-02-16 03:26:31,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:26:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2023-02-16 03:26:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:26:31,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:31,141 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, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:31,153 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 (33)] Ended with exit code 0 [2023-02-16 03:26:31,348 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:31,348 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:26:31,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 219174838, now seen corresponding path program 1 times [2023-02-16 03:26:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:31,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957501996] [2023-02-16 03:26:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:31,349 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:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:31,350 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:31,351 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:26:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:31,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:26:31,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:31,803 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:26:32,059 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-16 03:26:32,059 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 15 [2023-02-16 03:26:36,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:26:36,362 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 36 treesize of output 37 [2023-02-16 03:26:36,466 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 33 treesize of output 21 [2023-02-16 03:26:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:26:38,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:39,261 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_611) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)))) is different from false [2023-02-16 03:26:39,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:39,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957501996] [2023-02-16 03:26:39,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957501996] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:39,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [555414859] [2023-02-16 03:26:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:39,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:26:39,311 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:26:39,312 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:26:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:39,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:26:39,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:44,241 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:26:44,714 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-02-16 03:26:44,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2023-02-16 03:26:47,078 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:26:47,079 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 36 treesize of output 37 [2023-02-16 03:26:47,221 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 33 treesize of output 21 [2023-02-16 03:26:49,693 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|v_ULTIMATE.start_entry_point_#t~mem53#1.base_14| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_entry_point_#t~mem53#1.base_14| (_ bv0 1)) |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_entry_point_#t~mem53#1.base_14|)))))) is different from true [2023-02-16 03:26:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:26:49,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:49,827 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_636) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)))) is different from false [2023-02-16 03:26:49,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [555414859] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:49,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:26:49,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-02-16 03:26:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510281075] [2023-02-16 03:26:49,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:26:49,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 03:26:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 03:26:49,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=621, Unknown=8, NotChecked=156, Total=870 [2023-02-16 03:26:49,878 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:26:51,961 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,000 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,072 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:27:00,555 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:27:12,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:27:14,661 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:27:22,822 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:27:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:28,097 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2023-02-16 03:27:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:27:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-02-16 03:27:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:28,098 INFO L225 Difference]: With dead ends: 95 [2023-02-16 03:27:28,098 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 03:27:28,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=187, Invalid=1451, Unknown=14, NotChecked=240, Total=1892 [2023-02-16 03:27:28,099 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 78 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 24 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:28,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 375 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 671 Invalid, 9 Unknown, 84 Unchecked, 16.6s Time] [2023-02-16 03:27:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 03:27:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-02-16 03:27:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 69 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:27:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2023-02-16 03:27:28,106 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 38 [2023-02-16 03:27:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:28,106 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2023-02-16 03:27:28,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:27:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2023-02-16 03:27:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:27:28,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:28,107 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:27:28,116 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 (34)] Ended with exit code 0 [2023-02-16 03:27:28,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-02-16 03:27:28,514 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:28,514 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:27:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1047942818, now seen corresponding path program 1 times [2023-02-16 03:27:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:28,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166467161] [2023-02-16 03:27:28,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:28,515 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,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:28,516 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:28,517 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:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:28,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:27:28,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:28,639 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:28,726 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:28,772 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:27:28,772 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:28,833 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:28,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:28,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:28,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166467161] [2023-02-16 03:27:28,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166467161] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:28,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:28,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:28,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304094765] [2023-02-16 03:27:28,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:28,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:27:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:28,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:27:28,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-16 03:27:28,834 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:29,218 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2023-02-16 03:27:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:27:29,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-16 03:27:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:29,220 INFO L225 Difference]: With dead ends: 78 [2023-02-16 03:27:29,220 INFO L226 Difference]: Without dead ends: 78 [2023-02-16 03:27:29,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-16 03:27:29,220 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:29,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 105 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 80 Unchecked, 0.4s Time] [2023-02-16 03:27:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-16 03:27:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-02-16 03:27:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 68 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:27:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-16 03:27:29,222 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 40 [2023-02-16 03:27:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:29,222 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-16 03:27:29,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-16 03:27:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:27:29,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:29,223 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:27:29,230 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:29,430 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:29,430 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2023-02-16 03:27:29,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1047942817, now seen corresponding path program 1 times [2023-02-16 03:27:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:29,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274537929] [2023-02-16 03:27:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:29,431 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:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:29,432 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:29,432 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:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:29,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-16 03:27:29,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:29,572 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:29,589 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:29,857 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_695 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_695))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:29,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:29,881 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:29,911 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:29,912 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:30,088 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_696 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_696))))) is different from true [2023-02-16 03:27:30,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:30,113 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:30,143 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:30,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:27:30,297 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_697 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_697))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:30,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:30,323 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:30,361 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:30,361 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:30,458 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:30,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:31,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:31,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274537929] [2023-02-16 03:27:31,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274537929] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:31,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [493249695] [2023-02-16 03:27:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:31,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:31,155 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:31,156 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:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:31,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-16 03:27:31,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:31,380 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:31,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:27:31,617 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:31,617 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:31,629 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:31,727 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:27:31,735 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:32,025 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:36,177 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_734 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |c_ldv_malloc_#res.base| v_ArrVal_734))) (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_49| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_49| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_49|) (_ bv0 32)))))) is different from true [2023-02-16 03:27:36,244 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:27:36,245 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:36,529 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:27:36,529 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:27:36,542 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 32 treesize of output 34 [2023-02-16 03:27:37,125 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 29 treesize of output 21 [2023-02-16 03:27:37,309 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:27:37,309 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 37 treesize of output 20 [2023-02-16 03:27:37,529 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_738 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_738))))) is different from true [2023-02-16 03:27:37,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:37,556 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 16 treesize of output 18 [2023-02-16 03:27:37,599 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:37,599 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:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 2 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-16 03:27:38,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:42,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [493249695] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:42,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:42,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 27 [2023-02-16 03:27:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472438312] [2023-02-16 03:27:42,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:42,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 03:27:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 03:27:42,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=661, Unknown=7, NotChecked=280, Total=1056 [2023-02-16 03:27:42,118 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 28 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:27:44,224 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:27:46,235 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:27:50,884 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]