./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/dirname-1.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 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:49:36,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:49:36,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:49:36,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:49:36,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:49:36,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:49:36,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:49:36,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:49:36,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:49:36,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:49:36,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:49:36,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:49:36,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:49:36,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:49:36,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:49:36,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:49:36,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:49:36,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:49:36,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:49:36,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:49:36,097 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:49:36,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:49:36,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:49:36,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:49:36,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:49:36,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:49:36,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:49:36,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:49:36,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:49:36,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:49:36,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:49:36,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:49:36,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:49:36,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:49:36,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:49:36,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:49:36,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:49:36,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:49:36,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:49:36,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:49:36,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:49:36,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:49:36,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-14 12:49:36,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:49:36,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:49:36,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:49:36,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:49:36,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:49:36,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:49:36,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:49:36,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:49:36,139 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:49:36,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:49:36,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:49:36,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:49:36,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:49:36,140 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:49:36,140 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:49:36,141 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:49:36,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:49:36,141 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:49:36,141 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:49:36,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:49:36,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:49:36,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:49:36,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:49:36,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:49:36,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:49:36,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 12:49:36,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 12:49:36,143 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 -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2022-07-14 12:49:36,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:49:36,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:49:36,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:49:36,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:49:36,367 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:49:36,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-07-14 12:49:36,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df22a2670/233fe3b9d74c4fdba1a8ed51221c8300/FLAG78a129031 [2022-07-14 12:49:36,860 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:49:36,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-07-14 12:49:36,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df22a2670/233fe3b9d74c4fdba1a8ed51221c8300/FLAG78a129031 [2022-07-14 12:49:36,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df22a2670/233fe3b9d74c4fdba1a8ed51221c8300 [2022-07-14 12:49:36,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:49:36,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:49:36,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:49:36,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:49:36,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:49:36,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:36" (1/1) ... [2022-07-14 12:49:36,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f17206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:36, skipping insertion in model container [2022-07-14 12:49:36,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:36" (1/1) ... [2022-07-14 12:49:36,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:49:36,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:49:37,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:49:37,316 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-14 12:49:37,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51b7bab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:37, skipping insertion in model container [2022-07-14 12:49:37,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:49:37,319 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 12:49:37,321 INFO L158 Benchmark]: Toolchain (without parser) took 429.91ms. Allocated memory is still 96.5MB. Free memory was 60.3MB in the beginning and 64.1MB in the end (delta: -3.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 12:49:37,321 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 68.0MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 12:49:37,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.96ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 64.1MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 12:49:37,324 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.17ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 68.0MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.96ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 64.1MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1162]: 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/dirname-1.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 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:49:38,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:49:38,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:49:38,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:49:38,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:49:38,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:49:38,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:49:38,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:49:38,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:49:38,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:49:38,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:49:38,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:49:38,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:49:38,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:49:38,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:49:38,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:49:38,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:49:38,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:49:38,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:49:38,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:49:38,874 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:49:38,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:49:38,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:49:38,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:49:38,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:49:38,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:49:38,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:49:38,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:49:38,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:49:38,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:49:38,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:49:38,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:49:38,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:49:38,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:49:38,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:49:38,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:49:38,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:49:38,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:49:38,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:49:38,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:49:38,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:49:38,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:49:38,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-07-14 12:49:38,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:49:38,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:49:38,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:49:38,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:49:38,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:49:38,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:49:38,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:49:38,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:49:38,920 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:49:38,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:49:38,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:49:38,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:49:38,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:49:38,921 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:49:38,922 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:49:38,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:49:38,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:49:38,922 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:49:38,922 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 12:49:38,922 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 12:49:38,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:49:38,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:49:38,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:49:38,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:49:38,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:49:38,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:49:38,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:49:38,923 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 12:49:38,924 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 12:49:38,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 12:49:38,924 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 -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2022-07-14 12:49:39,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:49:39,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:49:39,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:49:39,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:49:39,227 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:49:39,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-07-14 12:49:39,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85f19cda/fd62dfdda5d34a738aa0d0389a04f8ce/FLAG106d65324 [2022-07-14 12:49:39,700 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:49:39,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-07-14 12:49:39,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85f19cda/fd62dfdda5d34a738aa0d0389a04f8ce/FLAG106d65324 [2022-07-14 12:49:40,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85f19cda/fd62dfdda5d34a738aa0d0389a04f8ce [2022-07-14 12:49:40,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:49:40,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:49:40,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:49:40,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:49:40,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:49:40,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b63a753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40, skipping insertion in model container [2022-07-14 12:49:40,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:49:40,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:49:40,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:49:40,463 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 12:49:40,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:49:40,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:49:40,524 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 12:49:40,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:49:40,634 INFO L208 MainTranslator]: Completed translation [2022-07-14 12:49:40,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40 WrapperNode [2022-07-14 12:49:40,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:49:40,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 12:49:40,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 12:49:40,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 12:49:40,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,715 INFO L137 Inliner]: procedures = 350, calls = 111, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 265 [2022-07-14 12:49:40,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 12:49:40,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 12:49:40,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 12:49:40,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 12:49:40,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 12:49:40,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 12:49:40,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 12:49:40,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 12:49:40,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (1/1) ... [2022-07-14 12:49:40,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:49:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 12:49:40,805 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-14 12:49:40,824 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-14 12:49:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 12:49:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 12:49:40,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 12:49:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 12:49:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-14 12:49:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 12:49:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 12:49:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2022-07-14 12:49:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 12:49:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2022-07-14 12:49:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 12:49:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 12:49:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 12:49:40,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 12:49:40,973 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 12:49:40,974 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 12:49:41,721 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 12:49:41,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 12:49:41,726 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-14 12:49:41,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:49:41 BoogieIcfgContainer [2022-07-14 12:49:41,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 12:49:41,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 12:49:41,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 12:49:41,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 12:49:41,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:49:40" (1/3) ... [2022-07-14 12:49:41,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683587e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:49:41, skipping insertion in model container [2022-07-14 12:49:41,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:49:40" (2/3) ... [2022-07-14 12:49:41,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683587e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:49:41, skipping insertion in model container [2022-07-14 12:49:41,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:49:41" (3/3) ... [2022-07-14 12:49:41,733 INFO L111 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2022-07-14 12:49:41,753 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 12:49:41,761 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2022-07-14 12:49:41,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 12:49:41,798 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@f805488, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cc054ce [2022-07-14 12:49:41,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2022-07-14 12:49:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 105 states have (on average 1.9428571428571428) internal successors, (204), 178 states have internal predecessors, (204), 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-14 12:49:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 12:49:41,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:41,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 12:49:41,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:41,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 12:49:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:41,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740037139] [2022-07-14 12:49:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:41,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:41,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:41,827 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-14 12:49:41,833 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-14 12:49:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:41,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:49:41,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:41,976 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-14 12:49:41,986 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-14 12:49:41,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:41,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740037139] [2022-07-14 12:49:41,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740037139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:41,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:41,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:49:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981979581] [2022-07-14 12:49:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:41,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:49:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:49:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:49:42,028 INFO L87 Difference]: Start difference. First operand has 181 states, 105 states have (on average 1.9428571428571428) internal successors, (204), 178 states have internal predecessors, (204), 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-14 12:49:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:42,354 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2022-07-14 12:49:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:49:42,357 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-14 12:49:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:42,363 INFO L225 Difference]: With dead ends: 189 [2022-07-14 12:49:42,364 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 12:49:42,365 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-14 12:49:42,369 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 162 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:42,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 146 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 12:49:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 12:49:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 171. [2022-07-14 12:49:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 100 states have (on average 1.85) internal successors, (185), 168 states have internal predecessors, (185), 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-14 12:49:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2022-07-14 12:49:42,403 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 3 [2022-07-14 12:49:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:42,404 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2022-07-14 12:49:42,404 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-14 12:49:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2022-07-14 12:49:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 12:49:42,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:42,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 12:49:42,413 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-14 12:49:42,611 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-14 12:49:42,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 12:49:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:42,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956574149] [2022-07-14 12:49:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:42,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:42,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:42,619 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-14 12:49:42,622 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-14 12:49:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:49:42,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:42,694 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-14 12:49:42,704 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-14 12:49:42,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:42,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:42,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956574149] [2022-07-14 12:49:42,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956574149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:42,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:42,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:49:42,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082992309] [2022-07-14 12:49:42,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:42,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:49:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:49:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:49:42,711 INFO L87 Difference]: Start difference. First operand 171 states and 187 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-14 12:49:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:43,125 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2022-07-14 12:49:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:49:43,126 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-14 12:49:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:43,127 INFO L225 Difference]: With dead ends: 170 [2022-07-14 12:49:43,127 INFO L226 Difference]: Without dead ends: 170 [2022-07-14 12:49:43,127 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-14 12:49:43,128 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:43,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 292 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 12:49:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-14 12:49:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-14 12:49:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 100 states have (on average 1.84) internal successors, (184), 167 states have internal predecessors, (184), 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-14 12:49:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2022-07-14 12:49:43,135 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 3 [2022-07-14 12:49:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:43,136 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2022-07-14 12:49:43,136 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-14 12:49:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2022-07-14 12:49:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 12:49:43,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:43,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 12:49:43,147 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-14 12:49:43,343 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-14 12:49:43,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-07-14 12:49:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:43,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465422028] [2022-07-14 12:49:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:43,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:43,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:43,346 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-14 12:49:43,348 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-14 12:49:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:43,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 12:49:43,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:43,426 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-14 12:49:43,490 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-14 12:49:43,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:43,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:43,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465422028] [2022-07-14 12:49:43,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465422028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:43,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:43,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:49:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656680773] [2022-07-14 12:49:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:43,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:49:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:43,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:49:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:49:43,493 INFO L87 Difference]: Start difference. First operand 170 states and 186 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-14 12:49:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:43,890 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-07-14 12:49:43,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:49:43,890 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-14 12:49:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:43,892 INFO L225 Difference]: With dead ends: 174 [2022-07-14 12:49:43,892 INFO L226 Difference]: Without dead ends: 174 [2022-07-14 12:49:43,892 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-14 12:49:43,893 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:43,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 291 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 12:49:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-14 12:49:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-07-14 12:49:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 169 states have internal predecessors, (186), 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-14 12:49:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2022-07-14 12:49:43,904 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 6 [2022-07-14 12:49:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:43,904 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2022-07-14 12:49:43,904 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-14 12:49:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-07-14 12:49:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 12:49:43,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:43,906 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:49:43,915 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-14 12:49:44,111 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-14 12:49:44,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2022-07-14 12:49:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017661917] [2022-07-14 12:49:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:44,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:44,113 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-14 12:49:44,114 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-14 12:49:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:44,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:49:44,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:44,234 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-14 12:49:44,324 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-14 12:49:44,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:49:45,214 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-14 12:49:45,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:45,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017661917] [2022-07-14 12:49:45,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017661917] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:49:45,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:49:45,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-14 12:49:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924853075] [2022-07-14 12:49:45,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:49:45,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 12:49:45,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 12:49:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 12:49:45,216 INFO L87 Difference]: Start difference. First operand 172 states and 188 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-14 12:49:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:48,104 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2022-07-14 12:49:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:49:48,105 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-14 12:49:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:48,106 INFO L225 Difference]: With dead ends: 178 [2022-07-14 12:49:48,106 INFO L226 Difference]: Without dead ends: 178 [2022-07-14 12:49:48,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-14 12:49:48,106 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 32 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:48,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 625 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 12:49:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-14 12:49:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-14 12:49:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.761467889908257) internal successors, (192), 175 states have internal predecessors, (192), 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-14 12:49:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions. [2022-07-14 12:49:48,111 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 10 [2022-07-14 12:49:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:48,112 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions. [2022-07-14 12:49:48,112 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-14 12:49:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2022-07-14 12:49:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 12:49:48,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:48,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:49:48,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-14 12:49:48,319 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-14 12:49:48,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2007736717, now seen corresponding path program 1 times [2022-07-14 12:49:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:48,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726840844] [2022-07-14 12:49:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:48,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:48,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:48,321 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-14 12:49:48,323 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-14 12:49:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:48,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 12:49:48,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:48,463 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-14 12:49:48,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:49:48,532 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-14 12:49:48,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:48,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726840844] [2022-07-14 12:49:48,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726840844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:49:48,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:49:48,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-14 12:49:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681436709] [2022-07-14 12:49:48,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:49:48,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 12:49:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 12:49:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 12:49:48,535 INFO L87 Difference]: Start difference. First operand 178 states and 194 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-14 12:49:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:48,751 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2022-07-14 12:49:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 12:49:48,751 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-14 12:49:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:48,752 INFO L225 Difference]: With dead ends: 198 [2022-07-14 12:49:48,752 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 12:49:48,753 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-14 12:49:48,753 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 27 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1268 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.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:48,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1268 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:49:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 12:49:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-14 12:49:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 195 states have internal predecessors, (212), 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-14 12:49:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2022-07-14 12:49:48,759 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 25 [2022-07-14 12:49:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:48,759 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2022-07-14 12:49:48,759 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-14 12:49:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2022-07-14 12:49:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 12:49:48,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:48,760 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:49:48,772 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-14 12:49:48,974 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-14 12:49:48,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:48,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1499348962, now seen corresponding path program 2 times [2022-07-14 12:49:48,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:48,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741883786] [2022-07-14 12:49:48,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 12:49:48,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:48,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:48,976 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-14 12:49:48,983 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-14 12:49:49,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 12:49:49,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:49:49,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:49:49,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:49,085 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 12:49:49,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-14 12:49:49,102 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-14 12:49:49,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:49,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741883786] [2022-07-14 12:49:49,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741883786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:49,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:49,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:49:49,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966692506] [2022-07-14 12:49:49,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:49,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:49:49,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:49:49,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:49:49,104 INFO L87 Difference]: Start difference. First operand 198 states and 214 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-14 12:49:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:49,403 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2022-07-14 12:49:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:49:49,405 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-14 12:49:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:49,406 INFO L225 Difference]: With dead ends: 209 [2022-07-14 12:49:49,406 INFO L226 Difference]: Without dead ends: 209 [2022-07-14 12:49:49,406 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-14 12:49:49,407 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 147 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:49,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 149 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 12:49:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-14 12:49:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 193. [2022-07-14 12:49:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 190 states have internal predecessors, (207), 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-14 12:49:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2022-07-14 12:49:49,411 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 45 [2022-07-14 12:49:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:49,412 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2022-07-14 12:49:49,412 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-14 12:49:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2022-07-14 12:49:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 12:49:49,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:49,413 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:49:49,424 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-14 12:49:49,622 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-14 12:49:49,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1499348961, now seen corresponding path program 1 times [2022-07-14 12:49:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:49,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801398711] [2022-07-14 12:49:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:49,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:49,624 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-14 12:49:49,625 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-14 12:49:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:49,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 12:49:49,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:49,835 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-14 12:49:49,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:49:50,018 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-14 12:49:50,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:50,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801398711] [2022-07-14 12:49:50,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801398711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:49:50,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:49:50,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-14 12:49:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69957190] [2022-07-14 12:49:50,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:49:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 12:49:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 12:49:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-14 12:49:50,019 INFO L87 Difference]: Start difference. First operand 193 states and 209 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-14 12:49:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:50,367 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2022-07-14 12:49:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 12:49:50,368 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-14 12:49:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:50,368 INFO L225 Difference]: With dead ends: 201 [2022-07-14 12:49:50,369 INFO L226 Difference]: Without dead ends: 201 [2022-07-14 12:49:50,369 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-14 12:49:50,369 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 33 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:50,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1813 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 12:49:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-14 12:49:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-14 12:49:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 198 states have internal predecessors, (215), 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-14 12:49:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 217 transitions. [2022-07-14 12:49:50,373 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 217 transitions. Word has length 45 [2022-07-14 12:49:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:50,374 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 217 transitions. [2022-07-14 12:49:50,374 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-14 12:49:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2022-07-14 12:49:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 12:49:50,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:50,375 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:49:50,385 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-14 12:49:50,591 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-14 12:49:50,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 621817561, now seen corresponding path program 2 times [2022-07-14 12:49:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:50,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113166402] [2022-07-14 12:49:50,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 12:49:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:50,594 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-14 12:49:50,595 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-14 12:49:50,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 12:49:50,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:49:50,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 12:49:50,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:50,749 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-14 12:49:50,750 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-14 12:49:50,794 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-14 12:49:50,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:50,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:50,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113166402] [2022-07-14 12:49:50,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113166402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:50,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:50,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 12:49:50,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337550945] [2022-07-14 12:49:50,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:50,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 12:49:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:50,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 12:49:50,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 12:49:50,796 INFO L87 Difference]: Start difference. First operand 201 states and 217 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-14 12:49:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:51,869 INFO L93 Difference]: Finished difference Result 321 states and 351 transitions. [2022-07-14 12:49:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 12:49:51,870 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-14 12:49:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:51,872 INFO L225 Difference]: With dead ends: 321 [2022-07-14 12:49:51,872 INFO L226 Difference]: Without dead ends: 321 [2022-07-14 12:49:51,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-14 12:49:51,872 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 436 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:51,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 483 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 12:49:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-14 12:49:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 265. [2022-07-14 12:49:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 202 states have (on average 1.6732673267326732) internal successors, (338), 262 states have internal predecessors, (338), 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-14 12:49:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 340 transitions. [2022-07-14 12:49:51,877 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 340 transitions. Word has length 53 [2022-07-14 12:49:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:51,877 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 340 transitions. [2022-07-14 12:49:51,877 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-14 12:49:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 340 transitions. [2022-07-14 12:49:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 12:49:51,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:51,878 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-14 12:49:51,887 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-14 12:49:52,078 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-14 12:49:52,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash 372982570, now seen corresponding path program 1 times [2022-07-14 12:49:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401179022] [2022-07-14 12:49:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:52,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:52,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:52,081 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-14 12:49:52,096 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-14 12:49:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:52,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 12:49:52,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:52,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 12:49:52,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 12:49:52,501 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 12 treesize of output 10 [2022-07-14 12:49:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 12:49:52,638 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-14 12:49:52,650 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:49:52,650 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-14 12:49:52,689 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-14 12:49:52,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:52,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:52,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401179022] [2022-07-14 12:49:52,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401179022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:52,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:52,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 12:49:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820224100] [2022-07-14 12:49:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:52,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 12:49:52,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 12:49:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 12:49:52,690 INFO L87 Difference]: Start difference. First operand 265 states and 340 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-14 12:49:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:52,743 INFO L93 Difference]: Finished difference Result 266 states and 341 transitions. [2022-07-14 12:49:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 12:49:52,744 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-14 12:49:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:52,745 INFO L225 Difference]: With dead ends: 266 [2022-07-14 12:49:52,745 INFO L226 Difference]: Without dead ends: 266 [2022-07-14 12:49:52,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 12:49:52,746 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 4 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:52,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 863 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 166 Unchecked, 0.0s Time] [2022-07-14 12:49:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-14 12:49:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-14 12:49:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 263 states have internal predecessors, (339), 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-14 12:49:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 341 transitions. [2022-07-14 12:49:52,750 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 341 transitions. Word has length 56 [2022-07-14 12:49:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:52,751 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 341 transitions. [2022-07-14 12:49:52,751 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-14 12:49:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 341 transitions. [2022-07-14 12:49:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 12:49:52,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:52,752 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-14 12:49:52,767 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-14 12:49:52,952 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-14 12:49:52,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1322442817, now seen corresponding path program 1 times [2022-07-14 12:49:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:52,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995046485] [2022-07-14 12:49:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:52,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:52,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:52,956 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-14 12:49:52,956 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-14 12:49:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:53,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:49:53,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:53,146 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-14 12:49:53,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:53,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:53,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995046485] [2022-07-14 12:49:53,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995046485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:53,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:53,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:49:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254781637] [2022-07-14 12:49:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:53,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:49:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:49:53,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:49:53,155 INFO L87 Difference]: Start difference. First operand 266 states and 341 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-14 12:49:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:53,505 INFO L93 Difference]: Finished difference Result 284 states and 363 transitions. [2022-07-14 12:49:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:49:53,506 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-14 12:49:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:53,507 INFO L225 Difference]: With dead ends: 284 [2022-07-14 12:49:53,507 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 12:49:53,507 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-14 12:49:53,508 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 246 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:53,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 186 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 12:49:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 12:49:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2022-07-14 12:49:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 257 states have internal predecessors, (327), 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-14 12:49:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 329 transitions. [2022-07-14 12:49:53,512 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 329 transitions. Word has length 57 [2022-07-14 12:49:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:53,513 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 329 transitions. [2022-07-14 12:49:53,513 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-14 12:49:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 329 transitions. [2022-07-14 12:49:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 12:49:53,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:53,514 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-14 12:49:53,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-14 12:49:53,722 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-14 12:49:53,723 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1322442816, now seen corresponding path program 1 times [2022-07-14 12:49:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:53,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020662121] [2022-07-14 12:49:53,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:53,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:53,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:53,725 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-14 12:49:53,725 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-14 12:49:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:53,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 12:49:53,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:53,968 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-14 12:49:53,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:53,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:53,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020662121] [2022-07-14 12:49:53,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020662121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:53,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:53,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 12:49:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711800167] [2022-07-14 12:49:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:53,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 12:49:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 12:49:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 12:49:53,971 INFO L87 Difference]: Start difference. First operand 260 states and 329 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-14 12:49:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:54,212 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-07-14 12:49:54,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 12:49:54,213 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-14 12:49:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:54,213 INFO L225 Difference]: With dead ends: 218 [2022-07-14 12:49:54,213 INFO L226 Difference]: Without dead ends: 218 [2022-07-14 12:49:54,214 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-14 12:49:54,214 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 182 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:54,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 615 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:49:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-14 12:49:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 196. [2022-07-14 12:49:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 193 states have internal predecessors, (210), 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-14 12:49:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2022-07-14 12:49:54,217 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 57 [2022-07-14 12:49:54,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:54,217 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2022-07-14 12:49:54,218 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-14 12:49:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2022-07-14 12:49:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 12:49:54,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:54,218 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-14 12:49:54,231 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-14 12:49:54,418 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-14 12:49:54,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1953963627, now seen corresponding path program 1 times [2022-07-14 12:49:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:54,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131408474] [2022-07-14 12:49:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:54,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:54,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:54,420 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-14 12:49:54,421 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-14 12:49:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:54,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:49:54,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:54,659 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-14 12:49:54,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:54,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:54,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131408474] [2022-07-14 12:49:54,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131408474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:54,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:54,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:49:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126100057] [2022-07-14 12:49:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:54,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:49:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:49:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:49:54,661 INFO L87 Difference]: Start difference. First operand 196 states and 212 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-14 12:49:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:54,831 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2022-07-14 12:49:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:49:54,831 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-14 12:49:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:54,832 INFO L225 Difference]: With dead ends: 214 [2022-07-14 12:49:54,832 INFO L226 Difference]: Without dead ends: 214 [2022-07-14 12:49:54,832 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-14 12:49:54,833 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 214 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:54,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 306 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:49:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-14 12:49:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 207. [2022-07-14 12:49:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 151 states have (on average 1.509933774834437) internal successors, (228), 204 states have internal predecessors, (228), 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-14 12:49:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2022-07-14 12:49:54,836 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 58 [2022-07-14 12:49:54,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:54,836 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2022-07-14 12:49:54,837 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-14 12:49:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2022-07-14 12:49:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 12:49:54,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:54,837 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-14 12:49:54,847 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-14 12:49:55,046 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-14 12:49:55,047 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash 443330279, now seen corresponding path program 1 times [2022-07-14 12:49:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161117211] [2022-07-14 12:49:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:55,048 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-14 12:49:55,049 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-14 12:49:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:55,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 12:49:55,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:55,440 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-14 12:49:55,441 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-14 12:49:55,460 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 12:49:55,460 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-14 12:49:55,561 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:49:55,561 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-14 12:49:55,575 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-14 12:49:55,682 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-14 12:49:55,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:55,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161117211] [2022-07-14 12:49:55,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161117211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:55,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:55,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 12:49:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923520089] [2022-07-14 12:49:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:55,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 12:49:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 12:49:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 12:49:55,683 INFO L87 Difference]: Start difference. First operand 207 states and 230 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-14 12:49:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:55,753 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-07-14 12:49:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 12:49:55,754 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-14 12:49:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:55,755 INFO L225 Difference]: With dead ends: 207 [2022-07-14 12:49:55,755 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 12:49:55,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-14 12:49:55,755 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:55,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 895 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 246 Unchecked, 0.0s Time] [2022-07-14 12:49:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 12:49:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-14 12:49:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 204 states have internal predecessors, (227), 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-14 12:49:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2022-07-14 12:49:55,758 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 59 [2022-07-14 12:49:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:55,758 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2022-07-14 12:49:55,759 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-14 12:49:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2022-07-14 12:49:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 12:49:55,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:55,759 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-14 12:49:55,775 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-14 12:49:55,963 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-14 12:49:55,963 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash 443330278, now seen corresponding path program 1 times [2022-07-14 12:49:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:55,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227877769] [2022-07-14 12:49:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:55,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:55,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:55,965 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-14 12:49:55,967 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-14 12:49:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:56,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 12:49:56,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:56,286 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 12:49:56,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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-14 12:49:56,303 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 12:49:56,303 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 14 treesize of output 19 [2022-07-14 12:49:56,314 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-14 12:49:56,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:56,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:56,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227877769] [2022-07-14 12:49:56,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227877769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:56,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:56,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:49:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105386484] [2022-07-14 12:49:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:56,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:49:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:49:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:49:56,317 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-14 12:49:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:49:56,546 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2022-07-14 12:49:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:49:56,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-14 12:49:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:49:56,548 INFO L225 Difference]: With dead ends: 214 [2022-07-14 12:49:56,548 INFO L226 Difference]: Without dead ends: 214 [2022-07-14 12:49:56,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:49:56,548 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 132 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:49:56,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 145 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:49:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-14 12:49:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2022-07-14 12:49:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 156 states have (on average 1.5) internal successors, (234), 208 states have internal predecessors, (234), 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-14 12:49:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2022-07-14 12:49:56,552 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 59 [2022-07-14 12:49:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:49:56,552 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2022-07-14 12:49:56,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-14 12:49:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2022-07-14 12:49:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 12:49:56,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:49:56,553 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-14 12:49:56,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-14 12:49:56,759 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-14 12:49:56,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:49:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:49:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash 227895600, now seen corresponding path program 1 times [2022-07-14 12:49:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:49:56,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402526975] [2022-07-14 12:49:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:49:56,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:49:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:49:56,762 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-14 12:49:56,763 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-14 12:49:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:49:57,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 12:49:57,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:49:57,139 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-14 12:49:57,164 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-14 12:49:57,247 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-14 12:49:57,248 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-14 12:49:57,288 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-14 12:49:57,299 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-14 12:49:57,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:49:57,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:49:57,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402526975] [2022-07-14 12:49:57,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402526975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:49:57,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:49:57,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 12:49:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494121] [2022-07-14 12:49:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:49:57,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 12:49:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:49:57,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 12:49:57,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 12:49:57,300 INFO L87 Difference]: Start difference. First operand 211 states and 236 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-14 12:49:59,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 12:50:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:50:00,103 INFO L93 Difference]: Finished difference Result 212 states and 235 transitions. [2022-07-14 12:50:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 12:50:00,103 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-14 12:50:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:50:00,104 INFO L225 Difference]: With dead ends: 212 [2022-07-14 12:50:00,104 INFO L226 Difference]: Without dead ends: 212 [2022-07-14 12:50:00,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-14 12:50:00,105 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-14 12:50:00,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 627 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-07-14 12:50:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-14 12:50:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2022-07-14 12:50:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 208 states have internal predecessors, (233), 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-14 12:50:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2022-07-14 12:50:00,108 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 62 [2022-07-14 12:50:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:50:00,109 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2022-07-14 12:50:00,109 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-14 12:50:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2022-07-14 12:50:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 12:50:00,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:50:00,109 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-14 12:50:00,124 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-14 12:50:00,310 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-14 12:50:00,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:50:00,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:50:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash 227895601, now seen corresponding path program 1 times [2022-07-14 12:50:00,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:50:00,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057219945] [2022-07-14 12:50:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:50:00,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:50:00,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:50:00,312 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-14 12:50:00,313 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-14 12:50:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:50:00,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 12:50:00,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:50:00,723 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 12 treesize of output 10 [2022-07-14 12:50:00,737 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-14 12:50:00,766 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-14 12:50:00,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-14 12:50:00,852 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-14 12:50:00,861 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-14 12:50:00,900 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-14 12:50:00,903 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-14 12:50:00,922 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-14 12:50:00,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:50:00,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:50:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057219945] [2022-07-14 12:50:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057219945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:50:00,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:50:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 12:50:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092381942] [2022-07-14 12:50:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:50:00,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 12:50:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:50:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 12:50:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:50:00,924 INFO L87 Difference]: Start difference. First operand 211 states and 235 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-14 12:50:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:50:01,927 INFO L93 Difference]: Finished difference Result 210 states and 233 transitions. [2022-07-14 12:50:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 12:50:01,927 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-14 12:50:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:50:01,928 INFO L225 Difference]: With dead ends: 210 [2022-07-14 12:50:01,928 INFO L226 Difference]: Without dead ends: 210 [2022-07-14 12:50:01,928 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-14 12:50:01,929 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 161 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 12:50:01,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 527 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 12:50:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-14 12:50:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-07-14 12:50:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 156 states have (on average 1.4807692307692308) internal successors, (231), 207 states have internal predecessors, (231), 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-14 12:50:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 233 transitions. [2022-07-14 12:50:01,932 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 233 transitions. Word has length 62 [2022-07-14 12:50:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:50:01,932 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 233 transitions. [2022-07-14 12:50:01,932 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-14 12:50:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 233 transitions. [2022-07-14 12:50:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 12:50:01,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:50:01,932 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-14 12:50:01,946 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-14 12:50:02,133 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-14 12:50:02,133 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:50:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:50:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash 90810075, now seen corresponding path program 1 times [2022-07-14 12:50:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:50:02,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818529621] [2022-07-14 12:50:02,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:50:02,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:50:02,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:50:02,135 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-14 12:50:02,137 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-14 12:50:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:50:02,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 12:50:02,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:50:02,551 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 12 treesize of output 10 [2022-07-14 12:50:02,582 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 12:50:02,582 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-14 12:50:02,610 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-14 12:50:02,683 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-14 12:50:02,788 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:50:02,788 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-14 12:50:02,818 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-14 12:50:02,843 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-14 12:50:02,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:50:02,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:50:02,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818529621] [2022-07-14 12:50:02,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818529621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:50:02,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:50:02,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 12:50:02,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862111545] [2022-07-14 12:50:02,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:50:02,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 12:50:02,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:50:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 12:50:02,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 12:50:02,844 INFO L87 Difference]: Start difference. First operand 210 states and 233 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-14 12:50:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:50:03,527 INFO L93 Difference]: Finished difference Result 231 states and 254 transitions. [2022-07-14 12:50:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 12:50:03,527 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-14 12:50:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:50:03,528 INFO L225 Difference]: With dead ends: 231 [2022-07-14 12:50:03,528 INFO L226 Difference]: Without dead ends: 231 [2022-07-14 12:50:03,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-14 12:50:03,529 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 195 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 12:50:03,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 428 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 210 Invalid, 0 Unknown, 80 Unchecked, 0.6s Time] [2022-07-14 12:50:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-14 12:50:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 218. [2022-07-14 12:50:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 165 states have (on average 1.4848484848484849) internal successors, (245), 215 states have internal predecessors, (245), 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-14 12:50:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2022-07-14 12:50:03,532 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 66 [2022-07-14 12:50:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:50:03,533 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2022-07-14 12:50:03,533 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-14 12:50:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2022-07-14 12:50:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 12:50:03,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:50:03,533 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-14 12:50:03,545 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-14 12:50:03,743 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-14 12:50:03,744 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:50:03,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:50:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 90810076, now seen corresponding path program 1 times [2022-07-14 12:50:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:50:03,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66817695] [2022-07-14 12:50:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:50:03,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:50:03,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:50:03,745 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-14 12:50:03,746 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-14 12:50:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:50:04,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 12:50:04,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:50:04,489 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 12 treesize of output 10 [2022-07-14 12:50:04,510 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-14 12:50:04,522 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:50:04,522 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-14 12:50:04,543 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-14 12:50:04,553 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-14 12:50:04,623 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-14 12:50:04,630 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-14 12:50:04,730 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:50:04,730 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-14 12:50:04,738 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-14 12:50:04,814 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-14 12:50:04,818 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-14 12:50:04,842 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-14 12:50:04,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:50:04,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:50:04,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66817695] [2022-07-14 12:50:04,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66817695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:50:04,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:50:04,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 12:50:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301315029] [2022-07-14 12:50:04,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:50:04,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 12:50:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:50:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 12:50:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-14 12:50:04,844 INFO L87 Difference]: Start difference. First operand 218 states and 247 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-14 12:50:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:50:06,012 INFO L93 Difference]: Finished difference Result 231 states and 251 transitions. [2022-07-14 12:50:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 12:50:06,013 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-14 12:50:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:50:06,014 INFO L225 Difference]: With dead ends: 231 [2022-07-14 12:50:06,014 INFO L226 Difference]: Without dead ends: 231 [2022-07-14 12:50:06,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-14 12:50:06,015 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 193 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 12:50:06,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 390 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 12:50:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-14 12:50:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 218. [2022-07-14 12:50:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 165 states have (on average 1.4606060606060607) internal successors, (241), 215 states have internal predecessors, (241), 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-14 12:50:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 243 transitions. [2022-07-14 12:50:06,018 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 243 transitions. Word has length 66 [2022-07-14 12:50:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:50:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 243 transitions. [2022-07-14 12:50:06,019 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-14 12:50:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 243 transitions. [2022-07-14 12:50:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 12:50:06,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:50:06,019 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-14 12:50:06,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-14 12:50:06,219 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-14 12:50:06,220 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:50:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:50:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1330037336, now seen corresponding path program 1 times [2022-07-14 12:50:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:50:06,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601917558] [2022-07-14 12:50:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:50:06,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:50:06,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:50:06,222 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-14 12:50:06,229 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-14 12:50:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:50:06,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 12:50:06,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:50:06,744 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 12 treesize of output 10 [2022-07-14 12:50:06,778 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 12:50:06,779 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-14 12:50:06,802 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-14 12:50:06,874 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-14 12:50:06,967 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:50:06,968 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-14 12:50:07,052 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:50:07,052 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-14 12:50:07,088 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-14 12:50:07,115 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-14 12:50:07,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:50:07,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1339) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-14 12:50:07,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1339 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1338))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1339)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-14 12:50:07,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1339 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1338))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1339)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-14 12:50:07,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1337 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1339 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1337))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1338)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1339)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-14 12:50:07,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 12:50:07,333 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-14 12:50:07,336 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-14 12:50:07,359 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 2052 [2022-07-14 12:50:07,369 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 2052 treesize of output 1548 [2022-07-14 12:50:07,382 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-14 12:51:09,147 INFO L356 Elim1Store]: treesize reduction -11, result has 113.6 percent of original size [2022-07-14 12:51:09,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 187 [2022-07-14 12:51:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2022-07-14 12:51:09,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:09,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601917558] [2022-07-14 12:51:09,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601917558] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:51:09,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:51:09,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-07-14 12:51:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683224712] [2022-07-14 12:51:09,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:51:09,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 12:51:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 12:51:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=164, Unknown=7, NotChecked=116, Total=342 [2022-07-14 12:51:09,541 INFO L87 Difference]: Start difference. First operand 218 states and 243 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-14 12:51:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:10,392 INFO L93 Difference]: Finished difference Result 220 states and 243 transitions. [2022-07-14 12:51:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 12:51:10,392 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-14 12:51:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:10,393 INFO L225 Difference]: With dead ends: 220 [2022-07-14 12:51:10,393 INFO L226 Difference]: Without dead ends: 220 [2022-07-14 12:51:10,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 123 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=65, Invalid=184, Unknown=7, NotChecked=124, Total=380 [2022-07-14 12:51:10,394 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 20 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 615 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:10,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1329 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 615 Unchecked, 0.7s Time] [2022-07-14 12:51:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-14 12:51:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2022-07-14 12:51:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 165 states have (on average 1.4545454545454546) internal successors, (240), 215 states have internal predecessors, (240), 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-14 12:51:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 242 transitions. [2022-07-14 12:51:10,399 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 242 transitions. Word has length 71 [2022-07-14 12:51:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:10,399 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 242 transitions. [2022-07-14 12:51:10,399 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-14 12:51:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 242 transitions. [2022-07-14 12:51:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 12:51:10,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:10,400 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-14 12:51:10,429 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-14 12:51:10,607 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-14 12:51:10,607 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-07-14 12:51:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1330037335, now seen corresponding path program 1 times [2022-07-14 12:51:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:10,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672383255] [2022-07-14 12:51:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:10,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:10,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:10,609 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-14 12:51:10,610 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-14 12:51:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:11,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 12:51:11,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:11,190 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 12 treesize of output 10 [2022-07-14 12:51:11,215 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-14 12:51:11,227 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:51:11,228 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-14 12:51:11,252 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-14 12:51:11,264 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-14 12:51:11,335 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-14 12:51:11,342 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-14 12:51:11,459 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:51:11,460 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-14 12:51:11,466 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-14 12:51:11,636 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:51:11,636 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-14 12:51:11,644 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-14 12:51:11,748 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-14 12:51:11,752 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-14 12:51:11,780 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-14 12:51:11,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:51:13,275 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem146#1.base| v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem146#1.base| v_ArrVal_1459) |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~mem146#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2022-07-14 12:51:13,384 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1459) |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 .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ 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| .cse3 v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-14 12:51:13,506 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1459) |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_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-14 12:51:13,716 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1456) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1457)) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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 ((_ sign_extend 32) (_ bv1 32)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1456) .cse3 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-14 12:51:13,838 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1457))) (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_1456) .cse1 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1456) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1457) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1459)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2022-07-14 12:51:13,961 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1455 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1454 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1454))) (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_~mem_track~0#1.base| v_ArrVal_1455) .cse2 v_ArrVal_1456) (select (select (store .cse3 .cse2 v_ArrVal_1457) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1459))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1459 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1458 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1455 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1454 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1457 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1456 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1454)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1457))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (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_1455) .cse5 v_ArrVal_1456) .cse6 v_ArrVal_1459) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1458) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2022-07-14 12:51:14,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 12:51:14,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 227 treesize of output 228 [2022-07-14 12:51:14,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 12:51:14,054 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 214 treesize of output 137 [2022-07-14 12:51:14,064 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 22257 treesize of output 18594 [2022-07-14 12:51:14,370 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 135483 treesize of output 131154 [2022-07-14 12:51:14,824 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 131150 treesize of output 119054 [2022-07-14 12:51:15,049 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 119054 treesize of output 106958 [2022-07-14 12:51:15,277 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 106958 treesize of output 91558 [2022-07-14 12:51:15,497 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 91558 treesize of output 86182 [2022-07-14 12:51:15,719 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 86182 treesize of output 71916 [2022-07-14 12:51:15,941 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 71916 treesize of output 68556