./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/uthash-2.0.2/uthash_FNV_test4-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 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:50:53,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:50:53,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:50:53,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:50:53,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:50:53,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:50:53,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:50:53,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:50:53,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:50:53,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:50:53,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:50:53,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:50:53,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:50:53,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:50:53,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:50:53,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:50:53,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:50:53,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:50:53,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:50:53,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:50:53,846 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:50:53,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:50:53,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:50:53,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:50:53,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:50:53,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:50:53,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:50:53,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:50:53,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:50:53,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:50:53,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:50:53,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:50:53,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:50:53,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:50:53,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:50:53,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:50:53,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:50:53,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:50:53,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:50:53,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:50:53,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:50:53,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:50:53,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 23:50:53,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:50:53,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:50:53,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:50:53,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:50:53,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:50:53,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:50:53,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:50:53,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:50:53,890 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:50:53,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:50:53,890 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 23:50:53,890 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:50:53,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:50:53,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 23:50:53,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:50:53,891 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:50:53,891 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:50:53,891 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:50:53,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:50:53,892 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:50:53,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 23:50:53,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:50:53,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:50:53,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:50:53,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:50:53,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:50:53,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:50:53,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:50:53,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 23:50:53,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 23:50:53,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 [2022-07-21 23:50:54,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:50:54,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:50:54,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:50:54,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:50:54,156 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:50:54,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2022-07-21 23:50:54,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b76fbc5/b73ac3e02f33463d80bc40e2bde4ea79/FLAG8ff8e321b [2022-07-21 23:50:54,616 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:50:54,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2022-07-21 23:50:54,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b76fbc5/b73ac3e02f33463d80bc40e2bde4ea79/FLAG8ff8e321b [2022-07-21 23:50:54,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b76fbc5/b73ac3e02f33463d80bc40e2bde4ea79 [2022-07-21 23:50:54,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:50:54,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:50:54,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:50:54,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:50:54,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:50:54,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:50:54" (1/1) ... [2022-07-21 23:50:54,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c27b6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:54, skipping insertion in model container [2022-07-21 23:50:54,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:50:54" (1/1) ... [2022-07-21 23:50:54,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:50:54,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:50:55,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i[33021,33034] [2022-07-21 23:50:55,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:50:55,404 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) [2022-07-21 23:50:55,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a7850af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:55, skipping insertion in model container [2022-07-21 23:50:55,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:50:55,405 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-21 23:50:55,407 INFO L158 Benchmark]: Toolchain (without parser) took 467.15ms. Allocated memory is still 65.0MB. Free memory was 44.0MB in the beginning and 41.8MB in the end (delta: 2.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-07-21 23:50:55,407 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 23:50:55,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.49ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 41.8MB in the end (delta: 2.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-07-21 23:50:55,409 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.15ms. Allocated memory is still 65.0MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.49ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 41.8MB in the end (delta: 2.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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/uthash-2.0.2/uthash_FNV_test4-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 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:50:56,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:50:56,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:50:56,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:50:56,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:50:56,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:50:56,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:50:56,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:50:56,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:50:56,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:50:56,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:50:56,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:50:56,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:50:56,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:50:56,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:50:56,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:50:56,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:50:56,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:50:56,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:50:56,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:50:56,804 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:50:56,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:50:56,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:50:56,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:50:56,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:50:56,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:50:56,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:50:56,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:50:56,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:50:56,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:50:56,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:50:56,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:50:56,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:50:56,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:50:56,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:50:56,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:50:56,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:50:56,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:50:56,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:50:56,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:50:56,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:50:56,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:50:56,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 23:50:56,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:50:56,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:50:56,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:50:56,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:50:56,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:50:56,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:50:56,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:50:56,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:50:56,853 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:50:56,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:50:56,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 23:50:56,854 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:50:56,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:50:56,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 23:50:56,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:50:56,854 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 23:50:56,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:50:56,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:50:56,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:50:56,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:50:56,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:50:56,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:50:56,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:50:56,857 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 23:50:56,857 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 23:50:56,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 23:50:56,857 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 [2022-07-21 23:50:57,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:50:57,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:50:57,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:50:57,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:50:57,116 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:50:57,117 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2022-07-21 23:50:57,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76a07503/ad98666634f94f41a95e2da9f07f42d6/FLAGab5f3b318 [2022-07-21 23:50:57,635 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:50:57,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2022-07-21 23:50:57,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76a07503/ad98666634f94f41a95e2da9f07f42d6/FLAGab5f3b318 [2022-07-21 23:50:57,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76a07503/ad98666634f94f41a95e2da9f07f42d6 [2022-07-21 23:50:57,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:50:57,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:50:57,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:50:57,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:50:57,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:50:57,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:50:57" (1/1) ... [2022-07-21 23:50:57,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277ef892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:57, skipping insertion in model container [2022-07-21 23:50:57,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:50:57" (1/1) ... [2022-07-21 23:50:57,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:50:57,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:50:58,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i[33021,33034] [2022-07-21 23:50:58,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:50:58,156 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 23:50:58,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:50:58,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i[33021,33034] [2022-07-21 23:50:58,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:50:58,255 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 23:50:58,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i[33021,33034] [2022-07-21 23:50:58,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:50:58,352 INFO L208 MainTranslator]: Completed translation [2022-07-21 23:50:58,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58 WrapperNode [2022-07-21 23:50:58,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:50:58,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 23:50:58,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 23:50:58,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 23:50:58,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,436 INFO L137 Inliner]: procedures = 180, calls = 400, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1330 [2022-07-21 23:50:58,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 23:50:58,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 23:50:58,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 23:50:58,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 23:50:58,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 23:50:58,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 23:50:58,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 23:50:58,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 23:50:58,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (1/1) ... [2022-07-21 23:50:58,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:50:58,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 23:50:58,568 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) [2022-07-21 23:50:58,594 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 [2022-07-21 23:50:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 23:50:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 23:50:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 23:50:58,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 23:50:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 23:50:58,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 23:50:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 23:50:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 23:50:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 23:50:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 23:50:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 23:50:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 23:50:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 23:50:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 23:50:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 23:50:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 23:50:58,842 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 23:50:58,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 23:50:58,845 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 23:51:02,303 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 23:51:02,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 23:51:02,312 INFO L299 CfgBuilder]: Removed 69 assume(true) statements. [2022-07-21 23:51:02,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:51:02 BoogieIcfgContainer [2022-07-21 23:51:02,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 23:51:02,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 23:51:02,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 23:51:02,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 23:51:02,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:50:57" (1/3) ... [2022-07-21 23:51:02,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30131d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:51:02, skipping insertion in model container [2022-07-21 23:51:02,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:50:58" (2/3) ... [2022-07-21 23:51:02,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30131d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:51:02, skipping insertion in model container [2022-07-21 23:51:02,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:51:02" (3/3) ... [2022-07-21 23:51:02,321 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-2.i [2022-07-21 23:51:02,330 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 23:51:02,330 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 753 error locations. [2022-07-21 23:51:02,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 23:51:02,377 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49bbb8f4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bc281ab [2022-07-21 23:51:02,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 753 error locations. [2022-07-21 23:51:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 1473 states, 707 states have (on average 2.267326732673267) internal successors, (1603), 1464 states have internal predecessors, (1603), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 23:51:02,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:02,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 23:51:02,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-21 23:51:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:02,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743430453] [2022-07-21 23:51:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:02,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:02,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:02,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:02,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 23:51:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:02,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 23:51:02,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:02,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:02,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:02,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743430453] [2022-07-21 23:51:02,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743430453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:02,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:02,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:51:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133801689] [2022-07-21 23:51:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:02,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 23:51:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 23:51:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 23:51:02,593 INFO L87 Difference]: Start difference. First operand has 1473 states, 707 states have (on average 2.267326732673267) internal successors, (1603), 1464 states have internal predecessors, (1603), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:02,643 INFO L93 Difference]: Finished difference Result 1455 states and 1540 transitions. [2022-07-21 23:51:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 23:51:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-21 23:51:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:02,667 INFO L225 Difference]: With dead ends: 1455 [2022-07-21 23:51:02,667 INFO L226 Difference]: Without dead ends: 1453 [2022-07-21 23:51:02,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 23:51:02,670 INFO L413 NwaCegarLoop]: 1540 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:02,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:51:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-21 23:51:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2022-07-21 23:51:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 698 states have (on average 2.157593123209169) internal successors, (1506), 1444 states have internal predecessors, (1506), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1538 transitions. [2022-07-21 23:51:02,746 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1538 transitions. Word has length 5 [2022-07-21 23:51:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:02,746 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1538 transitions. [2022-07-21 23:51:02,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1538 transitions. [2022-07-21 23:51:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 23:51:02,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:02,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 23:51:02,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 23:51:02,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:02,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-21 23:51:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:02,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450006334] [2022-07-21 23:51:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:02,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:02,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:02,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:02,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 23:51:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:03,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:51:03,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:03,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:03,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:03,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:03,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450006334] [2022-07-21 23:51:03,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450006334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:03,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:03,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:51:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353133515] [2022-07-21 23:51:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:51:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:51:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:03,164 INFO L87 Difference]: Start difference. First operand 1453 states and 1538 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:04,829 INFO L93 Difference]: Finished difference Result 1490 states and 1588 transitions. [2022-07-21 23:51:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:51:04,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-21 23:51:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:04,833 INFO L225 Difference]: With dead ends: 1490 [2022-07-21 23:51:04,833 INFO L226 Difference]: Without dead ends: 1490 [2022-07-21 23:51:04,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:04,834 INFO L413 NwaCegarLoop]: 810 mSDtfsCounter, 1159 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:04,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1015 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 23:51:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-07-21 23:51:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1436. [2022-07-21 23:51:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 774 states have (on average 2.0) internal successors, (1548), 1427 states have internal predecessors, (1548), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1580 transitions. [2022-07-21 23:51:04,855 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1580 transitions. Word has length 5 [2022-07-21 23:51:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:04,855 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1580 transitions. [2022-07-21 23:51:04,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1580 transitions. [2022-07-21 23:51:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 23:51:04,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:04,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 23:51:04,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:05,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:05,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:05,063 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-21 23:51:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:05,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844614284] [2022-07-21 23:51:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:05,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:05,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 23:51:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:05,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:51:05,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:05,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:05,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:05,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844614284] [2022-07-21 23:51:05,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844614284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:05,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:05,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:51:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706720050] [2022-07-21 23:51:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:05,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:51:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:05,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:51:05,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:05,200 INFO L87 Difference]: Start difference. First operand 1436 states and 1580 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:07,479 INFO L93 Difference]: Finished difference Result 1739 states and 1903 transitions. [2022-07-21 23:51:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:51:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-21 23:51:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:07,484 INFO L225 Difference]: With dead ends: 1739 [2022-07-21 23:51:07,484 INFO L226 Difference]: Without dead ends: 1739 [2022-07-21 23:51:07,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:07,487 INFO L413 NwaCegarLoop]: 1206 mSDtfsCounter, 504 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:07,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1796 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 23:51:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-07-21 23:51:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1592. [2022-07-21 23:51:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 940 states have (on average 1.9723404255319148) internal successors, (1854), 1583 states have internal predecessors, (1854), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1886 transitions. [2022-07-21 23:51:07,515 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1886 transitions. Word has length 5 [2022-07-21 23:51:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:07,515 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 1886 transitions. [2022-07-21 23:51:07,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1886 transitions. [2022-07-21 23:51:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 23:51:07,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:07,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 23:51:07,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:07,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:07,723 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-21 23:51:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:07,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191786033] [2022-07-21 23:51:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:07,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:07,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:07,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 23:51:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:07,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 23:51:07,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:07,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:07,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191786033] [2022-07-21 23:51:07,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191786033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:07,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:07,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:51:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317365269] [2022-07-21 23:51:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:07,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:51:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:51:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:07,824 INFO L87 Difference]: Start difference. First operand 1592 states and 1886 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:07,882 INFO L93 Difference]: Finished difference Result 2936 states and 3493 transitions. [2022-07-21 23:51:07,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:51:07,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 23:51:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:07,894 INFO L225 Difference]: With dead ends: 2936 [2022-07-21 23:51:07,894 INFO L226 Difference]: Without dead ends: 2936 [2022-07-21 23:51:07,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:07,896 INFO L413 NwaCegarLoop]: 1662 mSDtfsCounter, 1143 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:07,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 3091 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:51:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2022-07-21 23:51:07,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1593. [2022-07-21 23:51:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 941 states have (on average 1.9713071200850159) internal successors, (1855), 1584 states have internal predecessors, (1855), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1887 transitions. [2022-07-21 23:51:07,929 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1887 transitions. Word has length 6 [2022-07-21 23:51:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:07,929 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 1887 transitions. [2022-07-21 23:51:07,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1887 transitions. [2022-07-21 23:51:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 23:51:07,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:07,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:07,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-21 23:51:08,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:08,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-21 23:51:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:08,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228456176] [2022-07-21 23:51:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:08,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:08,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:08,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 23:51:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:08,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 23:51:08,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:08,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:08,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:08,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228456176] [2022-07-21 23:51:08,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228456176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:08,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:08,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:51:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263822904] [2022-07-21 23:51:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:08,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:51:08,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:08,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:51:08,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:08,265 INFO L87 Difference]: Start difference. First operand 1593 states and 1887 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:08,288 INFO L93 Difference]: Finished difference Result 1557 states and 1850 transitions. [2022-07-21 23:51:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:51:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 23:51:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:08,320 INFO L225 Difference]: With dead ends: 1557 [2022-07-21 23:51:08,320 INFO L226 Difference]: Without dead ends: 1557 [2022-07-21 23:51:08,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:08,321 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 1347 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:08,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1420 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:51:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2022-07-21 23:51:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1551. [2022-07-21 23:51:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 923 states have (on average 1.9631635969664138) internal successors, (1812), 1542 states have internal predecessors, (1812), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1844 transitions. [2022-07-21 23:51:08,342 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1844 transitions. Word has length 11 [2022-07-21 23:51:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:08,342 INFO L495 AbstractCegarLoop]: Abstraction has 1551 states and 1844 transitions. [2022-07-21 23:51:08,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1844 transitions. [2022-07-21 23:51:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 23:51:08,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:08,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:08,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:08,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:08,552 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-21 23:51:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:08,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716918361] [2022-07-21 23:51:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:08,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:08,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:08,554 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:08,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 23:51:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:08,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:51:08,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:08,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:08,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:08,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716918361] [2022-07-21 23:51:08,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716918361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:08,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:08,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:51:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428211074] [2022-07-21 23:51:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:08,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:51:08,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:51:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:51:08,682 INFO L87 Difference]: Start difference. First operand 1551 states and 1844 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:08,743 INFO L93 Difference]: Finished difference Result 1536 states and 1822 transitions. [2022-07-21 23:51:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:51:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-21 23:51:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:08,747 INFO L225 Difference]: With dead ends: 1536 [2022-07-21 23:51:08,747 INFO L226 Difference]: Without dead ends: 1536 [2022-07-21 23:51:08,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:51:08,748 INFO L413 NwaCegarLoop]: 1342 mSDtfsCounter, 1318 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:08,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 2710 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:51:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-07-21 23:51:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1529. [2022-07-21 23:51:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 915 states have (on average 1.9486338797814207) internal successors, (1783), 1520 states have internal predecessors, (1783), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1815 transitions. [2022-07-21 23:51:08,765 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1815 transitions. Word has length 13 [2022-07-21 23:51:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:08,765 INFO L495 AbstractCegarLoop]: Abstraction has 1529 states and 1815 transitions. [2022-07-21 23:51:08,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1815 transitions. [2022-07-21 23:51:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 23:51:08,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:08,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:08,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:08,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:08,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:08,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:08,974 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-21 23:51:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:08,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108706525] [2022-07-21 23:51:08,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:08,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:08,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:08,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:08,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 23:51:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:09,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:51:09,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:09,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:09,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:09,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108706525] [2022-07-21 23:51:09,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108706525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:09,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:09,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:51:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880448311] [2022-07-21 23:51:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:09,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:51:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:51:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:51:09,156 INFO L87 Difference]: Start difference. First operand 1529 states and 1815 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:11,559 INFO L93 Difference]: Finished difference Result 2173 states and 2457 transitions. [2022-07-21 23:51:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 23:51:11,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 23:51:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:11,565 INFO L225 Difference]: With dead ends: 2173 [2022-07-21 23:51:11,565 INFO L226 Difference]: Without dead ends: 2173 [2022-07-21 23:51:11,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:51:11,566 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 2585 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2598 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:11,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2598 Valid, 1340 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 23:51:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2022-07-21 23:51:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1525. [2022-07-21 23:51:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 915 states have (on average 1.9442622950819672) internal successors, (1779), 1516 states have internal predecessors, (1779), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1811 transitions. [2022-07-21 23:51:11,585 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1811 transitions. Word has length 27 [2022-07-21 23:51:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:11,585 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 1811 transitions. [2022-07-21 23:51:11,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1811 transitions. [2022-07-21 23:51:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 23:51:11,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:11,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:11,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:11,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:11,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-21 23:51:11,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:11,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204713318] [2022-07-21 23:51:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:11,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:11,796 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:11,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 23:51:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:11,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 23:51:11,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:11,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:12,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:12,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:12,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204713318] [2022-07-21 23:51:12,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204713318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:12,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:12,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:51:12,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189158807] [2022-07-21 23:51:12,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:12,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:51:12,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:12,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:51:12,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:51:12,051 INFO L87 Difference]: Start difference. First operand 1525 states and 1811 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:14,854 INFO L93 Difference]: Finished difference Result 1908 states and 2095 transitions. [2022-07-21 23:51:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 23:51:14,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 23:51:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:14,865 INFO L225 Difference]: With dead ends: 1908 [2022-07-21 23:51:14,866 INFO L226 Difference]: Without dead ends: 1908 [2022-07-21 23:51:14,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:51:14,866 INFO L413 NwaCegarLoop]: 1070 mSDtfsCounter, 1061 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:14,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 2254 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 23:51:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2022-07-21 23:51:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1521. [2022-07-21 23:51:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 915 states have (on average 1.9398907103825136) internal successors, (1775), 1512 states have internal predecessors, (1775), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1807 transitions. [2022-07-21 23:51:14,883 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1807 transitions. Word has length 27 [2022-07-21 23:51:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:14,883 INFO L495 AbstractCegarLoop]: Abstraction has 1521 states and 1807 transitions. [2022-07-21 23:51:14,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1807 transitions. [2022-07-21 23:51:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 23:51:14,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:14,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:14,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-21 23:51:15,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:15,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-21 23:51:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:15,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915478965] [2022-07-21 23:51:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:15,097 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:15,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 23:51:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:15,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:51:15,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:15,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:15,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915478965] [2022-07-21 23:51:15,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915478965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:15,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:15,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:51:15,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834786724] [2022-07-21 23:51:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:15,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:51:15,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:51:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:51:15,292 INFO L87 Difference]: Start difference. First operand 1521 states and 1807 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:15,330 INFO L93 Difference]: Finished difference Result 1521 states and 1803 transitions. [2022-07-21 23:51:15,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:51:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-21 23:51:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:15,334 INFO L225 Difference]: With dead ends: 1521 [2022-07-21 23:51:15,334 INFO L226 Difference]: Without dead ends: 1521 [2022-07-21 23:51:15,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:51:15,335 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 1294 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:15,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 2688 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:51:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2022-07-21 23:51:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1515. [2022-07-21 23:51:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 909 states have (on average 1.9416941694169416) internal successors, (1765), 1506 states have internal predecessors, (1765), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1797 transitions. [2022-07-21 23:51:15,354 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1797 transitions. Word has length 42 [2022-07-21 23:51:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:15,355 INFO L495 AbstractCegarLoop]: Abstraction has 1515 states and 1797 transitions. [2022-07-21 23:51:15,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1797 transitions. [2022-07-21 23:51:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 23:51:15,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:15,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:15,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:15,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:15,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-21 23:51:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:15,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364688177] [2022-07-21 23:51:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:15,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:15,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 23:51:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:15,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:51:15,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:15,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:15,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:15,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364688177] [2022-07-21 23:51:15,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364688177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:15,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:15,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:51:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421968301] [2022-07-21 23:51:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:15,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:51:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:51:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:15,853 INFO L87 Difference]: Start difference. First operand 1515 states and 1797 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:15,992 INFO L93 Difference]: Finished difference Result 1756 states and 2047 transitions. [2022-07-21 23:51:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:51:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-21 23:51:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:15,996 INFO L225 Difference]: With dead ends: 1756 [2022-07-21 23:51:15,997 INFO L226 Difference]: Without dead ends: 1756 [2022-07-21 23:51:15,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:51:15,997 INFO L413 NwaCegarLoop]: 1415 mSDtfsCounter, 269 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:15,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 2626 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 23:51:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-07-21 23:51:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1561. [2022-07-21 23:51:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 955 states have (on average 1.8963350785340314) internal successors, (1811), 1552 states have internal predecessors, (1811), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1843 transitions. [2022-07-21 23:51:16,012 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1843 transitions. Word has length 50 [2022-07-21 23:51:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:16,013 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1843 transitions. [2022-07-21 23:51:16,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1843 transitions. [2022-07-21 23:51:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 23:51:16,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:16,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:16,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:16,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:16,222 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-21 23:51:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:16,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205880271] [2022-07-21 23:51:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:16,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:16,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:16,225 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:16,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 23:51:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:16,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 23:51:16,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:16,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:16,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:16,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 23:51:16,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:16,769 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:51:16,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:51:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:16,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:16,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:16,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205880271] [2022-07-21 23:51:16,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205880271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:16,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:16,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:51:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302440514] [2022-07-21 23:51:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:16,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:51:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:16,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:51:16,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:51:16,783 INFO L87 Difference]: Start difference. First operand 1561 states and 1843 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:18,566 INFO L93 Difference]: Finished difference Result 1530 states and 1766 transitions. [2022-07-21 23:51:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:51:18,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-21 23:51:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:18,570 INFO L225 Difference]: With dead ends: 1530 [2022-07-21 23:51:18,570 INFO L226 Difference]: Without dead ends: 1530 [2022-07-21 23:51:18,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:51:18,571 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 2001 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:18,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 790 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 23:51:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-07-21 23:51:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1311. [2022-07-21 23:51:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 789 states have (on average 1.7870722433460076) internal successors, (1410), 1302 states have internal predecessors, (1410), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1442 transitions. [2022-07-21 23:51:18,582 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1442 transitions. Word has length 53 [2022-07-21 23:51:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:18,583 INFO L495 AbstractCegarLoop]: Abstraction has 1311 states and 1442 transitions. [2022-07-21 23:51:18,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1442 transitions. [2022-07-21 23:51:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 23:51:18,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:18,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:18,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:18,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:18,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-21 23:51:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:18,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522583653] [2022-07-21 23:51:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:18,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:18,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:18,795 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:18,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 23:51:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:18,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 23:51:18,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:19,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:19,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:51:19,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-21 23:51:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:19,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:19,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:19,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522583653] [2022-07-21 23:51:19,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522583653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:19,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:19,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:51:19,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680001036] [2022-07-21 23:51:19,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:19,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 23:51:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:19,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 23:51:19,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:51:19,035 INFO L87 Difference]: Start difference. First operand 1311 states and 1442 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:21,057 INFO L93 Difference]: Finished difference Result 1310 states and 1441 transitions. [2022-07-21 23:51:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 23:51:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-21 23:51:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:21,062 INFO L225 Difference]: With dead ends: 1310 [2022-07-21 23:51:21,062 INFO L226 Difference]: Without dead ends: 1310 [2022-07-21 23:51:21,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:51:21,062 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 4 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:21,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3174 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 23:51:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-07-21 23:51:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2022-07-21 23:51:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 789 states have (on average 1.785804816223067) internal successors, (1409), 1301 states have internal predecessors, (1409), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1441 transitions. [2022-07-21 23:51:21,074 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1441 transitions. Word has length 58 [2022-07-21 23:51:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:21,074 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 1441 transitions. [2022-07-21 23:51:21,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1441 transitions. [2022-07-21 23:51:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 23:51:21,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:21,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:21,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:21,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:21,286 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:21,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-21 23:51:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:21,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936981746] [2022-07-21 23:51:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:21,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:21,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:21,288 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:21,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 23:51:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:21,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 23:51:21,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:21,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:51:21,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:51:21,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:51:21,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-21 23:51:21,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-07-21 23:51:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:21,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:21,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:21,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936981746] [2022-07-21 23:51:21,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936981746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:21,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:21,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:51:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735172465] [2022-07-21 23:51:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:21,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 23:51:21,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:21,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 23:51:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:51:21,590 INFO L87 Difference]: Start difference. First operand 1310 states and 1441 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:24,171 INFO L93 Difference]: Finished difference Result 1309 states and 1440 transitions. [2022-07-21 23:51:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 23:51:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-21 23:51:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:24,175 INFO L225 Difference]: With dead ends: 1309 [2022-07-21 23:51:24,175 INFO L226 Difference]: Without dead ends: 1309 [2022-07-21 23:51:24,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:51:24,175 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 2 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:24,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3213 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-21 23:51:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2022-07-21 23:51:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2022-07-21 23:51:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 788 states have (on average 1.7868020304568528) internal successors, (1408), 1300 states have internal predecessors, (1408), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 23:51:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1440 transitions. [2022-07-21 23:51:24,187 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1440 transitions. Word has length 58 [2022-07-21 23:51:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:24,187 INFO L495 AbstractCegarLoop]: Abstraction has 1309 states and 1440 transitions. [2022-07-21 23:51:24,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:51:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1440 transitions. [2022-07-21 23:51:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 23:51:24,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:24,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:24,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:24,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:24,392 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1427434238, now seen corresponding path program 1 times [2022-07-21 23:51:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275317971] [2022-07-21 23:51:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:24,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:24,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:24,395 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:24,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 23:51:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:24,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:51:24,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:24,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:51:24,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:24,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275317971] [2022-07-21 23:51:24,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275317971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:51:24,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:51:24,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:51:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828468476] [2022-07-21 23:51:24,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:51:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:51:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:24,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:51:24,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:51:24,621 INFO L87 Difference]: Start difference. First operand 1309 states and 1440 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-21 23:51:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:24,661 INFO L93 Difference]: Finished difference Result 1312 states and 1445 transitions. [2022-07-21 23:51:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:51:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2022-07-21 23:51:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:24,665 INFO L225 Difference]: With dead ends: 1312 [2022-07-21 23:51:24,666 INFO L226 Difference]: Without dead ends: 1312 [2022-07-21 23:51:24,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:51:24,666 INFO L413 NwaCegarLoop]: 1255 mSDtfsCounter, 2 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3757 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:24,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3757 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:51:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-07-21 23:51:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2022-07-21 23:51:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 790 states have (on average 1.7860759493670886) internal successors, (1411), 1303 states have internal predecessors, (1411), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-21 23:51:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1445 transitions. [2022-07-21 23:51:24,682 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1445 transitions. Word has length 66 [2022-07-21 23:51:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:24,683 INFO L495 AbstractCegarLoop]: Abstraction has 1312 states and 1445 transitions. [2022-07-21 23:51:24,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-21 23:51:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1445 transitions. [2022-07-21 23:51:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 23:51:24,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:24,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:24,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:24,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:24,893 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1840539799, now seen corresponding path program 1 times [2022-07-21 23:51:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:24,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748681406] [2022-07-21 23:51:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:51:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:24,896 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:24,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 23:51:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:51:25,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:51:25,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:25,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:51:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:25,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:25,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748681406] [2022-07-21 23:51:25,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748681406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:51:25,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:51:25,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 23:51:25,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809861711] [2022-07-21 23:51:25,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:51:25,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 23:51:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:25,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 23:51:25,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 23:51:25,218 INFO L87 Difference]: Start difference. First operand 1312 states and 1445 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:25,368 INFO L93 Difference]: Finished difference Result 1324 states and 1463 transitions. [2022-07-21 23:51:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 23:51:25,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-21 23:51:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:25,372 INFO L225 Difference]: With dead ends: 1324 [2022-07-21 23:51:25,372 INFO L226 Difference]: Without dead ends: 1324 [2022-07-21 23:51:25,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-21 23:51:25,373 INFO L413 NwaCegarLoop]: 1255 mSDtfsCounter, 12 mSDsluCounter, 7487 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8742 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:25,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8742 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 23:51:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-07-21 23:51:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1322. [2022-07-21 23:51:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 799 states have (on average 1.7847309136420526) internal successors, (1426), 1312 states have internal predecessors, (1426), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-21 23:51:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1460 transitions. [2022-07-21 23:51:25,392 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1460 transitions. Word has length 67 [2022-07-21 23:51:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:25,392 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1460 transitions. [2022-07-21 23:51:25,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1460 transitions. [2022-07-21 23:51:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 23:51:25,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:25,393 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:25,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:25,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:25,605 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1070860606, now seen corresponding path program 2 times [2022-07-21 23:51:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:25,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824265984] [2022-07-21 23:51:25,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 23:51:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:25,607 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:25,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 23:51:25,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 23:51:25,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:51:25,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 23:51:25,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:25,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:51:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:26,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824265984] [2022-07-21 23:51:26,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824265984] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:51:26,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:51:26,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-21 23:51:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474170841] [2022-07-21 23:51:26,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:51:26,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 23:51:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:26,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 23:51:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-21 23:51:26,113 INFO L87 Difference]: Start difference. First operand 1322 states and 1460 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:26,608 INFO L93 Difference]: Finished difference Result 1343 states and 1492 transitions. [2022-07-21 23:51:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 23:51:26,609 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-21 23:51:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:26,611 INFO L225 Difference]: With dead ends: 1343 [2022-07-21 23:51:26,611 INFO L226 Difference]: Without dead ends: 1339 [2022-07-21 23:51:26,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-21 23:51:26,612 INFO L413 NwaCegarLoop]: 1258 mSDtfsCounter, 51 mSDsluCounter, 6268 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 7526 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:26,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 7526 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 23:51:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-21 23:51:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1331. [2022-07-21 23:51:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 808 states have (on average 1.7797029702970297) internal successors, (1438), 1321 states have internal predecessors, (1438), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-21 23:51:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1472 transitions. [2022-07-21 23:51:26,624 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1472 transitions. Word has length 70 [2022-07-21 23:51:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:26,624 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1472 transitions. [2022-07-21 23:51:26,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1472 transitions. [2022-07-21 23:51:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 23:51:26,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:26,625 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:26,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:26,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:26,837 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1953798814, now seen corresponding path program 3 times [2022-07-21 23:51:26,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:26,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74422086] [2022-07-21 23:51:26,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 23:51:26,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:26,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:26,840 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:26,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 23:51:27,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-21 23:51:27,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:51:27,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 23:51:27,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:27,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:51:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:27,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:27,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74422086] [2022-07-21 23:51:27,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74422086] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:51:27,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:51:27,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-21 23:51:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115616533] [2022-07-21 23:51:27,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:51:27,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 23:51:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 23:51:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-21 23:51:27,949 INFO L87 Difference]: Start difference. First operand 1331 states and 1472 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:30,609 INFO L93 Difference]: Finished difference Result 1373 states and 1548 transitions. [2022-07-21 23:51:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-21 23:51:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-21 23:51:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:30,613 INFO L225 Difference]: With dead ends: 1373 [2022-07-21 23:51:30,613 INFO L226 Difference]: Without dead ends: 1367 [2022-07-21 23:51:30,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-21 23:51:30,614 INFO L413 NwaCegarLoop]: 1262 mSDtfsCounter, 189 mSDsluCounter, 13826 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 15088 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:30,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 15088 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 23:51:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-21 23:51:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1349. [2022-07-21 23:51:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 826 states have (on average 1.7687651331719128) internal successors, (1461), 1339 states have internal predecessors, (1461), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-21 23:51:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1495 transitions. [2022-07-21 23:51:30,629 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1495 transitions. Word has length 76 [2022-07-21 23:51:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:30,629 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1495 transitions. [2022-07-21 23:51:30,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1495 transitions. [2022-07-21 23:51:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 23:51:30,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:30,631 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:30,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:30,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:30,849 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash -613669538, now seen corresponding path program 4 times [2022-07-21 23:51:30,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:30,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551328057] [2022-07-21 23:51:30,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 23:51:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:30,851 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:30,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 23:51:31,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 23:51:31,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:51:31,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 23:51:31,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:31,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:51:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:51:32,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:32,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551328057] [2022-07-21 23:51:32,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551328057] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:51:32,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:51:32,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-21 23:51:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772237571] [2022-07-21 23:51:32,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:51:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 23:51:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:51:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 23:51:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-21 23:51:32,656 INFO L87 Difference]: Start difference. First operand 1349 states and 1495 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:51:41,411 INFO L93 Difference]: Finished difference Result 1429 states and 1628 transitions. [2022-07-21 23:51:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-21 23:51:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-21 23:51:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:51:41,414 INFO L225 Difference]: With dead ends: 1429 [2022-07-21 23:51:41,414 INFO L226 Difference]: Without dead ends: 1425 [2022-07-21 23:51:41,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-21 23:51:41,421 INFO L413 NwaCegarLoop]: 1275 mSDtfsCounter, 507 mSDsluCounter, 29214 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 30489 SdHoareTripleChecker+Invalid, 3425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 23:51:41,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 30489 Invalid, 3425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2979 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-21 23:51:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2022-07-21 23:51:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1383. [2022-07-21 23:51:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 860 states have (on average 1.7523255813953489) internal successors, (1507), 1373 states have internal predecessors, (1507), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-21 23:51:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1541 transitions. [2022-07-21 23:51:41,450 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1541 transitions. Word has length 88 [2022-07-21 23:51:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:51:41,450 INFO L495 AbstractCegarLoop]: Abstraction has 1383 states and 1541 transitions. [2022-07-21 23:51:41,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:51:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1541 transitions. [2022-07-21 23:51:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 23:51:41,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:51:41,451 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:51:41,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 23:51:41,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:51:41,662 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:51:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:51:41,662 INFO L85 PathProgramCache]: Analyzing trace with hash 97867710, now seen corresponding path program 5 times [2022-07-21 23:51:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:51:41,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281267736] [2022-07-21 23:51:41,663 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 23:51:41,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:51:41,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:51:41,664 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:51:41,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 23:51:42,766 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-21 23:51:42,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:51:42,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 23:51:42,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:51:42,815 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 23:51:42,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-07-21 23:51:43,043 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-21 23:51:43,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-21 23:51:43,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-21 23:51:43,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 22 [2022-07-21 23:51:45,506 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1577) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:51:45,606 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1578)))) is different from true [2022-07-21 23:51:45,700 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1579) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:51:46,296 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1584)))) is different from true [2022-07-21 23:51:46,953 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1590) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:51:47,738 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1597)))) is different from true [2022-07-21 23:51:47,943 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1599) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:51:48,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1602 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1602)))) is different from true [2022-07-21 23:51:48,377 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1603)))) is different from true [2022-07-21 23:51:48,858 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:51:48,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 51 [2022-07-21 23:51:49,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 25 [2022-07-21 23:51:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 360 not checked. [2022-07-21 23:51:49,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:51:49,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:51:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281267736] [2022-07-21 23:51:49,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281267736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 23:51:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [477253851] [2022-07-21 23:51:49,402 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 23:51:49,402 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 23:51:49,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 23:51:49,404 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 23:51:49,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-21 23:53:14,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-21 23:53:14,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:53:15,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 23:53:15,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:53:15,156 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 23:53:15,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-21 23:53:15,321 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-21 23:53:15,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-21 23:53:15,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:53:15,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-07-21 23:53:17,638 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:53:17,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:53:17,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 17 [2022-07-21 23:53:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-21 23:53:17,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:53:17,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-21 23:53:17,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [477253851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 23:53:17,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:53:17,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 25 [2022-07-21 23:53:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904737153] [2022-07-21 23:53:17,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:53:17,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 23:53:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:53:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 23:53:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=341, Unknown=36, NotChecked=470, Total=930 [2022-07-21 23:53:17,909 INFO L87 Difference]: Start difference. First operand 1383 states and 1541 transitions. Second operand has 27 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 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) [2022-07-21 23:53:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:53:23,759 INFO L93 Difference]: Finished difference Result 2497 states and 2728 transitions. [2022-07-21 23:53:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 23:53:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 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 110 [2022-07-21 23:53:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:53:23,764 INFO L225 Difference]: With dead ends: 2497 [2022-07-21 23:53:23,764 INFO L226 Difference]: Without dead ends: 2493 [2022-07-21 23:53:23,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 116 SyntacticMatches, 82 SemanticMatches, 38 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=170, Invalid=686, Unknown=54, NotChecked=650, Total=1560 [2022-07-21 23:53:23,765 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 1185 mSDsluCounter, 7576 mSDsCounter, 0 mSdLazyCounter, 5091 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 8309 SdHoareTripleChecker+Invalid, 22910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 5091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17785 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:53:23,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 8309 Invalid, 22910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 5091 Invalid, 0 Unknown, 17785 Unchecked, 5.4s Time] [2022-07-21 23:53:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-07-21 23:53:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1745. [2022-07-21 23:53:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1220 states have (on average 1.7024590163934425) internal successors, (2077), 1730 states have internal predecessors, (2077), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (22), 11 states have call predecessors, (22), 20 states have call successors, (22) [2022-07-21 23:53:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2119 transitions. [2022-07-21 23:53:23,784 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2119 transitions. Word has length 110 [2022-07-21 23:53:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:53:23,785 INFO L495 AbstractCegarLoop]: Abstraction has 1745 states and 2119 transitions. [2022-07-21 23:53:23,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 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) [2022-07-21 23:53:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2119 transitions. [2022-07-21 23:53:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 23:53:23,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:53:23,786 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:53:23,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 23:53:24,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-21 23:53:24,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 23:53:24,203 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2022-07-21 23:53:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:53:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash 97867711, now seen corresponding path program 1 times [2022-07-21 23:53:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:53:24,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962524933] [2022-07-21 23:53:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:53:24,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:53:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:53:24,205 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:53:24,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 23:53:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:53:24,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-21 23:53:24,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:53:24,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:53:25,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 23:53:25,050 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:53:25,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:53:25,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-21 23:53:25,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:53:25,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 10 [2022-07-21 23:53:25,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-07-21 23:53:25,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-07-21 23:53:25,199 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-07-21 23:53:25,205 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,266 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:53:25,310 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472)))) is different from true [2022-07-21 23:53:25,317 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,352 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,376 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:53:25,399 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,406 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,430 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 23:53:25,437 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-21 23:53:25,444 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:53:25,452 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,459 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-21 23:53:25,466 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-21 23:53:25,507 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 23:53:25,514 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-21 23:53:25,521 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-21 23:53:25,547 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,571 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-21 23:53:25,578 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,602 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:53:25,626 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-07-21 23:53:25,632 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-21 23:53:25,655 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-07-21 23:53:25,663 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,669 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 23:53:25,676 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-21 23:53:25,699 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:53:25,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-07-21 23:53:25,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-21 23:53:25,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 23:53:25,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 23:53:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2022-07-21 23:53:25,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:53:26,374 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-21 23:53:26,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:53:26,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962524933] [2022-07-21 23:53:26,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962524933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 23:53:26,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1527934014] [2022-07-21 23:53:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:53:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 23:53:26,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 23:53:26,381 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 23:53:26,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process