./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:09:06,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:09:06,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:09:06,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:09:06,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:09:06,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:09:06,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:09:06,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:09:06,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:09:06,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:09:06,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:09:06,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:09:06,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:09:06,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:09:06,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:09:06,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:09:06,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:09:06,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:09:06,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:09:06,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:09:06,886 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:09:06,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:09:06,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:09:06,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:09:06,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:09:06,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:09:06,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:09:06,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:09:06,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:09:06,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:09:06,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:09:06,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:09:06,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:09:06,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:09:06,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:09:06,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:09:06,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:09:06,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:09:06,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:09:06,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:09:06,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:09:06,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:09:06,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-13 01:09:06,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:09:06,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:09:06,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:09:06,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:09:06,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:09:06,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:09:06,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:09:06,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:09:06,929 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:09:06,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:09:06,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:09:06,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:09:06,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:09:06,930 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:09:06,930 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:09:06,931 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:09:06,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:09:06,931 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:09:06,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:09:06,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:09:06,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:09:06,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:09:06,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:09:06,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:09:06,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:09:06,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:09:06,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:09:06,933 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2022-07-13 01:09:07,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:09:07,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:09:07,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:09:07,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:09:07,181 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:09:07,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-13 01:09:07,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60482de74/5e651c340ad24b7d87aa444dd4f337c8/FLAG61a44c9ec [2022-07-13 01:09:07,807 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:09:07,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-13 01:09:07,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60482de74/5e651c340ad24b7d87aa444dd4f337c8/FLAG61a44c9ec [2022-07-13 01:09:08,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60482de74/5e651c340ad24b7d87aa444dd4f337c8 [2022-07-13 01:09:08,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:09:08,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:09:08,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:09:08,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:09:08,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:09:08,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:09:08" (1/1) ... [2022-07-13 01:09:08,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37749fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:08, skipping insertion in model container [2022-07-13 01:09:08,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:09:08" (1/1) ... [2022-07-13 01:09:08,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:09:08,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:09:08,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:09:08,959 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:09:08,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@433c4950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:08, skipping insertion in model container [2022-07-13 01:09:08,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:09:08,960 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:09:08,962 INFO L158 Benchmark]: Toolchain (without parser) took 702.98ms. Allocated memory is still 104.9MB. Free memory was 68.2MB in the beginning and 70.8MB in the end (delta: -2.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 01:09:08,963 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory is still 35.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:09:08,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 698.65ms. Allocated memory is still 104.9MB. Free memory was 68.0MB in the beginning and 71.0MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 01:09:08,965 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.20ms. Allocated memory is still 79.7MB. Free memory is still 35.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 698.65ms. Allocated memory is still 104.9MB. Free memory was 68.0MB in the beginning and 71.0MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1774]: 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/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:09:10,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:09:10,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:09:10,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:09:10,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:09:10,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:09:10,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:09:10,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:09:10,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:09:10,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:09:10,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:09:10,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:09:10,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:09:10,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:09:10,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:09:10,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:09:10,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:09:10,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:09:10,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:09:10,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:09:10,740 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:09:10,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:09:10,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:09:10,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:09:10,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:09:10,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:09:10,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:09:10,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:09:10,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:09:10,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:09:10,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:09:10,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:09:10,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:09:10,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:09:10,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:09:10,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:09:10,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:09:10,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:09:10,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:09:10,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:09:10,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:09:10,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:09:10,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-07-13 01:09:10,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:09:10,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:09:10,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:09:10,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:09:10,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:09:10,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:09:10,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:09:10,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:09:10,802 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:09:10,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:09:10,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:09:10,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:09:10,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:09:10,804 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:09:10,804 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:09:10,804 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:09:10,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:09:10,805 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:09:10,805 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:09:10,805 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:09:10,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:09:10,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:09:10,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:09:10,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:09:10,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:09:10,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:09:10,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:09:10,807 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:09:10,807 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:09:10,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:09:10,808 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2022-07-13 01:09:11,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:09:11,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:09:11,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:09:11,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:09:11,147 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:09:11,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-13 01:09:11,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae010ab9/5e24c40905094dbab48f1ba97165970b/FLAG3caedc0b9 [2022-07-13 01:09:11,746 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:09:11,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-13 01:09:11,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae010ab9/5e24c40905094dbab48f1ba97165970b/FLAG3caedc0b9 [2022-07-13 01:09:12,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae010ab9/5e24c40905094dbab48f1ba97165970b [2022-07-13 01:09:12,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:09:12,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:09:12,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:09:12,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:09:12,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:09:12,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:09:12" (1/1) ... [2022-07-13 01:09:12,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342a7a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:12, skipping insertion in model container [2022-07-13 01:09:12,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:09:12" (1/1) ... [2022-07-13 01:09:12,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:09:12,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:09:12,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:09:12,909 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:09:12,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:09:13,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:09:13,015 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:09:13,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:09:13,274 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:09:13,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13 WrapperNode [2022-07-13 01:09:13,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:09:13,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:09:13,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:09:13,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:09:13,283 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:09:13" (1/1) ... [2022-07-13 01:09:13,334 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:09:13" (1/1) ... [2022-07-13 01:09:13,363 INFO L137 Inliner]: procedures = 529, calls = 68, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 137 [2022-07-13 01:09:13,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:09:13,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:09:13,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:09:13,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:09:13,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:09:13,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:09:13,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:09:13,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:09:13,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (1/1) ... [2022-07-13 01:09:13,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:09:13,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:09:13,464 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:09:13,486 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:09:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:09:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:09:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:09:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2022-07-13 01:09:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:09:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:09:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:09:13,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:09:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 01:09:13,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 01:09:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:09:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-13 01:09:13,763 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:09:13,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:09:14,254 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:09:14,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:09:14,260 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 01:09:14,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:09:14 BoogieIcfgContainer [2022-07-13 01:09:14,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:09:14,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:09:14,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:09:14,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:09:14,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:09:12" (1/3) ... [2022-07-13 01:09:14,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa13af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:09:14, skipping insertion in model container [2022-07-13 01:09:14,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:09:13" (2/3) ... [2022-07-13 01:09:14,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa13af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:09:14, skipping insertion in model container [2022-07-13 01:09:14,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:09:14" (3/3) ... [2022-07-13 01:09:14,269 INFO L111 eAbstractionObserver]: Analyzing ICFG hostid.i [2022-07-13 01:09:14,280 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:09:14,281 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-07-13 01:09:14,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:09:14,319 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@7f020e23, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b63a905 [2022-07-13 01:09:14,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-07-13 01:09:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 92 states have internal predecessors, (102), 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:09:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:09:14,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:14,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:09:14,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:14,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-13 01:09:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:14,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022847502] [2022-07-13 01:09:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:14,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:14,349 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:09:14,371 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:09:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:14,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:09:14,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:14,578 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:09:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:09:14,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:14,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:14,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022847502] [2022-07-13 01:09:14,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022847502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:14,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:14,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:09:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107313344] [2022-07-13 01:09:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:14,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:09:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:14,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:09:14,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:09:14,666 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 92 states have internal predecessors, (102), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:09:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:14,896 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-07-13 01:09:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:09:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-13 01:09:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:14,905 INFO L225 Difference]: With dead ends: 109 [2022-07-13 01:09:14,905 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 01:09:14,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:14,909 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:14,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:09:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 01:09:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2022-07-13 01:09:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 88 states have internal predecessors, (93), 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:09:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-07-13 01:09:14,944 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 3 [2022-07-13 01:09:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:14,945 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-07-13 01:09:14,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:09:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-07-13 01:09:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:09:14,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:14,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:09:14,959 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:09:15,160 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:09:15,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-13 01:09:15,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:15,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635391537] [2022-07-13 01:09:15,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:15,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:15,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:15,171 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:09:15,173 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:09:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:15,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:09:15,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:15,286 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:09:15,297 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:09:15,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:15,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:15,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635391537] [2022-07-13 01:09:15,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635391537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:15,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:15,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:09:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279914805] [2022-07-13 01:09:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:15,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:09:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:15,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:09:15,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:09:15,303 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:09:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:15,614 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-07-13 01:09:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:09:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-13 01:09:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:15,617 INFO L225 Difference]: With dead ends: 90 [2022-07-13 01:09:15,618 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 01:09:15,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:15,619 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:15,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:09:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 01:09:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-13 01:09:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 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:09:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-13 01:09:15,626 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 3 [2022-07-13 01:09:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:15,626 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-13 01:09:15,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:09:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-13 01:09:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:09:15,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:15,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:09:15,640 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:09:15,827 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:09:15,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-07-13 01:09:15,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:15,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899286092] [2022-07-13 01:09:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:15,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:15,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:15,831 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:09:15,834 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:09:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:09:15,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:15,957 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:09:16,007 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:09:16,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:16,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:16,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899286092] [2022-07-13 01:09:16,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899286092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:16,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:16,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:09:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754382145] [2022-07-13 01:09:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:16,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:09:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:09:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:09:16,010 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:09:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:16,322 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-13 01:09:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:09:16,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:09:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:16,325 INFO L225 Difference]: With dead ends: 94 [2022-07-13 01:09:16,325 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 01:09:16,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:09:16,326 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:16,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 141 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:09:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 01:09:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-07-13 01:09:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 89 states have internal predecessors, (94), 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:09:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-07-13 01:09:16,344 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2022-07-13 01:09:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:16,344 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-07-13 01:09:16,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:09:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-07-13 01:09:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 01:09:16,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:16,346 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:16,355 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:09:16,547 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:09:16,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2022-07-13 01:09:16,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:16,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132275484] [2022-07-13 01:09:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:16,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:16,551 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:09:16,555 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:09:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:16,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:09:16,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:16,675 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:09:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:09:16,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:09:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:09:17,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132275484] [2022-07-13 01:09:17,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132275484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:09:17,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:09:17,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-13 01:09:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459196868] [2022-07-13 01:09:17,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:09:17,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:09:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:09:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:09:17,556 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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:09:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:18,888 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-07-13 01:09:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:09:18,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 10 [2022-07-13 01:09:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:18,890 INFO L225 Difference]: With dead ends: 98 [2022-07-13 01:09:18,890 INFO L226 Difference]: Without dead ends: 98 [2022-07-13 01:09:18,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:09:18,891 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 23 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:18,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 301 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 01:09:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-13 01:09:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-13 01:09:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 95 states have internal predecessors, (100), 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:09:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-07-13 01:09:18,903 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 10 [2022-07-13 01:09:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:18,903 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-07-13 01:09:18,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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:09:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-07-13 01:09:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 01:09:18,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:18,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:18,916 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:09:19,104 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:09:19,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -821954458, now seen corresponding path program 1 times [2022-07-13 01:09:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:19,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116726796] [2022-07-13 01:09:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:19,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:19,109 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:09:19,114 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:09:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:19,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:09:19,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:09:19,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:09:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:09:19,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:19,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116726796] [2022-07-13 01:09:19,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116726796] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:09:19,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:09:19,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-13 01:09:19,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957563161] [2022-07-13 01:09:19,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:09:19,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:09:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:19,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:09:19,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:09:19,392 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:09:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:19,598 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-07-13 01:09:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:09:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-13 01:09:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:19,600 INFO L225 Difference]: With dead ends: 118 [2022-07-13 01:09:19,600 INFO L226 Difference]: Without dead ends: 118 [2022-07-13 01:09:19,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-13 01:09:19,601 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:19,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 624 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:09:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-13 01:09:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-13 01:09:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 115 states have internal predecessors, (120), 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:09:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-07-13 01:09:19,608 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 25 [2022-07-13 01:09:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:19,609 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-07-13 01:09:19,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:09:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-07-13 01:09:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 01:09:19,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:19,610 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:19,624 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:09:19,819 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:09:19,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash -34072841, now seen corresponding path program 2 times [2022-07-13 01:09:19,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:19,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988976693] [2022-07-13 01:09:19,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:09:19,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:19,823 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:09:19,831 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:09:19,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 01:09:19,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:09:19,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:09:19,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:19,974 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 01:09:19,974 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-13 01:09:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 01:09:20,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:20,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:20,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988976693] [2022-07-13 01:09:20,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988976693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:20,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:20,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:09:20,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75635833] [2022-07-13 01:09:20,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:20,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:09:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:09:20,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:09:20,015 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:09:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:20,212 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-07-13 01:09:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:09:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2022-07-13 01:09:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:20,214 INFO L225 Difference]: With dead ends: 129 [2022-07-13 01:09:20,214 INFO L226 Difference]: Without dead ends: 129 [2022-07-13 01:09:20,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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:09:20,215 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:20,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 91 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:09:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-13 01:09:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2022-07-13 01:09:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 110 states have internal predecessors, (115), 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:09:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2022-07-13 01:09:20,221 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 45 [2022-07-13 01:09:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:20,222 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2022-07-13 01:09:20,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:09:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2022-07-13 01:09:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 01:09:20,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:20,223 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:20,234 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:09:20,434 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:09:20,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:20,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash -34072840, now seen corresponding path program 1 times [2022-07-13 01:09:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:20,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125057834] [2022-07-13 01:09:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:20,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:20,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:20,437 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:09:20,439 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:09:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:20,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 01:09:20,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:09:20,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:09:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:09:20,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125057834] [2022-07-13 01:09:20,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125057834] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:09:20,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:09:20,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-13 01:09:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505628041] [2022-07-13 01:09:20,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:09:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 01:09:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 01:09:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-13 01:09:20,947 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:09:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:21,384 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-07-13 01:09:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 01:09:21,387 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-13 01:09:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:21,388 INFO L225 Difference]: With dead ends: 121 [2022-07-13 01:09:21,388 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 01:09:21,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-13 01:09:21,390 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 33 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:21,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1241 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:09:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 01:09:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-13 01:09:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 118 states have internal predecessors, (123), 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:09:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-07-13 01:09:21,395 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 45 [2022-07-13 01:09:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:21,396 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-07-13 01:09:21,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:09:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-07-13 01:09:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 01:09:21,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:21,398 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:21,412 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:09:21,608 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:09:21,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2087093682, now seen corresponding path program 2 times [2022-07-13 01:09:21,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:21,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451072543] [2022-07-13 01:09:21,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:09:21,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:21,610 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:09:21,611 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:09:21,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 01:09:21,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:09:21,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:09:21,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:21,825 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-13 01:09:21,826 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 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:09:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:21,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:21,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:21,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451072543] [2022-07-13 01:09:21,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451072543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:21,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:21,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:09:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257532928] [2022-07-13 01:09:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:21,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:09:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:09:21,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:09:21,923 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:09:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:22,375 INFO L93 Difference]: Finished difference Result 161 states and 167 transitions. [2022-07-13 01:09:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:09:22,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2022-07-13 01:09:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:22,377 INFO L225 Difference]: With dead ends: 161 [2022-07-13 01:09:22,377 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 01:09:22,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:09:22,378 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 160 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:22,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 251 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:09:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 01:09:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2022-07-13 01:09:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 110 states have (on average 1.4) internal successors, (154), 136 states have internal predecessors, (154), 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:09:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2022-07-13 01:09:22,383 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 53 [2022-07-13 01:09:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:22,384 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2022-07-13 01:09:22,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:09:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2022-07-13 01:09:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 01:09:22,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:22,385 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:22,401 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:09:22,586 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:09:22,586 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:22,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1633693263, now seen corresponding path program 1 times [2022-07-13 01:09:22,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:22,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079845608] [2022-07-13 01:09:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:22,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:22,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:22,588 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:09:22,590 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:09:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:22,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:09:22,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:09:22,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-07-13 01:09:22,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:09:23,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:09:23,258 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 17 treesize of output 19 [2022-07-13 01:09:23,273 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:09:23,273 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:09:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:23,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:23,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:23,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079845608] [2022-07-13 01:09:23,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079845608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:23,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:23,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:09:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844599248] [2022-07-13 01:09:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:23,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:09:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:09:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:09:23,350 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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:09:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:23,453 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2022-07-13 01:09:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:09:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2022-07-13 01:09:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:23,454 INFO L225 Difference]: With dead ends: 140 [2022-07-13 01:09:23,454 INFO L226 Difference]: Without dead ends: 140 [2022-07-13 01:09:23,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:09:23,455 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:23,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 384 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-07-13 01:09:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-13 01:09:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-13 01:09:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 137 states have internal predecessors, (155), 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:09:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2022-07-13 01:09:23,460 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 56 [2022-07-13 01:09:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:23,460 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2022-07-13 01:09:23,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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:09:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2022-07-13 01:09:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 01:09:23,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:23,462 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:23,481 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:09:23,662 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:09:23,663 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash 895115800, now seen corresponding path program 1 times [2022-07-13 01:09:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:23,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803467533] [2022-07-13 01:09:23,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:23,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:23,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:23,667 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:09:23,669 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:09:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:23,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:09:23,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:23,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:23,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:23,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803467533] [2022-07-13 01:09:23,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803467533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:23,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:23,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:09:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212328686] [2022-07-13 01:09:23,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:23,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:09:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:09:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:09:23,910 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:09:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:24,177 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2022-07-13 01:09:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:09:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 57 [2022-07-13 01:09:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:24,178 INFO L225 Difference]: With dead ends: 163 [2022-07-13 01:09:24,179 INFO L226 Difference]: Without dead ends: 163 [2022-07-13 01:09:24,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:09:24,179 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:24,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 134 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:09:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-13 01:09:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-07-13 01:09:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 136 states have internal predecessors, (153), 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:09:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2022-07-13 01:09:24,184 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 57 [2022-07-13 01:09:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:24,184 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2022-07-13 01:09:24,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:09:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2022-07-13 01:09:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 01:09:24,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:24,186 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:24,198 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:09:24,395 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:09:24,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:24,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash 895115801, now seen corresponding path program 1 times [2022-07-13 01:09:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:24,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941260772] [2022-07-13 01:09:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:24,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:24,398 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:09:24,400 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:09:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:24,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:09:24,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:24,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:24,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:24,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941260772] [2022-07-13 01:09:24,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941260772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:24,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:24,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:09:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373771891] [2022-07-13 01:09:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:24,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:09:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:09:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:09:24,712 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:09:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:24,926 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2022-07-13 01:09:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:09:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 57 [2022-07-13 01:09:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:24,928 INFO L225 Difference]: With dead ends: 143 [2022-07-13 01:09:24,928 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 01:09:24,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:09:24,929 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 119 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:24,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 257 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:09:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 01:09:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2022-07-13 01:09:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 118 states have internal predecessors, (123), 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:09:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-07-13 01:09:24,933 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 57 [2022-07-13 01:09:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:24,934 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-07-13 01:09:24,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:09:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-07-13 01:09:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:09:24,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:24,935 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:24,951 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:09:25,147 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:09:25,147 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:25,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1978804018, now seen corresponding path program 1 times [2022-07-13 01:09:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:25,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305814199] [2022-07-13 01:09:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:25,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:25,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:25,150 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:09:25,151 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:09:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:25,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:09:25,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:25,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:25,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305814199] [2022-07-13 01:09:25,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305814199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:25,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:25,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:09:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559974126] [2022-07-13 01:09:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:25,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:09:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:09:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:09:25,430 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:09:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:25,846 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2022-07-13 01:09:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:09:25,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 58 [2022-07-13 01:09:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:25,847 INFO L225 Difference]: With dead ends: 139 [2022-07-13 01:09:25,847 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 01:09:25,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:09:25,848 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 89 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:25,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 197 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:09:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 01:09:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2022-07-13 01:09:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 129 states have internal predecessors, (141), 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:09:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-07-13 01:09:25,852 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 58 [2022-07-13 01:09:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:25,852 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-07-13 01:09:25,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:09:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-07-13 01:09:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:09:25,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:25,853 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:25,870 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:09:26,063 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:09:26,063 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1213382400, now seen corresponding path program 1 times [2022-07-13 01:09:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:26,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291509070] [2022-07-13 01:09:26,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:26,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:26,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:26,066 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:09:26,069 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:09:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:26,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 01:09:26,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:26,446 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-13 01:09:26,447 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-13 01:09:26,476 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:09:26,476 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-13 01:09:26,707 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 01:09:26,708 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 17 treesize of output 23 [2022-07-13 01:09:26,744 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:09:26,745 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:09:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:26,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:26,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291509070] [2022-07-13 01:09:26,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291509070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:26,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:26,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:09:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374902298] [2022-07-13 01:09:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:26,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:09:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:09:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:09:26,971 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:09:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:27,059 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-13 01:09:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:09:27,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2022-07-13 01:09:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:27,064 INFO L225 Difference]: With dead ends: 132 [2022-07-13 01:09:27,064 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 01:09:27,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:09:27,064 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:27,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 378 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2022-07-13 01:09:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 01:09:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-13 01:09:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 129 states have internal predecessors, (140), 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:09:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2022-07-13 01:09:27,068 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 59 [2022-07-13 01:09:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:27,069 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2022-07-13 01:09:27,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:09:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-07-13 01:09:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:09:27,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:27,070 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:27,085 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:09:27,283 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:09:27,284 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1213382399, now seen corresponding path program 1 times [2022-07-13 01:09:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:27,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891659538] [2022-07-13 01:09:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:27,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:27,287 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:09:27,289 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:09:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:27,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:09:27,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:27,608 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:09:27,608 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-13 01:09:27,640 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:09:27,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-13 01:09:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:27,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:27,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:27,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891659538] [2022-07-13 01:09:27,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891659538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:27,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:27,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:09:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313269132] [2022-07-13 01:09:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:27,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:09:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:09:27,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:09:27,676 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:09:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:27,922 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2022-07-13 01:09:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:09:27,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 59 [2022-07-13 01:09:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:27,924 INFO L225 Difference]: With dead ends: 139 [2022-07-13 01:09:27,924 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 01:09:27,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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:09:27,925 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:27,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:09:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 01:09:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-07-13 01:09:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 133 states have internal predecessors, (147), 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:09:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-13 01:09:27,928 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 59 [2022-07-13 01:09:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:27,928 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-13 01:09:27,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:09:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-13 01:09:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 01:09:27,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:27,929 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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:09:27,948 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:09:28,145 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:09:28,145 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1430304375, now seen corresponding path program 1 times [2022-07-13 01:09:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:28,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877442554] [2022-07-13 01:09:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:28,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:28,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:28,147 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:09:28,149 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:09:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:28,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 01:09:28,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:28,497 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:09:28,518 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 16 treesize of output 12 [2022-07-13 01:09:28,617 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-13 01:09:28,618 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-07-13 01:09:28,685 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 26 treesize of output 12 [2022-07-13 01:09:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:28,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:28,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:28,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877442554] [2022-07-13 01:09:28,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877442554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:28,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:28,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 01:09:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275349614] [2022-07-13 01:09:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:28,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:09:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:09:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:09:28,702 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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:09:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:29,064 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-13 01:09:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:09:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2022-07-13 01:09:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:29,065 INFO L225 Difference]: With dead ends: 134 [2022-07-13 01:09:29,066 INFO L226 Difference]: Without dead ends: 134 [2022-07-13 01:09:29,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:09:29,066 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:29,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 205 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:09:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-13 01:09:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-13 01:09:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3) internal successors, (143), 131 states have internal predecessors, (143), 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:09:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-13 01:09:29,070 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 62 [2022-07-13 01:09:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:29,070 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-13 01:09:29,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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:09:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-13 01:09:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 01:09:29,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:29,071 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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:09:29,091 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:09:29,291 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:09:29,292 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1430304376, now seen corresponding path program 1 times [2022-07-13 01:09:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185658939] [2022-07-13 01:09:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:29,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:29,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:29,294 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:09:29,294 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:09:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:29,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 01:09:29,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:29,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:09:29,744 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:09:29,777 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 16 treesize of output 12 [2022-07-13 01:09:29,791 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 16 treesize of output 12 [2022-07-13 01:09:29,865 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 21 treesize of output 23 [2022-07-13 01:09:29,876 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 19 treesize of output 21 [2022-07-13 01:09:29,929 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 7 [2022-07-13 01:09:29,933 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 27 treesize of output 9 [2022-07-13 01:09:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:29,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:29,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:29,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185658939] [2022-07-13 01:09:29,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185658939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:29,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:29,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:09:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245605519] [2022-07-13 01:09:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:29,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 01:09:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 01:09:29,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:09:29,950 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:09:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:30,360 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-13 01:09:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 01:09:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 62 [2022-07-13 01:09:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:30,362 INFO L225 Difference]: With dead ends: 133 [2022-07-13 01:09:30,362 INFO L226 Difference]: Without dead ends: 133 [2022-07-13 01:09:30,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:09:30,362 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 72 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:30,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:09:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-13 01:09:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-07-13 01:09:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 130 states have internal predecessors, (141), 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:09:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-13 01:09:30,366 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 62 [2022-07-13 01:09:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:30,366 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-13 01:09:30,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:09:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-13 01:09:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 01:09:30,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:30,367 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-13 01:09:30,381 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:09:30,575 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:09:30,575 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1064372062, now seen corresponding path program 1 times [2022-07-13 01:09:30,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:30,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569584726] [2022-07-13 01:09:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:30,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:30,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:30,578 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:09:30,580 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:09:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:31,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 01:09:31,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:31,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:09:31,061 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:09:31,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:09:31,107 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 16 treesize of output 12 [2022-07-13 01:09:31,187 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 34 treesize of output 34 [2022-07-13 01:09:31,286 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:09:31,287 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 43 treesize of output 44 [2022-07-13 01:09:31,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:09:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:31,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:31,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:31,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569584726] [2022-07-13 01:09:31,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569584726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:31,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:31,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:09:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426281254] [2022-07-13 01:09:31,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:31,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:09:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:09:31,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:09:31,404 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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:09:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:32,026 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2022-07-13 01:09:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:09:32,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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:09:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:32,028 INFO L225 Difference]: With dead ends: 154 [2022-07-13 01:09:32,028 INFO L226 Difference]: Without dead ends: 154 [2022-07-13 01:09:32,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-13 01:09:32,029 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:32,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 244 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 177 Invalid, 0 Unknown, 51 Unchecked, 0.5s Time] [2022-07-13 01:09:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-13 01:09:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2022-07-13 01:09:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 139 states have internal predecessors, (156), 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:09:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2022-07-13 01:09:32,032 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 66 [2022-07-13 01:09:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:32,032 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2022-07-13 01:09:32,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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:09:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2022-07-13 01:09:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 01:09:32,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:32,033 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-13 01:09:32,054 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:09:32,234 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:09:32,234 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:32,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1064372061, now seen corresponding path program 1 times [2022-07-13 01:09:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:32,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422898555] [2022-07-13 01:09:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:32,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:32,236 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:09:32,237 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:09:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:32,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:09:32,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:32,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:09:32,713 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:09:32,723 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:09:32,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:09:32,751 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 16 treesize of output 12 [2022-07-13 01:09:32,762 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 16 treesize of output 12 [2022-07-13 01:09:32,839 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 34 treesize of output 34 [2022-07-13 01:09:32,847 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 19 treesize of output 21 [2022-07-13 01:09:32,957 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:09:32,957 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 58 treesize of output 57 [2022-07-13 01:09:32,975 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 28 treesize of output 30 [2022-07-13 01:09:33,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:09:33,077 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 25 treesize of output 7 [2022-07-13 01:09:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:09:33,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:09:33,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:33,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422898555] [2022-07-13 01:09:33,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422898555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:09:33,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:09:33,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 01:09:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124759671] [2022-07-13 01:09:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:09:33,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:09:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:09:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:09:33,109 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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:09:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:33,802 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2022-07-13 01:09:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:09:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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:09:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:33,803 INFO L225 Difference]: With dead ends: 154 [2022-07-13 01:09:33,803 INFO L226 Difference]: Without dead ends: 154 [2022-07-13 01:09:33,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 01:09:33,803 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 104 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:33,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 210 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 01:09:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-13 01:09:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2022-07-13 01:09:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 139 states have internal predecessors, (152), 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:09:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2022-07-13 01:09:33,807 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 66 [2022-07-13 01:09:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:33,807 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2022-07-13 01:09:33,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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:09:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2022-07-13 01:09:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 01:09:33,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:33,808 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:33,823 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:09:34,015 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:09:34,015 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1328353215, now seen corresponding path program 1 times [2022-07-13 01:09:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:34,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249738996] [2022-07-13 01:09:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:34,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:34,017 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:09:34,020 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:09:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:34,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 01:09:34,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:34,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:09:34,601 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:09:34,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:09:34,634 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 16 treesize of output 12 [2022-07-13 01:09:34,716 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 34 treesize of output 34 [2022-07-13 01:09:34,810 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:09:34,810 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 43 treesize of output 44 [2022-07-13 01:09:34,895 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:09:34,895 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 43 treesize of output 44 [2022-07-13 01:09:34,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:09:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-13 01:09:35,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:09:35,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1323) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-13 01:09:35,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1323) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-13 01:09:35,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1322 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:09:35,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1322 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:09:35,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1322 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1321 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1321))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1322)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:09:35,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:09:35,224 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2022-07-13 01:09:35,229 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 3189 treesize of output 2532 [2022-07-13 01:09:35,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2528 treesize of output 2024 [2022-07-13 01:09:35,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2024 treesize of output 1548 [2022-07-13 01:09:35,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1548 treesize of output 1492 [2022-07-13 01:09:45,871 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-13 01:09:45,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2022-07-13 01:09:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 3 not checked. [2022-07-13 01:09:45,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:45,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249738996] [2022-07-13 01:09:45,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249738996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:09:45,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:09:45,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-07-13 01:09:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378461223] [2022-07-13 01:09:45,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:09:45,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 01:09:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 01:09:45,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=143, Unknown=5, NotChecked=140, Total=342 [2022-07-13 01:09:45,882 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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:09:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:47,035 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-07-13 01:09:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:09:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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 71 [2022-07-13 01:09:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:47,036 INFO L225 Difference]: With dead ends: 150 [2022-07-13 01:09:47,036 INFO L226 Difference]: Without dead ends: 150 [2022-07-13 01:09:47,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=84, Invalid=203, Unknown=5, NotChecked=170, Total=462 [2022-07-13 01:09:47,037 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 164 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:47,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 334 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 214 Invalid, 0 Unknown, 501 Unchecked, 0.6s Time] [2022-07-13 01:09:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-13 01:09:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-07-13 01:09:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 138 states have internal predecessors, (150), 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:09:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2022-07-13 01:09:47,041 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 71 [2022-07-13 01:09:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:47,042 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2022-07-13 01:09:47,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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:09:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2022-07-13 01:09:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 01:09:47,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:47,043 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:47,060 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:09:47,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:09:47,260 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:09:47,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:09:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1328353214, now seen corresponding path program 1 times [2022-07-13 01:09:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:09:47,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161322089] [2022-07-13 01:09:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:09:47,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:09:47,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:09:47,262 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:09:47,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 01:09:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:09:47,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 01:09:47,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:09:47,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:09:47,828 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:09:47,841 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:09:47,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:09:47,864 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 16 treesize of output 12 [2022-07-13 01:09:47,876 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 16 treesize of output 12 [2022-07-13 01:09:47,958 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 34 treesize of output 34 [2022-07-13 01:09:47,966 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 19 treesize of output 21 [2022-07-13 01:09:48,095 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:09:48,095 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 58 treesize of output 57 [2022-07-13 01:09:48,111 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 28 treesize of output 30 [2022-07-13 01:09:48,260 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:09:48,260 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 58 treesize of output 57 [2022-07-13 01:09:48,266 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 28 treesize of output 30 [2022-07-13 01:09:48,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:09:48,398 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 25 treesize of output 7 [2022-07-13 01:09:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-13 01:09:48,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:09:49,685 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2022-07-13 01:09:49,770 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-13 01:09:49,889 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2022-07-13 01:09:49,965 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1439) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1440)) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1439) .cse3 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-13 01:09:50,307 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1439) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1440) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1442)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1440))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1439) .cse5 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))) is different from false [2022-07-13 01:09:50,948 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1438 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1437)) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1440))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1438) .cse0 v_ArrVal_1439) .cse1 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1438 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse6 (let ((.cse9 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1437))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1438) .cse7 v_ArrVal_1439) (select (select (store .cse8 .cse7 v_ArrVal_1440) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_1442))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9)))) (bvule (bvadd .cse5 .cse6) (bvadd .cse5 (_ bv1 64) .cse6))))) is different from false [2022-07-13 01:09:51,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:09:51,024 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2022-07-13 01:09:51,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:09:51,039 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2022-07-13 01:09:51,048 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 1481 treesize of output 1238 [2022-07-13 01:09:51,061 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 6771 treesize of output 6366 [2022-07-13 01:09:51,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6362 treesize of output 5690 [2022-07-13 01:09:51,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5690 treesize of output 4570 [2022-07-13 01:09:51,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4570 treesize of output 4066 [2022-07-13 01:09:51,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4066 treesize of output 3758 [2022-07-13 01:09:51,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3758 treesize of output 3268 [2022-07-13 01:09:56,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:09:56,322 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2022-07-13 01:09:56,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:09:56,371 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2022-07-13 01:09:56,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:09:56,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1227 treesize of output 768 [2022-07-13 01:09:56,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:09:56,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:09:56,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 963 treesize of output 810 [2022-07-13 01:09:56,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 806 treesize of output 722 [2022-07-13 01:09:56,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 722 treesize of output 526 [2022-07-13 01:09:56,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 470 [2022-07-13 01:09:56,875 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 01:09:56,875 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 26 treesize of output 23 [2022-07-13 01:09:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 3 not checked. [2022-07-13 01:09:56,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:09:56,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161322089] [2022-07-13 01:09:56,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161322089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:09:56,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:09:56,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-07-13 01:09:56,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861592258] [2022-07-13 01:09:56,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:09:56,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 01:09:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:09:56,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 01:09:56,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=260, Unknown=6, NotChecked=222, Total=552 [2022-07-13 01:09:56,886 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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:09:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:09:59,851 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-07-13 01:09:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 01:09:59,852 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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 71 [2022-07-13 01:09:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:09:59,853 INFO L225 Difference]: With dead ends: 147 [2022-07-13 01:09:59,853 INFO L226 Difference]: Without dead ends: 147 [2022-07-13 01:09:59,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 118 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=80, Invalid=318, Unknown=6, NotChecked=246, Total=650 [2022-07-13 01:09:59,854 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:09:59,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 621 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 202 Invalid, 0 Unknown, 332 Unchecked, 1.8s Time] [2022-07-13 01:09:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-13 01:09:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-07-13 01:09:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.25) internal successors, (155), 143 states have internal predecessors, (155), 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:09:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2022-07-13 01:09:59,858 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 71 [2022-07-13 01:09:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:09:59,858 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2022-07-13 01:09:59,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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:09:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-07-13 01:09:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 01:09:59,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:09:59,859 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:09:59,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-13 01:10:00,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:10:00,075 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-13 01:10:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:10:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash -20716541, now seen corresponding path program 2 times [2022-07-13 01:10:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:10:00,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573398173] [2022-07-13 01:10:00,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:10:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:10:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:10:00,078 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:10:00,079 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:10:00,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:10:00,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:10:00,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 01:10:00,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:10:00,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:10:00,864 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:10:00,879 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:10:00,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:10:00,920 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 16 treesize of output 12 [2022-07-13 01:10:00,940 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 16 treesize of output 12 [2022-07-13 01:10:01,063 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 34 treesize of output 34 [2022-07-13 01:10:01,073 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 19 treesize of output 21 [2022-07-13 01:10:01,217 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:10:01,217 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 58 treesize of output 57 [2022-07-13 01:10:01,226 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 28 treesize of output 30 [2022-07-13 01:10:01,476 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:10:01,476 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 58 treesize of output 57 [2022-07-13 01:10:01,485 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 28 treesize of output 30 [2022-07-13 01:10:01,701 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:10:01,701 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 58 treesize of output 57 [2022-07-13 01:10:01,708 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 28 treesize of output 30 [2022-07-13 01:10:01,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:10:01,868 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 25 treesize of output 7 [2022-07-13 01:10:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 01:10:01,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:10:03,128 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|)))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2022-07-13 01:10:03,261 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse3 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2022-07-13 01:10:03,430 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)) (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-13 01:10:03,626 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1567)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)) (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1566) .cse0 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse4 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1566) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 (_ bv1 64) .cse4))))) is different from false [2022-07-13 01:10:03,907 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1567))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1566) .cse1 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1566) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1568)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2022-07-13 01:10:04,074 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1566) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1568)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (.cse1 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1567))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1566) .cse5 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))) is different from false [2022-07-13 01:10:04,542 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1564))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1565) .cse2 v_ArrVal_1566) (select (select (store .cse3 .cse2 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1568))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse1 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1564)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1567))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1565) .cse5 v_ArrVal_1566) .cse6 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2022-07-13 01:10:05,572 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1564))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1567))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1565) .cse1 v_ArrVal_1566) .cse2 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (let ((.cse11 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1564))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1565) .cse9 v_ArrVal_1566) (select (select (store .cse10 .cse9 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11) v_ArrVal_1568)))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11))) (.cse7 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse6 .cse7) (bvadd .cse6 (_ bv1 64) .cse7))))) is different from false [2022-07-13 01:10:07,794 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1563 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1562 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1562))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1564))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1563) .cse2 v_ArrVal_1565) .cse3 v_ArrVal_1566) (select (select (store .cse4 .cse3 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1568))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse1 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1563 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1562 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1562)) (.cse10 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse7 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse7 v_ArrVal_1564))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_1567))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1563) .cse7 v_ArrVal_1565) .cse8 v_ArrVal_1566) .cse9 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))))))))))) is different from false [2022-07-13 01:10:07,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:10:07,937 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 440 [2022-07-13 01:10:07,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:10:07,997 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 258 [2022-07-13 01:10:08,022 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 120307 treesize of output 101632 [2022-07-13 01:10:09,114 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 28239409 treesize of output 27386344 [2022-07-13 01:10:52,229 WARN L233 SmtUtils]: Spent 43.11s on a formula simplification that was a NOOP. DAG size: 2308 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:11:33,832 WARN L233 SmtUtils]: Spent 41.59s on a formula simplification that was a NOOP. DAG size: 2305 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:11:33,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27386340 treesize of output 26722852 [2022-07-13 01:12:14,051 WARN L233 SmtUtils]: Spent 40.12s on a formula simplification that was a NOOP. DAG size: 2304 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:12:14,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26722852 treesize of output 25788583 [2022-07-13 01:12:54,601 WARN L233 SmtUtils]: Spent 40.46s on a formula simplification that was a NOOP. DAG size: 2303 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:12:54,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25788583 treesize of output 24495655 [2022-07-13 01:13:34,801 WARN L233 SmtUtils]: Spent 40.09s on a formula simplification that was a NOOP. DAG size: 2302 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:13:34,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24495655 treesize of output 19289895