./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 6c24879c 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-?-6c24879 [2022-07-13 01:20:12,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:20:12,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:20:12,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:20:12,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:20:12,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:20:12,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:20:12,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:20:12,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:20:12,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:20:12,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:20:12,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:20:12,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:20:12,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:20:12,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:20:12,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:20:12,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:20:12,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:20:12,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:20:12,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:20:12,703 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:20:12,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:20:12,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:20:12,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:20:12,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:20:12,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:20:12,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:20:12,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:20:12,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:20:12,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:20:12,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:20:12,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:20:12,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:20:12,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:20:12,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:20:12,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:20:12,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:20:12,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:20:12,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:20:12,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:20:12,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:20:12,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:20:12,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-13 01:20:12,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:20:12,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:20:12,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:20:12,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:20:12,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:20:12,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:20:12,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:20:12,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:20:12,745 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:20:12,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:20:12,746 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:20:12,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:20:12,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:20:12,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:20:12,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:20:12,747 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:20:12,747 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:20:12,747 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:20:12,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:20:12,748 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:20:12,748 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:20:12,748 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:20:12,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:20:12,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:20:12,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:20:12,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:20:12,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:20:12,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:20:12,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:20:12,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:20:12,750 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-13 01:20:12,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:20:12,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:20:12,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:20:12,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:20:12,961 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:20:12,962 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-13 01:20:13,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000e6c324/2746c5551a3b40d7bb4cd3d2fa502df6/FLAG4399a5743 [2022-07-13 01:20:13,429 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:20:13,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2022-07-13 01:20:13,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000e6c324/2746c5551a3b40d7bb4cd3d2fa502df6/FLAG4399a5743 [2022-07-13 01:20:13,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000e6c324/2746c5551a3b40d7bb4cd3d2fa502df6 [2022-07-13 01:20:13,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:20:13,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:20:13,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:20:13,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:20:13,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:20:13,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:20:13" (1/1) ... [2022-07-13 01:20:13,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cebf070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:13, skipping insertion in model container [2022-07-13 01:20:13,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:20:13" (1/1) ... [2022-07-13 01:20:13,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:20:13,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:20:14,123 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-13 01:20:14,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:20:14,262 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-13 01:20:14,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@543da3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:14, skipping insertion in model container [2022-07-13 01:20:14,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:20:14,263 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:20:14,264 INFO L158 Benchmark]: Toolchain (without parser) took 484.21ms. Allocated memory is still 104.9MB. Free memory was 67.9MB in the beginning and 67.5MB in the end (delta: 398.6kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 01:20:14,265 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:20:14,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.53ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 67.5MB in the end (delta: 201.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 01:20:14,268 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.13ms. Allocated memory is still 104.9MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.53ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 67.5MB in the end (delta: 201.7kB). Peak memory consumption was 10.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-?-6c24879 [2022-07-13 01:20:15,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:20:15,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:20:15,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:20:15,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:20:15,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:20:15,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:20:15,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:20:15,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:20:15,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:20:15,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:20:15,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:20:15,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:20:15,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:20:15,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:20:15,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:20:15,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:20:15,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:20:15,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:20:15,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:20:15,844 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:20:15,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:20:15,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:20:15,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:20:15,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:20:15,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:20:15,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:20:15,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:20:15,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:20:15,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:20:15,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:20:15,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:20:15,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:20:15,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:20:15,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:20:15,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:20:15,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:20:15,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:20:15,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:20:15,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:20:15,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:20:15,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:20:15,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-13 01:20:15,884 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:20:15,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:20:15,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:20:15,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:20:15,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:20:15,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:20:15,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:20:15,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:20:15,887 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:20:15,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:20:15,888 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:20:15,888 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:20:15,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:20:15,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:20:15,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:20:15,888 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:20:15,889 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:20:15,889 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:20:15,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:20:15,889 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:20:15,889 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:20:15,889 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:20:15,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:20:15,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:20:15,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:20:15,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:20:15,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:20:15,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:20:15,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:20:15,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:20:15,891 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:20:15,891 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:20:15,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:20:15,891 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-13 01:20:16,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:20:16,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:20:16,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:20:16,171 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:20:16,172 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:20:16,173 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-13 01:20:16,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975e2dd2/88567c8a7ab040c294ab0ed0c325acd3/FLAG5b7c575ff [2022-07-13 01:20:16,694 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:20:16,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2022-07-13 01:20:16,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975e2dd2/88567c8a7ab040c294ab0ed0c325acd3/FLAG5b7c575ff [2022-07-13 01:20:17,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975e2dd2/88567c8a7ab040c294ab0ed0c325acd3 [2022-07-13 01:20:17,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:20:17,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:20:17,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:20:17,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:20:17,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:20:17,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528e5332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17, skipping insertion in model container [2022-07-13 01:20:17,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:20:17,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:20:17,372 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-13 01:20:17,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:20:17,484 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:20:17,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:20:17,515 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-13 01:20:17,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:20:17,618 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:20:17,635 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-13 01:20:17,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:20:17,747 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:20:17,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17 WrapperNode [2022-07-13 01:20:17,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:20:17,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:20:17,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:20:17,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:20:17,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,842 INFO L137 Inliner]: procedures = 180, calls = 400, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1330 [2022-07-13 01:20:17,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:20:17,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:20:17,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:20:17,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:20:17,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:20:17,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:20:17,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:20:17,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:20:17,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (1/1) ... [2022-07-13 01:20:17,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:20:17,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:20:17,990 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-13 01:20:18,086 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-13 01:20:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:20:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:20:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 01:20:18,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 01:20:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:20:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:20:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:20:18,319 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:20:18,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:20:18,329 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 01:20:21,942 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:20:21,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:20:21,969 INFO L299 CfgBuilder]: Removed 69 assume(true) statements. [2022-07-13 01:20:21,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:20:21 BoogieIcfgContainer [2022-07-13 01:20:21,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:20:21,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:20:21,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:20:21,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:20:21,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:20:17" (1/3) ... [2022-07-13 01:20:21,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7806186a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:20:21, skipping insertion in model container [2022-07-13 01:20:21,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:20:17" (2/3) ... [2022-07-13 01:20:21,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7806186a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:20:21, skipping insertion in model container [2022-07-13 01:20:21,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:20:21" (3/3) ... [2022-07-13 01:20:21,980 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-2.i [2022-07-13 01:20:21,990 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:20:21,991 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 753 error locations. [2022-07-13 01:20:22,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:20:22,061 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@4e4a3966, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c1ed598 [2022-07-13 01:20:22,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 753 error locations. [2022-07-13 01:20:22,068 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-13 01:20:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:20:22,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:22,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:20:22,073 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-13 01:20:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-13 01:20:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:22,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167169130] [2022-07-13 01:20:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:22,088 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-13 01:20:22,089 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-13 01:20:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:22,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 01:20:22,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:22,246 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-13 01:20:22,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:22,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:22,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167169130] [2022-07-13 01:20:22,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167169130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:22,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:22,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:20:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581021545] [2022-07-13 01:20:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:22,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 01:20:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 01:20:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 01:20:22,280 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-13 01:20:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:22,373 INFO L93 Difference]: Finished difference Result 1455 states and 1540 transitions. [2022-07-13 01:20:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 01:20:22,376 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-13 01:20:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:22,395 INFO L225 Difference]: With dead ends: 1455 [2022-07-13 01:20:22,396 INFO L226 Difference]: Without dead ends: 1453 [2022-07-13 01:20:22,397 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-13 01:20:22,400 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-13 01:20:22,401 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-13 01:20:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-13 01:20:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2022-07-13 01:20:22,471 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-13 01:20:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1538 transitions. [2022-07-13 01:20:22,476 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1538 transitions. Word has length 5 [2022-07-13 01:20:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:22,476 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1538 transitions. [2022-07-13 01:20:22,476 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-13 01:20:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1538 transitions. [2022-07-13 01:20:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:20:22,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:22,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:20:22,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 01:20:22,684 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-13 01:20:22,684 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-13 01:20:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-13 01:20:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152545028] [2022-07-13 01:20:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:22,687 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-13 01:20:22,733 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-13 01:20:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:22,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:20:22,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:22,886 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-13 01:20:22,901 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-13 01:20:22,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:22,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:22,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152545028] [2022-07-13 01:20:22,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152545028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:22,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:22,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:20:22,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610867557] [2022-07-13 01:20:22,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:22,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:20:22,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:22,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:20:22,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:20:22,903 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-13 01:20:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:24,663 INFO L93 Difference]: Finished difference Result 1490 states and 1588 transitions. [2022-07-13 01:20:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:20:24,664 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-13 01:20:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:24,668 INFO L225 Difference]: With dead ends: 1490 [2022-07-13 01:20:24,668 INFO L226 Difference]: Without dead ends: 1490 [2022-07-13 01:20:24,668 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-13 01:20:24,669 INFO L413 NwaCegarLoop]: 810 mSDtfsCounter, 1159 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-13 01:20:24,670 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.7s Time] [2022-07-13 01:20:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-07-13 01:20:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1436. [2022-07-13 01:20:24,686 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-13 01:20:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1580 transitions. [2022-07-13 01:20:24,690 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1580 transitions. Word has length 5 [2022-07-13 01:20:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:24,690 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1580 transitions. [2022-07-13 01:20:24,690 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-13 01:20:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1580 transitions. [2022-07-13 01:20:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:20:24,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:24,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:20:24,698 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-13 01:20:24,897 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-13 01:20:24,900 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-13 01:20:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-13 01:20:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:24,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362720822] [2022-07-13 01:20:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:24,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:24,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:24,902 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-13 01:20:24,904 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-13 01:20:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:25,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:20:25,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:25,085 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-13 01:20:25,097 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-13 01:20:25,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:25,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:25,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362720822] [2022-07-13 01:20:25,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362720822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:25,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:25,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:20:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975068669] [2022-07-13 01:20:25,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:25,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:20:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:20:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:20:25,101 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-13 01:20:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:27,579 INFO L93 Difference]: Finished difference Result 1739 states and 1903 transitions. [2022-07-13 01:20:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:20:27,579 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-13 01:20:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:27,584 INFO L225 Difference]: With dead ends: 1739 [2022-07-13 01:20:27,585 INFO L226 Difference]: Without dead ends: 1739 [2022-07-13 01:20:27,585 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-13 01:20:27,586 INFO L413 NwaCegarLoop]: 1206 mSDtfsCounter, 504 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:20:27,586 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.4s Time] [2022-07-13 01:20:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-07-13 01:20:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1592. [2022-07-13 01:20:27,606 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-13 01:20:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1886 transitions. [2022-07-13 01:20:27,610 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1886 transitions. Word has length 5 [2022-07-13 01:20:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:27,610 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 1886 transitions. [2022-07-13 01:20:27,611 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-13 01:20:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1886 transitions. [2022-07-13 01:20:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:20:27,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:27,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:20:27,618 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-13 01:20:27,818 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-13 01:20:27,819 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-13 01:20:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-13 01:20:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:27,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411317040] [2022-07-13 01:20:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:27,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:27,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:27,821 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-13 01:20:27,823 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-13 01:20:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:27,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:20:27,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:27,930 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-13 01:20:27,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:27,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:27,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411317040] [2022-07-13 01:20:27,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411317040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:27,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:27,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:20:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029896157] [2022-07-13 01:20:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:27,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:20:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:20:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:20:27,932 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-13 01:20:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:27,996 INFO L93 Difference]: Finished difference Result 2936 states and 3493 transitions. [2022-07-13 01:20:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:20:28,000 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-13 01:20:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:28,008 INFO L225 Difference]: With dead ends: 2936 [2022-07-13 01:20:28,008 INFO L226 Difference]: Without dead ends: 2936 [2022-07-13 01:20:28,009 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-13 01:20:28,009 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-13 01:20:28,009 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-13 01:20:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2022-07-13 01:20:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1593. [2022-07-13 01:20:28,030 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-13 01:20:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1887 transitions. [2022-07-13 01:20:28,034 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1887 transitions. Word has length 6 [2022-07-13 01:20:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:28,034 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 1887 transitions. [2022-07-13 01:20:28,034 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-13 01:20:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1887 transitions. [2022-07-13 01:20:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:20:28,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:28,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:20:28,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 01:20:28,246 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-13 01:20:28,247 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-13 01:20:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-13 01:20:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:28,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553346726] [2022-07-13 01:20:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:28,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:28,253 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-13 01:20:28,254 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-13 01:20:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:28,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:20:28,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:28,420 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-13 01:20:28,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:28,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:28,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553346726] [2022-07-13 01:20:28,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553346726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:28,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:28,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:20:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322876620] [2022-07-13 01:20:28,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:28,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:20:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:28,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:20:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:20:28,421 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-13 01:20:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:28,448 INFO L93 Difference]: Finished difference Result 1557 states and 1850 transitions. [2022-07-13 01:20:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:20:28,449 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-13 01:20:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:28,454 INFO L225 Difference]: With dead ends: 1557 [2022-07-13 01:20:28,455 INFO L226 Difference]: Without dead ends: 1557 [2022-07-13 01:20:28,455 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-13 01:20:28,456 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-13 01:20:28,456 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-13 01:20:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2022-07-13 01:20:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1551. [2022-07-13 01:20:28,473 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-13 01:20:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1844 transitions. [2022-07-13 01:20:28,478 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1844 transitions. Word has length 11 [2022-07-13 01:20:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:28,479 INFO L495 AbstractCegarLoop]: Abstraction has 1551 states and 1844 transitions. [2022-07-13 01:20:28,479 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-13 01:20:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1844 transitions. [2022-07-13 01:20:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:20:28,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:28,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:20:28,504 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-13 01:20:28,687 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-13 01:20:28,688 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-13 01:20:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-13 01:20:28,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:28,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048061386] [2022-07-13 01:20:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:28,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:28,691 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-13 01:20:28,693 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-13 01:20:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:28,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:20:28,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:28,846 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-13 01:20:28,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:28,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048061386] [2022-07-13 01:20:28,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048061386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:28,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:28,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:20:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676049859] [2022-07-13 01:20:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:28,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:20:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:20:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:20:28,848 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-13 01:20:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:28,909 INFO L93 Difference]: Finished difference Result 1536 states and 1822 transitions. [2022-07-13 01:20:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:20:28,909 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-13 01:20:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:28,913 INFO L225 Difference]: With dead ends: 1536 [2022-07-13 01:20:28,914 INFO L226 Difference]: Without dead ends: 1536 [2022-07-13 01:20:28,914 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-13 01:20:28,915 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-13 01:20:28,915 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-13 01:20:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-07-13 01:20:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1529. [2022-07-13 01:20:28,931 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-13 01:20:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1815 transitions. [2022-07-13 01:20:28,935 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1815 transitions. Word has length 13 [2022-07-13 01:20:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:28,936 INFO L495 AbstractCegarLoop]: Abstraction has 1529 states and 1815 transitions. [2022-07-13 01:20:28,936 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-13 01:20:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1815 transitions. [2022-07-13 01:20:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:20:28,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:28,937 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-13 01:20:28,953 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-13 01:20:29,144 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-13 01:20:29,145 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-13 01:20:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-13 01:20:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:29,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714495179] [2022-07-13 01:20:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:29,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:29,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:29,148 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-13 01:20:29,148 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-13 01:20:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:29,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:20:29,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:29,277 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-13 01:20:29,313 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-13 01:20:29,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:29,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714495179] [2022-07-13 01:20:29,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714495179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:29,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:29,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:20:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60759584] [2022-07-13 01:20:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:29,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:20:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:29,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:20:29,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:20:29,317 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-13 01:20:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:31,709 INFO L93 Difference]: Finished difference Result 2173 states and 2457 transitions. [2022-07-13 01:20:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:20:31,709 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-13 01:20:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:31,715 INFO L225 Difference]: With dead ends: 2173 [2022-07-13 01:20:31,715 INFO L226 Difference]: Without dead ends: 2173 [2022-07-13 01:20:31,716 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-13 01:20:31,716 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 2585 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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-13 01:20:31,716 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-13 01:20:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2022-07-13 01:20:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1525. [2022-07-13 01:20:31,732 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-13 01:20:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1811 transitions. [2022-07-13 01:20:31,735 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1811 transitions. Word has length 27 [2022-07-13 01:20:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:31,735 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 1811 transitions. [2022-07-13 01:20:31,736 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-13 01:20:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1811 transitions. [2022-07-13 01:20:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:20:31,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:31,736 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-13 01:20:31,763 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-13 01:20:31,943 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-13 01:20:31,944 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-13 01:20:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-13 01:20:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:31,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711325349] [2022-07-13 01:20:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:31,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:31,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:31,946 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-13 01:20:31,948 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-13 01:20:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:32,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:20:32,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:32,064 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-13 01:20:32,157 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-13 01:20:32,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:32,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711325349] [2022-07-13 01:20:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711325349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:32,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:32,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:20:32,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40079333] [2022-07-13 01:20:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:32,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:20:32,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:32,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:20:32,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:20:32,160 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-13 01:20:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:35,041 INFO L93 Difference]: Finished difference Result 1908 states and 2095 transitions. [2022-07-13 01:20:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:20:35,041 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-13 01:20:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:35,046 INFO L225 Difference]: With dead ends: 1908 [2022-07-13 01:20:35,046 INFO L226 Difference]: Without dead ends: 1908 [2022-07-13 01:20:35,047 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-13 01:20:35,048 INFO L413 NwaCegarLoop]: 1070 mSDtfsCounter, 1061 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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-13 01:20:35,049 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-13 01:20:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2022-07-13 01:20:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1521. [2022-07-13 01:20:35,066 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-13 01:20:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1807 transitions. [2022-07-13 01:20:35,082 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1807 transitions. Word has length 27 [2022-07-13 01:20:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:35,082 INFO L495 AbstractCegarLoop]: Abstraction has 1521 states and 1807 transitions. [2022-07-13 01:20:35,082 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-13 01:20:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1807 transitions. [2022-07-13 01:20:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 01:20:35,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:35,083 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-13 01:20:35,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 01:20:35,310 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-13 01:20:35,311 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-13 01:20:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-13 01:20:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:35,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696844482] [2022-07-13 01:20:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:35,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:35,313 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-13 01:20:35,314 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-13 01:20:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:35,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:20:35,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:35,510 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-13 01:20:35,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:35,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:35,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696844482] [2022-07-13 01:20:35,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696844482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:35,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:35,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:20:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673086533] [2022-07-13 01:20:35,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:35,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:20:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:20:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:20:35,512 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-13 01:20:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:35,563 INFO L93 Difference]: Finished difference Result 1521 states and 1803 transitions. [2022-07-13 01:20:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:20:35,564 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-13 01:20:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:35,567 INFO L225 Difference]: With dead ends: 1521 [2022-07-13 01:20:35,568 INFO L226 Difference]: Without dead ends: 1521 [2022-07-13 01:20:35,568 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-13 01:20:35,570 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-13 01:20:35,570 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-13 01:20:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2022-07-13 01:20:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1515. [2022-07-13 01:20:35,609 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-13 01:20:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1797 transitions. [2022-07-13 01:20:35,616 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1797 transitions. Word has length 42 [2022-07-13 01:20:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:35,618 INFO L495 AbstractCegarLoop]: Abstraction has 1515 states and 1797 transitions. [2022-07-13 01:20:35,618 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-13 01:20:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1797 transitions. [2022-07-13 01:20:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 01:20:35,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:35,621 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-13 01:20:35,645 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-13 01:20:35,829 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-13 01:20:35,830 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-13 01:20:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-13 01:20:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:35,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11859814] [2022-07-13 01:20:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:35,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:35,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:35,833 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-13 01:20:35,834 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-13 01:20:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:36,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:20:36,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:36,188 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-13 01:20:36,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:36,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:36,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11859814] [2022-07-13 01:20:36,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11859814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:36,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:36,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:20:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305997045] [2022-07-13 01:20:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:36,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:20:36,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:20:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:20:36,191 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-13 01:20:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:36,391 INFO L93 Difference]: Finished difference Result 1756 states and 2047 transitions. [2022-07-13 01:20:36,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:20:36,395 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-13 01:20:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:36,400 INFO L225 Difference]: With dead ends: 1756 [2022-07-13 01:20:36,400 INFO L226 Difference]: Without dead ends: 1756 [2022-07-13 01:20:36,402 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-13 01:20:36,402 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:20:36,402 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.2s Time] [2022-07-13 01:20:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-07-13 01:20:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1561. [2022-07-13 01:20:36,432 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-13 01:20:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1843 transitions. [2022-07-13 01:20:36,434 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1843 transitions. Word has length 50 [2022-07-13 01:20:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:36,434 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1843 transitions. [2022-07-13 01:20:36,434 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-13 01:20:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1843 transitions. [2022-07-13 01:20:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 01:20:36,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:36,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:20:36,445 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-13 01:20:36,643 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-13 01:20:36,644 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-13 01:20:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-13 01:20:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:36,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841750583] [2022-07-13 01:20:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:36,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:36,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:36,664 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-13 01:20:36,668 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-13 01:20:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:36,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:20:36,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:36,988 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-13 01:20:36,992 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-13 01:20:37,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:20:37,242 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-13 01:20:37,250 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:20:37,251 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-13 01:20:37,262 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-13 01:20:37,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:37,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:37,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841750583] [2022-07-13 01:20:37,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841750583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:37,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:37,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:20:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124178702] [2022-07-13 01:20:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:37,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:20:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:37,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:20:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:20:37,264 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-13 01:20:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:39,306 INFO L93 Difference]: Finished difference Result 1530 states and 1766 transitions. [2022-07-13 01:20:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:20:39,307 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-13 01:20:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:39,311 INFO L225 Difference]: With dead ends: 1530 [2022-07-13 01:20:39,311 INFO L226 Difference]: Without dead ends: 1530 [2022-07-13 01:20:39,311 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-13 01:20:39,312 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 2001 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:20:39,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 790 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 01:20:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-07-13 01:20:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1311. [2022-07-13 01:20:39,326 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-13 01:20:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1442 transitions. [2022-07-13 01:20:39,327 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1442 transitions. Word has length 53 [2022-07-13 01:20:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:39,328 INFO L495 AbstractCegarLoop]: Abstraction has 1311 states and 1442 transitions. [2022-07-13 01:20:39,328 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-13 01:20:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1442 transitions. [2022-07-13 01:20:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:20:39,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:39,329 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-13 01:20:39,341 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-13 01:20:39,539 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-13 01:20:39,539 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-13 01:20:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-13 01:20:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:39,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077882413] [2022-07-13 01:20:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:39,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:39,542 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-13 01:20:39,543 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-13 01:20:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:39,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:20:39,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:39,765 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-13 01:20:39,774 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-13 01:20:39,793 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-13 01:20:39,802 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-13 01:20:39,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:39,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:39,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077882413] [2022-07-13 01:20:39,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077882413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:39,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:39,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:20:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255491550] [2022-07-13 01:20:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:39,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:20:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:39,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:20:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:20:39,804 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-13 01:20:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:41,996 INFO L93 Difference]: Finished difference Result 1310 states and 1441 transitions. [2022-07-13 01:20:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:20:41,996 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-13 01:20:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:42,000 INFO L225 Difference]: With dead ends: 1310 [2022-07-13 01:20:42,000 INFO L226 Difference]: Without dead ends: 1310 [2022-07-13 01:20:42,000 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-13 01:20:42,000 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 4 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:20:42,001 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.1s Time] [2022-07-13 01:20:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-07-13 01:20:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2022-07-13 01:20:42,015 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-13 01:20:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1441 transitions. [2022-07-13 01:20:42,016 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1441 transitions. Word has length 58 [2022-07-13 01:20:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:42,017 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 1441 transitions. [2022-07-13 01:20:42,017 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-13 01:20:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1441 transitions. [2022-07-13 01:20:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:20:42,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:42,021 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-13 01:20:42,037 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-13 01:20:42,230 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-13 01:20:42,230 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-13 01:20:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-13 01:20:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:42,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595657797] [2022-07-13 01:20:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:42,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:42,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:42,233 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-13 01:20:42,251 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-13 01:20:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:42,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:20:42,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:42,456 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-13 01:20:42,473 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-13 01:20:42,482 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-13 01:20:42,525 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-13 01:20:42,529 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-13 01:20:42,540 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-13 01:20:42,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:42,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595657797] [2022-07-13 01:20:42,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595657797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:42,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:42,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:20:42,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441151262] [2022-07-13 01:20:42,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:42,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:20:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:20:42,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:20:42,542 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-13 01:20:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:45,347 INFO L93 Difference]: Finished difference Result 1309 states and 1440 transitions. [2022-07-13 01:20:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:20:45,348 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-13 01:20:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:45,351 INFO L225 Difference]: With dead ends: 1309 [2022-07-13 01:20:45,351 INFO L226 Difference]: Without dead ends: 1309 [2022-07-13 01:20:45,351 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-13 01:20:45,352 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 2 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:20:45,352 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.8s Time] [2022-07-13 01:20:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2022-07-13 01:20:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2022-07-13 01:20:45,362 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-13 01:20:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1440 transitions. [2022-07-13 01:20:45,364 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1440 transitions. Word has length 58 [2022-07-13 01:20:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:45,364 INFO L495 AbstractCegarLoop]: Abstraction has 1309 states and 1440 transitions. [2022-07-13 01:20:45,364 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-13 01:20:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1440 transitions. [2022-07-13 01:20:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 01:20:45,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:45,365 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-13 01:20:45,375 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-13 01:20:45,573 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-13 01:20:45,574 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-13 01:20:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1427434238, now seen corresponding path program 1 times [2022-07-13 01:20:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:45,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554651522] [2022-07-13 01:20:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:45,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:45,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:45,577 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-13 01:20:45,583 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-13 01:20:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:45,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:20:45,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:45,845 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-13 01:20:45,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:20:45,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:45,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554651522] [2022-07-13 01:20:45,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554651522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:20:45,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:20:45,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:20:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387997371] [2022-07-13 01:20:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:20:45,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:20:45,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:20:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:20:45,849 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-13 01:20:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:45,906 INFO L93 Difference]: Finished difference Result 1312 states and 1445 transitions. [2022-07-13 01:20:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:20:45,907 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-13 01:20:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:45,913 INFO L225 Difference]: With dead ends: 1312 [2022-07-13 01:20:45,913 INFO L226 Difference]: Without dead ends: 1312 [2022-07-13 01:20:45,914 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-13 01:20:45,914 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-13 01:20:45,914 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-13 01:20:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-07-13 01:20:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2022-07-13 01:20:45,955 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-13 01:20:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1445 transitions. [2022-07-13 01:20:45,957 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1445 transitions. Word has length 66 [2022-07-13 01:20:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:45,957 INFO L495 AbstractCegarLoop]: Abstraction has 1312 states and 1445 transitions. [2022-07-13 01:20:45,957 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-13 01:20:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1445 transitions. [2022-07-13 01:20:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:20:45,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:45,958 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-13 01:20:45,970 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-13 01:20:46,158 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-13 01:20:46,158 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-13 01:20:46,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:46,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1840539799, now seen corresponding path program 1 times [2022-07-13 01:20:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:46,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322439089] [2022-07-13 01:20:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:20:46,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:46,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:46,161 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-13 01:20:46,163 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-13 01:20:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:20:46,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:20:46,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:46,402 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-13 01:20:46,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:20:46,458 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-13 01:20:46,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:46,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322439089] [2022-07-13 01:20:46,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322439089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:20:46,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:20:46,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 01:20:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775051314] [2022-07-13 01:20:46,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:20:46,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:20:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:20:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:20:46,459 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-13 01:20:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:46,617 INFO L93 Difference]: Finished difference Result 1324 states and 1463 transitions. [2022-07-13 01:20:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:20:46,617 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-13 01:20:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:46,621 INFO L225 Difference]: With dead ends: 1324 [2022-07-13 01:20:46,621 INFO L226 Difference]: Without dead ends: 1324 [2022-07-13 01:20:46,621 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-13 01:20:46,621 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-13 01:20:46,621 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-13 01:20:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-07-13 01:20:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1322. [2022-07-13 01:20:46,638 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-13 01:20:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1460 transitions. [2022-07-13 01:20:46,641 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1460 transitions. Word has length 67 [2022-07-13 01:20:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:46,641 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1460 transitions. [2022-07-13 01:20:46,642 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-13 01:20:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1460 transitions. [2022-07-13 01:20:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 01:20:46,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:46,642 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-13 01:20:46,667 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-13 01:20:46,852 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-13 01:20:46,852 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-13 01:20:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1070860606, now seen corresponding path program 2 times [2022-07-13 01:20:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:46,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014239747] [2022-07-13 01:20:46,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:20:46,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:46,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:46,855 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-13 01:20:46,857 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-13 01:20:47,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:20:47,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:20:47,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:20:47,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:47,248 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-13 01:20:47,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:20:47,382 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-13 01:20:47,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:47,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014239747] [2022-07-13 01:20:47,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014239747] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:20:47,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:20:47,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 01:20:47,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918359536] [2022-07-13 01:20:47,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:20:47,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:20:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:47,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:20:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:20:47,383 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-13 01:20:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:47,887 INFO L93 Difference]: Finished difference Result 1343 states and 1492 transitions. [2022-07-13 01:20:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 01:20:47,888 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-13 01:20:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:47,891 INFO L225 Difference]: With dead ends: 1343 [2022-07-13 01:20:47,891 INFO L226 Difference]: Without dead ends: 1339 [2022-07-13 01:20:47,892 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-13 01:20:47,892 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-13 01:20:47,892 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-13 01:20:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-13 01:20:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1331. [2022-07-13 01:20:47,907 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-13 01:20:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1472 transitions. [2022-07-13 01:20:47,909 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1472 transitions. Word has length 70 [2022-07-13 01:20:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:47,909 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1472 transitions. [2022-07-13 01:20:47,909 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-13 01:20:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1472 transitions. [2022-07-13 01:20:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 01:20:47,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:47,910 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-13 01:20:47,922 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-13 01:20:48,120 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-13 01:20:48,121 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-13 01:20:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1953798814, now seen corresponding path program 3 times [2022-07-13 01:20:48,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:48,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148735773] [2022-07-13 01:20:48,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:20:48,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:48,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:48,126 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-13 01:20:48,127 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-13 01:20:48,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 01:20:48,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:20:48,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:20:48,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:48,866 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-13 01:20:48,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:20:49,415 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-13 01:20:49,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:49,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148735773] [2022-07-13 01:20:49,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148735773] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:20:49,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:20:49,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-13 01:20:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795150382] [2022-07-13 01:20:49,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:20:49,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 01:20:49,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:49,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 01:20:49,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 01:20:49,417 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-13 01:20:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:20:52,132 INFO L93 Difference]: Finished difference Result 1373 states and 1548 transitions. [2022-07-13 01:20:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 01:20:52,133 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-13 01:20:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:20:52,142 INFO L225 Difference]: With dead ends: 1373 [2022-07-13 01:20:52,142 INFO L226 Difference]: Without dead ends: 1367 [2022-07-13 01:20:52,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 01:20:52,143 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-13 01:20:52,144 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-13 01:20:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-13 01:20:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1349. [2022-07-13 01:20:52,161 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-13 01:20:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1495 transitions. [2022-07-13 01:20:52,183 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1495 transitions. Word has length 76 [2022-07-13 01:20:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:20:52,183 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1495 transitions. [2022-07-13 01:20:52,183 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-13 01:20:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1495 transitions. [2022-07-13 01:20:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 01:20:52,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:20:52,184 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-13 01:20:52,205 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-13 01:20:52,395 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-13 01:20:52,396 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-13 01:20:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:20:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash -613669538, now seen corresponding path program 4 times [2022-07-13 01:20:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:20:52,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241213497] [2022-07-13 01:20:52,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 01:20:52,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:20:52,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:20:52,399 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-13 01:20:52,399 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-13 01:20:52,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 01:20:52,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:20:52,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:20:52,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:20:52,970 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-13 01:20:52,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:20:54,422 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-13 01:20:54,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:20:54,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241213497] [2022-07-13 01:20:54,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241213497] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:20:54,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:20:54,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-13 01:20:54,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497240890] [2022-07-13 01:20:54,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:20:54,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 01:20:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:20:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 01:20:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 01:20:54,424 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-13 01:21:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:21:03,872 INFO L93 Difference]: Finished difference Result 1429 states and 1628 transitions. [2022-07-13 01:21:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-13 01:21:03,872 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-13 01:21:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:21:03,875 INFO L225 Difference]: With dead ends: 1429 [2022-07-13 01:21:03,875 INFO L226 Difference]: Without dead ends: 1425 [2022-07-13 01:21:03,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-13 01:21:03,878 INFO L413 NwaCegarLoop]: 1275 mSDtfsCounter, 507 mSDsluCounter, 29214 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:21:03,878 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.8s Time] [2022-07-13 01:21:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2022-07-13 01:21:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1383. [2022-07-13 01:21:03,907 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-13 01:21:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1541 transitions. [2022-07-13 01:21:03,913 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1541 transitions. Word has length 88 [2022-07-13 01:21:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:21:03,913 INFO L495 AbstractCegarLoop]: Abstraction has 1383 states and 1541 transitions. [2022-07-13 01:21:03,914 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-13 01:21:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1541 transitions. [2022-07-13 01:21:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 01:21:03,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:21:03,915 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-13 01:21:03,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-13 01:21:04,125 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-13 01:21:04,126 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-13 01:21:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:21:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 97867710, now seen corresponding path program 5 times [2022-07-13 01:21:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:21:04,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405790231] [2022-07-13 01:21:04,127 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:21:04,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:21:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:21:04,128 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-13 01:21:04,167 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-13 01:21:05,369 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:21:05,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:21:05,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 01:21:05,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:21:05,435 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:21:05,435 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-13 01:21:05,679 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-13 01:21:05,679 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-13 01:21:05,740 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-13 01:21:05,846 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 43 treesize of output 25 [2022-07-13 01:21:06,337 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1576)))) is different from true [2022-07-13 01:21:06,820 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1592) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:21:06,830 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1593) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:21:07,227 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:21:07,227 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 55 treesize of output 54 [2022-07-13 01:21:07,293 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 52 treesize of output 28 [2022-07-13 01:21:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-07-13 01:21:07,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:21:07,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (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_1651) |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-13 01:21:07,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:21:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405790231] [2022-07-13 01:21:07,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405790231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:21:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [421499301] [2022-07-13 01:21:07,557 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:21:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:21:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:21:07,559 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-13 01:21:07,559 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-13 01:22:36,956 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:22:36,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:22:37,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-13 01:22:37,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:22:37,188 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 01:22:37,188 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-13 01:22:37,357 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-13 01:22:37,357 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-13 01:22:37,393 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-13 01:22:37,564 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-13 01:22:39,592 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:22:39,592 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-13 01:22:39,642 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-13 01:22:39,683 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-13 01:22:39,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:22:39,847 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-13 01:22:39,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [421499301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:22:39,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:22:39,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 19 [2022-07-13 01:22:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810454687] [2022-07-13 01:22:39,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:22:39,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 01:22:39,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:22:39,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 01:22:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=304, Unknown=28, NotChecked=200, Total=600 [2022-07-13 01:22:39,850 INFO L87 Difference]: Start difference. First operand 1383 states and 1541 transitions. Second operand has 21 states, 18 states have (on average 7.611111111111111) internal successors, (137), 20 states have internal predecessors, (137), 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-13 01:22:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:22:47,544 INFO L93 Difference]: Finished difference Result 2499 states and 2730 transitions. [2022-07-13 01:22:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 01:22:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.611111111111111) internal successors, (137), 20 states have internal predecessors, (137), 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-13 01:22:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:22:47,549 INFO L225 Difference]: With dead ends: 2499 [2022-07-13 01:22:47,549 INFO L226 Difference]: Without dead ends: 2495 [2022-07-13 01:22:47,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 118 SyntacticMatches, 88 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=184, Invalid=777, Unknown=51, NotChecked=320, Total=1332 [2022-07-13 01:22:47,549 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 1152 mSDsluCounter, 7467 mSDsCounter, 0 mSdLazyCounter, 6881 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 8200 SdHoareTripleChecker+Invalid, 14069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 6881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7152 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:22:47,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 8200 Invalid, 14069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 6881 Invalid, 0 Unknown, 7152 Unchecked, 7.0s Time] [2022-07-13 01:22:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2022-07-13 01:22:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1745. [2022-07-13 01:22:47,568 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-13 01:22:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2119 transitions. [2022-07-13 01:22:47,570 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2119 transitions. Word has length 110 [2022-07-13 01:22:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:22:47,571 INFO L495 AbstractCegarLoop]: Abstraction has 1745 states and 2119 transitions. [2022-07-13 01:22:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.611111111111111) internal successors, (137), 20 states have internal predecessors, (137), 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-13 01:22:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2119 transitions. [2022-07-13 01:22:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 01:22:47,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:22:47,572 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-13 01:22:47,586 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-13 01:22:47,817 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-13 01:22:47,986 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-13 01:22:47,986 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-13 01:22:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:22:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 97867711, now seen corresponding path program 1 times [2022-07-13 01:22:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:22:47,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148595335] [2022-07-13 01:22:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:22:47,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:22:47,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:22:47,988 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-13 01:22:47,990 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-13 01:22:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:22:48,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-13 01:22:48,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:22:48,722 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-13 01:22:48,852 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-13 01:22:48,859 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:22:48,859 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-13 01:22:48,877 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-13 01:22:48,884 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-13 01:22:48,954 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-13 01:22:48,957 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-13 01:22:48,989 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,095 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:22:49,148 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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|))) is different from true [2022-07-13 01:22:49,155 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477)))) is different from true [2022-07-13 01:22:49,162 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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)))) is different from true [2022-07-13 01:22:49,169 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:22:49,211 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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|))) is different from true [2022-07-13 01:22:49,236 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490)))) is different from true [2022-07-13 01:22:49,243 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,250 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,275 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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|))) is different from true [2022-07-13 01:22:49,282 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,289 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,332 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,375 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:22:49,436 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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|))) is different from true [2022-07-13 01:22:49,443 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:22:49,451 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,476 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,502 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,526 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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)))) is different from true [2022-07-13 01:22:49,533 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:22:49,541 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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)))) is different from true [2022-07-13 01:22:49,563 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:22:49,563 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-13 01:22:49,567 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-13 01:22:49,595 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-13 01:22:49,598 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-13 01:22:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 759 not checked. [2022-07-13 01:22:49,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:22:50,219 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-13 01:22:50,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:22:50,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148595335] [2022-07-13 01:22:50,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148595335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:22:50,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1152170225] [2022-07-13 01:22:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:22:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:22:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:22:50,236 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-13 01:22:50,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process