./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/memsafety/20020406-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:33:15,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:33:15,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:33:15,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:33:15,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:33:15,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:33:15,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:33:15,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:33:15,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:33:15,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:33:15,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:33:15,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:33:15,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:33:15,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:33:15,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:33:15,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:33:15,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:33:15,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:33:15,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:33:15,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:33:15,093 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:33:15,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:33:15,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:33:15,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:33:15,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:33:15,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:33:15,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:33:15,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:33:15,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:33:15,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:33:15,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:33:15,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:33:15,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:33:15,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:33:15,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:33:15,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:33:15,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:33:15,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:33:15,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:33:15,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:33:15,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:33:15,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:33:15,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:33:15,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:33:15,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:33:15,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:33:15,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:33:15,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:33:15,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:33:15,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:33:15,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:33:15,122 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:33:15,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:33:15,123 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:33:15,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:33:15,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:33:15,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:33:15,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:33:15,123 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:33:15,124 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:33:15,124 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:33:15,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:33:15,124 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:33:15,124 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:33:15,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:33:15,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:33:15,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:33:15,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:33:15,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:33:15,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:33:15,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:33:15,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:33:15,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:33:15,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2022-07-20 05:33:15,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:33:15,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:33:15,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:33:15,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:33:15,319 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:33:15,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2022-07-20 05:33:15,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08216cf8e/6b7b95a6f7244f93822733f1aca8dbb5/FLAG764a05631 [2022-07-20 05:33:15,785 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:33:15,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2022-07-20 05:33:15,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08216cf8e/6b7b95a6f7244f93822733f1aca8dbb5/FLAG764a05631 [2022-07-20 05:33:16,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08216cf8e/6b7b95a6f7244f93822733f1aca8dbb5 [2022-07-20 05:33:16,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:33:16,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:33:16,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:33:16,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:33:16,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:33:16,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:33:16" (1/1) ... [2022-07-20 05:33:16,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e8c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:16, skipping insertion in model container [2022-07-20 05:33:16,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:33:16" (1/1) ... [2022-07-20 05:33:16,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:33:16,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:33:16,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:33:16,503 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-20 05:33:16,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7713850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:16, skipping insertion in model container [2022-07-20 05:33:16,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:33:16,504 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 05:33:16,505 INFO L158 Benchmark]: Toolchain (without parser) took 405.00ms. Allocated memory is still 159.4MB. Free memory was 120.3MB in the beginning and 126.4MB in the end (delta: -6.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-20 05:33:16,506 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:33:16,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.13ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 126.4MB in the end (delta: -6.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-20 05:33:16,509 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.13ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 126.4MB in the end (delta: -6.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 897]: 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/memsafety/20020406-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:33:18,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:33:18,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:33:18,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:33:18,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:33:18,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:33:18,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:33:18,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:33:18,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:33:18,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:33:18,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:33:18,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:33:18,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:33:18,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:33:18,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:33:18,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:33:18,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:33:18,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:33:18,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:33:18,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:33:18,110 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:33:18,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:33:18,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:33:18,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:33:18,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:33:18,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:33:18,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:33:18,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:33:18,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:33:18,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:33:18,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:33:18,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:33:18,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:33:18,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:33:18,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:33:18,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:33:18,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:33:18,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:33:18,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:33:18,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:33:18,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:33:18,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:33:18,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:33:18,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:33:18,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:33:18,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:33:18,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:33:18,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:33:18,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:33:18,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:33:18,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:33:18,157 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:33:18,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:33:18,158 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:33:18,158 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:33:18,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:33:18,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:33:18,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:33:18,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:33:18,164 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:33:18,164 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:33:18,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:33:18,164 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:33:18,164 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:33:18,164 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:33:18,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:33:18,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:33:18,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:33:18,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:33:18,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:33:18,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:33:18,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:33:18,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:33:18,166 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:33:18,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:33:18,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:33:18,167 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2022-07-20 05:33:18,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:33:18,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:33:18,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:33:18,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:33:18,464 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:33:18,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2022-07-20 05:33:18,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d99f80/20e7adcb9b4949e19fbe4584640e470e/FLAGeb20b5b36 [2022-07-20 05:33:19,014 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:33:19,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2022-07-20 05:33:19,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d99f80/20e7adcb9b4949e19fbe4584640e470e/FLAGeb20b5b36 [2022-07-20 05:33:19,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d99f80/20e7adcb9b4949e19fbe4584640e470e [2022-07-20 05:33:19,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:33:19,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:33:19,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:33:19,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:33:19,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:33:19,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:19,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3984ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19, skipping insertion in model container [2022-07-20 05:33:19,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:19,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:33:19,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:33:19,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:33:19,764 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 05:33:19,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:33:19,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:33:19,826 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:33:19,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:33:19,928 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:33:19,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19 WrapperNode [2022-07-20 05:33:19,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:33:19,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:33:19,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:33:19,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:33:19,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:19,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:19,989 INFO L137 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-07-20 05:33:19,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:33:19,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:33:19,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:33:19,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:33:19,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:19,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:20,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:20,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:20,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:20,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:20,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:20,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:33:20,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:33:20,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:33:20,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:33:20,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (1/1) ... [2022-07-20 05:33:20,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:33:20,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:33:20,067 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-20 05:33:20,088 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-20 05:33:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2022-07-20 05:33:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2022-07-20 05:33:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:33:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:33:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:33:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2022-07-20 05:33:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2022-07-20 05:33:20,099 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2022-07-20 05:33:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2022-07-20 05:33:20,099 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2022-07-20 05:33:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2022-07-20 05:33:20,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:33:20,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:33:20,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 05:33:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2022-07-20 05:33:20,100 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2022-07-20 05:33:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2022-07-20 05:33:20,100 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2022-07-20 05:33:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:33:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:33:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:33:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2022-07-20 05:33:20,101 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2022-07-20 05:33:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2022-07-20 05:33:20,101 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2022-07-20 05:33:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:33:20,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:33:20,257 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:33:20,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:33:20,787 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:33:20,794 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:33:20,794 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 05:33:20,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:33:20 BoogieIcfgContainer [2022-07-20 05:33:20,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:33:20,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:33:20,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:33:20,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:33:20,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:33:19" (1/3) ... [2022-07-20 05:33:20,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8354418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:33:20, skipping insertion in model container [2022-07-20 05:33:20,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:33:19" (2/3) ... [2022-07-20 05:33:20,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8354418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:33:20, skipping insertion in model container [2022-07-20 05:33:20,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:33:20" (3/3) ... [2022-07-20 05:33:20,802 INFO L111 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2022-07-20 05:33:20,812 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:33:20,813 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-07-20 05:33:20,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:33:20,858 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@3534433, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75a89312 [2022-07-20 05:33:20,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-07-20 05:33:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:33:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:33:20,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:20,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:33:20,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 228226931, now seen corresponding path program 1 times [2022-07-20 05:33:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230130092] [2022-07-20 05:33:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:20,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:20,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:20,923 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-20 05:33:20,948 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-20 05:33:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:21,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:33:21,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:21,132 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-20 05:33:21,145 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-20 05:33:21,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:21,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:21,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230130092] [2022-07-20 05:33:21,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230130092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:21,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:21,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:33:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245987269] [2022-07-20 05:33:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:21,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:33:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:21,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:33:21,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:33:21,173 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:21,398 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2022-07-20 05:33:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:33:21,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 05:33:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:21,406 INFO L225 Difference]: With dead ends: 182 [2022-07-20 05:33:21,406 INFO L226 Difference]: Without dead ends: 180 [2022-07-20 05:33:21,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:33:21,411 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:21,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 344 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:33:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-20 05:33:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-07-20 05:33:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:33:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2022-07-20 05:33:21,450 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2022-07-20 05:33:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:21,450 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2022-07-20 05:33:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2022-07-20 05:33:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:33:21,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:21,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:33:21,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 05:33:21,657 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-20 05:33:21,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:21,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 228226932, now seen corresponding path program 1 times [2022-07-20 05:33:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:21,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991061400] [2022-07-20 05:33:21,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:21,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:21,673 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-20 05:33:21,675 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-20 05:33:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:21,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:33:21,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:21,733 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-20 05:33:21,740 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-20 05:33:21,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:21,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:21,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991061400] [2022-07-20 05:33:21,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991061400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:21,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:21,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:33:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015317760] [2022-07-20 05:33:21,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:21,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:33:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:21,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:33:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:33:21,745 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:21,960 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2022-07-20 05:33:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:33:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 05:33:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:21,963 INFO L225 Difference]: With dead ends: 184 [2022-07-20 05:33:21,963 INFO L226 Difference]: Without dead ends: 184 [2022-07-20 05:33:21,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:33:21,964 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:21,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:33:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-20 05:33:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-07-20 05:33:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:33:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2022-07-20 05:33:21,976 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2022-07-20 05:33:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:21,977 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2022-07-20 05:33:21,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2022-07-20 05:33:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:33:21,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:21,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:21,998 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-20 05:33:22,184 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-20 05:33:22,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash 282747829, now seen corresponding path program 1 times [2022-07-20 05:33:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:22,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450382762] [2022-07-20 05:33:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:22,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:22,187 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-20 05:33:22,188 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-20 05:33:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:22,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:33:22,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:22,285 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-20 05:33:22,291 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-20 05:33:22,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:22,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:33:22,354 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:33:22,355 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-20 05:33:22,366 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-20 05:33:22,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:22,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450382762] [2022-07-20 05:33:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450382762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:22,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:22,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:33:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723092554] [2022-07-20 05:33:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:33:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:33:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:33:22,370 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:22,557 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2022-07-20 05:33:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:33:22,558 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:33:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:22,559 INFO L225 Difference]: With dead ends: 177 [2022-07-20 05:33:22,559 INFO L226 Difference]: Without dead ends: 177 [2022-07-20 05:33:22,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-20 05:33:22,560 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 33 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:22,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 342 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:33:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-20 05:33:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2022-07-20 05:33:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:33:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2022-07-20 05:33:22,568 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2022-07-20 05:33:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:22,569 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2022-07-20 05:33:22,569 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2022-07-20 05:33:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:33:22,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:22,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:22,576 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-20 05:33:22,776 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-20 05:33:22,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1865414411, now seen corresponding path program 1 times [2022-07-20 05:33:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:22,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407280750] [2022-07-20 05:33:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:22,782 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-20 05:33:22,783 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-20 05:33:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:22,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:33:22,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:22,899 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-20 05:33:22,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:33:22,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:33:22,936 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-20 05:33:22,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:22,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:22,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407280750] [2022-07-20 05:33:22,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407280750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:22,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:22,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:33:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113269332] [2022-07-20 05:33:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:22,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:33:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:22,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:33:22,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:33:22,938 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:23,366 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2022-07-20 05:33:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:33:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:33:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:23,369 INFO L225 Difference]: With dead ends: 186 [2022-07-20 05:33:23,369 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 05:33:23,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:33:23,370 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 28 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:23,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 811 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:33:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 05:33:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2022-07-20 05:33:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:33:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2022-07-20 05:33:23,378 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2022-07-20 05:33:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:23,378 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2022-07-20 05:33:23,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2022-07-20 05:33:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:33:23,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:23,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:23,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:33:23,591 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-20 05:33:23,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:23,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1993271845, now seen corresponding path program 1 times [2022-07-20 05:33:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:23,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544803858] [2022-07-20 05:33:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:23,594 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-20 05:33:23,599 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-20 05:33:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:23,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:33:23,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:23,711 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 10 treesize of output 9 [2022-07-20 05:33:23,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:33:23,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:33:23,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:33:23,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:33:23,829 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-20 05:33:23,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:23,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:23,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544803858] [2022-07-20 05:33:23,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544803858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:23,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:23,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:33:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729640275] [2022-07-20 05:33:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:23,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:33:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:23,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:33:23,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:33:23,831 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:24,393 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2022-07-20 05:33:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:33:24,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:33:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:24,395 INFO L225 Difference]: With dead ends: 197 [2022-07-20 05:33:24,395 INFO L226 Difference]: Without dead ends: 197 [2022-07-20 05:33:24,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:33:24,396 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 50 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:24,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1053 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:33:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-20 05:33:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2022-07-20 05:33:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:33:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2022-07-20 05:33:24,403 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2022-07-20 05:33:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:24,403 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2022-07-20 05:33:24,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:33:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2022-07-20 05:33:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:33:24,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:24,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:24,424 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-20 05:33:24,611 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-20 05:33:24,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 335042805, now seen corresponding path program 1 times [2022-07-20 05:33:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:24,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131360153] [2022-07-20 05:33:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:24,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:24,614 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-20 05:33:24,615 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-20 05:33:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:24,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:33:24,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:24,775 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-20 05:33:24,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:24,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:24,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131360153] [2022-07-20 05:33:24,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131360153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:24,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:24,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:33:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212483584] [2022-07-20 05:33:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:24,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:33:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:33:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:33:24,777 INFO L87 Difference]: Start difference. First operand 190 states and 226 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-20 05:33:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:24,912 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2022-07-20 05:33:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:33:24,913 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 21 [2022-07-20 05:33:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:24,915 INFO L225 Difference]: With dead ends: 209 [2022-07-20 05:33:24,915 INFO L226 Difference]: Without dead ends: 203 [2022-07-20 05:33:24,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:33:24,915 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 43 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:24,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 757 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:33:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-20 05:33:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2022-07-20 05:33:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 156 states have internal predecessors, (164), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-07-20 05:33:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2022-07-20 05:33:24,925 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 21 [2022-07-20 05:33:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:24,925 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2022-07-20 05:33:24,925 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-20 05:33:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2022-07-20 05:33:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:33:24,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:24,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:24,951 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-20 05:33:25,136 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-20 05:33:25,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 370721495, now seen corresponding path program 1 times [2022-07-20 05:33:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:25,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616184781] [2022-07-20 05:33:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:25,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:25,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:25,141 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-20 05:33:25,144 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-20 05:33:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:25,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:33:25,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:33:25,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:33:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:33:25,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:25,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616184781] [2022-07-20 05:33:25,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616184781] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:33:25,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:33:25,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-20 05:33:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820833254] [2022-07-20 05:33:25,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:33:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:33:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:33:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:33:25,469 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:33:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:25,912 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2022-07-20 05:33:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:33:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-20 05:33:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:25,914 INFO L225 Difference]: With dead ends: 246 [2022-07-20 05:33:25,914 INFO L226 Difference]: Without dead ends: 234 [2022-07-20 05:33:25,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:33:25,915 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 153 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:25,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1351 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:33:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-20 05:33:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2022-07-20 05:33:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 127 states have (on average 1.4960629921259843) internal successors, (190), 173 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-07-20 05:33:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2022-07-20 05:33:25,922 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 22 [2022-07-20 05:33:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:25,922 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2022-07-20 05:33:25,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:33:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2022-07-20 05:33:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:33:25,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:25,923 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:25,934 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-20 05:33:26,130 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-20 05:33:26,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:26,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash -843792011, now seen corresponding path program 2 times [2022-07-20 05:33:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:26,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839414887] [2022-07-20 05:33:26,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:33:26,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:26,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:26,134 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-20 05:33:26,135 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-20 05:33:26,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:33:26,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:33:26,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:33:26,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 05:33:26,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:26,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839414887] [2022-07-20 05:33:26,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839414887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:26,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:26,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:33:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027289480] [2022-07-20 05:33:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:26,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:33:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:33:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:33:26,270 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.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-20 05:33:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:26,611 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2022-07-20 05:33:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:33:26,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.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 25 [2022-07-20 05:33:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:26,613 INFO L225 Difference]: With dead ends: 214 [2022-07-20 05:33:26,613 INFO L226 Difference]: Without dead ends: 214 [2022-07-20 05:33:26,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:33:26,614 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 23 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:26,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 756 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:33:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-20 05:33:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-07-20 05:33:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-07-20 05:33:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2022-07-20 05:33:26,620 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 25 [2022-07-20 05:33:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:26,620 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2022-07-20 05:33:26,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.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-20 05:33:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2022-07-20 05:33:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:33:26,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:26,621 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:26,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-20 05:33:26,828 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-20 05:33:26,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash -843792010, now seen corresponding path program 1 times [2022-07-20 05:33:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:26,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187674442] [2022-07-20 05:33:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:26,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:26,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:26,855 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-20 05:33:26,856 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-20 05:33:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:26,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:33:26,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:33:27,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:33:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:33:27,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:27,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187674442] [2022-07-20 05:33:27,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187674442] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:33:27,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:33:27,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-20 05:33:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122242017] [2022-07-20 05:33:27,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:33:27,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:33:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:33:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:33:27,413 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:33:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:28,445 INFO L93 Difference]: Finished difference Result 285 states and 358 transitions. [2022-07-20 05:33:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:33:28,446 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-20 05:33:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:28,447 INFO L225 Difference]: With dead ends: 285 [2022-07-20 05:33:28,447 INFO L226 Difference]: Without dead ends: 267 [2022-07-20 05:33:28,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2022-07-20 05:33:28,448 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 231 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:28,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1817 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:33:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-20 05:33:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 222. [2022-07-20 05:33:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 179 states have internal predecessors, (193), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-20 05:33:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2022-07-20 05:33:28,455 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 25 [2022-07-20 05:33:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:28,455 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2022-07-20 05:33:28,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:33:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2022-07-20 05:33:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:33:28,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:28,456 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:28,464 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-20 05:33:28,663 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-20 05:33:28,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 168356342, now seen corresponding path program 2 times [2022-07-20 05:33:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:28,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368558847] [2022-07-20 05:33:28,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:33:28,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:28,676 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-20 05:33:28,678 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-20 05:33:28,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:33:28,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:33:28,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:33:28,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-20 05:33:28,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:33:28,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:28,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368558847] [2022-07-20 05:33:28,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368558847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:33:28,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:33:28,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:33:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840615106] [2022-07-20 05:33:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:33:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:33:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:33:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:33:28,940 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-20 05:33:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:29,250 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2022-07-20 05:33:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:33:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 29 [2022-07-20 05:33:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:29,251 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:33:29,252 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 05:33:29,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:33:29,252 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 26 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:29,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 809 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:33:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 05:33:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-07-20 05:33:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 177 states have internal predecessors, (191), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-20 05:33:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2022-07-20 05:33:29,257 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 29 [2022-07-20 05:33:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:29,257 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2022-07-20 05:33:29,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-20 05:33:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2022-07-20 05:33:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:33:29,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:29,258 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:29,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:33:29,458 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-20 05:33:29,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 924079462, now seen corresponding path program 1 times [2022-07-20 05:33:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:29,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073128661] [2022-07-20 05:33:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:29,461 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-20 05:33:29,462 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-20 05:33:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:29,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:33:29,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:29,693 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-20 05:33:29,718 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:33:29,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 05:33:29,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:33:29,848 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:29,848 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 37 treesize of output 35 [2022-07-20 05:33:29,869 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:29,869 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 37 treesize of output 35 [2022-07-20 05:33:29,889 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:29,889 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 37 treesize of output 35 [2022-07-20 05:33:29,930 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:29,930 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 37 treesize of output 35 [2022-07-20 05:33:29,951 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:29,952 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 37 treesize of output 35 [2022-07-20 05:33:29,970 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:29,970 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 37 treesize of output 35 [2022-07-20 05:33:30,003 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:30,004 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 37 treesize of output 35 [2022-07-20 05:33:30,044 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:30,044 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 34 treesize of output 35 [2022-07-20 05:33:30,154 INFO L356 Elim1Store]: treesize reduction 296, result has 10.6 percent of original size [2022-07-20 05:33:30,154 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 4 case distinctions, treesize of input 48 treesize of output 53 [2022-07-20 05:33:30,232 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-20 05:33:30,233 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 4 case distinctions, treesize of input 50 treesize of output 55 [2022-07-20 05:33:30,304 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 31 treesize of output 13 [2022-07-20 05:33:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:33:30,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:33:31,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 05:33:31,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-20 05:33:31,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:33:31,705 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 24 treesize of output 25 [2022-07-20 05:33:31,708 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 28 [2022-07-20 05:33:31,711 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 13 treesize of output 9 [2022-07-20 05:33:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 8 not checked. [2022-07-20 05:33:35,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:33:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073128661] [2022-07-20 05:33:35,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073128661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:33:35,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:33:35,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-07-20 05:33:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566675966] [2022-07-20 05:33:35,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:33:35,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:33:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:33:35,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:33:35,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=287, Unknown=4, NotChecked=70, Total=420 [2022-07-20 05:33:35,797 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:33:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:33:36,708 INFO L93 Difference]: Finished difference Result 219 states and 265 transitions. [2022-07-20 05:33:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:33:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 05:33:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:33:36,709 INFO L225 Difference]: With dead ends: 219 [2022-07-20 05:33:36,709 INFO L226 Difference]: Without dead ends: 219 [2022-07-20 05:33:36,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=91, Invalid=419, Unknown=4, NotChecked=86, Total=600 [2022-07-20 05:33:36,710 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 30 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:33:36,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2138 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 495 Invalid, 0 Unknown, 394 Unchecked, 0.7s Time] [2022-07-20 05:33:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-20 05:33:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-07-20 05:33:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 176 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-20 05:33:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 265 transitions. [2022-07-20 05:33:36,716 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 265 transitions. Word has length 30 [2022-07-20 05:33:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:33:36,716 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 265 transitions. [2022-07-20 05:33:36,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:33:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 265 transitions. [2022-07-20 05:33:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:33:36,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:33:36,717 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:33:36,728 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-20 05:33:36,917 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-20 05:33:36,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:33:36,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:33:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash 924079463, now seen corresponding path program 1 times [2022-07-20 05:33:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:33:36,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826181007] [2022-07-20 05:33:36,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:33:36,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:33:36,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:33:36,919 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-20 05:33:36,921 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-20 05:33:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:33:37,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 05:33:37,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:33:37,150 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-20 05:33:37,168 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:33:37,168 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-20 05:33:37,171 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 10 treesize of output 9 [2022-07-20 05:33:37,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:33:37,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:33:37,330 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:33:37,331 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 16 treesize of output 22 [2022-07-20 05:33:37,338 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 7 treesize of output 3 [2022-07-20 05:33:37,352 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,352 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 41 treesize of output 39 [2022-07-20 05:33:37,386 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,387 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 41 treesize of output 39 [2022-07-20 05:33:37,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,400 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 16 treesize of output 18 [2022-07-20 05:33:37,415 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,415 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 41 treesize of output 39 [2022-07-20 05:33:37,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,428 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 16 treesize of output 18 [2022-07-20 05:33:37,444 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,444 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 41 treesize of output 39 [2022-07-20 05:33:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,457 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 16 treesize of output 18 [2022-07-20 05:33:37,474 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:33:37,474 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 16 treesize of output 22 [2022-07-20 05:33:37,479 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 7 treesize of output 3 [2022-07-20 05:33:37,493 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,494 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 41 treesize of output 39 [2022-07-20 05:33:37,527 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,528 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 41 treesize of output 39 [2022-07-20 05:33:37,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,540 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 16 treesize of output 18 [2022-07-20 05:33:37,556 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,556 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 41 treesize of output 39 [2022-07-20 05:33:37,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,569 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 16 treesize of output 18 [2022-07-20 05:33:37,586 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:33:37,586 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 50 treesize of output 49 [2022-07-20 05:33:37,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:33:37,695 INFO L356 Elim1Store]: treesize reduction 296, result has 10.6 percent of original size [2022-07-20 05:33:37,695 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 4 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 05:33:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-07-20 05:33:37,789 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-20 05:33:37,789 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 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-20 05:33:37,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:33:37,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-07-20 05:33:37,908 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 31 treesize of output 13 [2022-07-20 05:33:37,911 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 19 treesize of output 7 [2022-07-20 05:33:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:33:37,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:34:04,250 WARN L233 SmtUtils]: Spent 26.13s on a formula simplification that was a NOOP. DAG size: 194 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-20 05:34:08,667 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:34:08,668 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 48 treesize of output 1 [2022-07-20 05:34:08,673 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:34:08,674 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 45 treesize of output 1 [2022-07-20 05:34:09,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:34:09,592 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 45 treesize of output 36 [2022-07-20 05:34:09,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-07-20 05:34:09,599 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 19 treesize of output 11 [2022-07-20 05:34:09,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:34:09,614 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:34:09,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:34:09,626 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 05:34:09,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:34:09,631 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 33 treesize of output 21 [2022-07-20 05:34:09,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:34:09,636 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 24 treesize of output 12 [2022-07-20 05:34:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:34:09,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:34:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826181007] [2022-07-20 05:34:09,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826181007] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:34:09,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:34:09,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-07-20 05:34:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382212781] [2022-07-20 05:34:09,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:34:09,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:34:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:34:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:34:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=360, Unknown=5, NotChecked=0, Total=420 [2022-07-20 05:34:09,826 INFO L87 Difference]: Start difference. First operand 219 states and 265 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:34:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:34:12,470 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2022-07-20 05:34:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:34:12,471 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 05:34:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:34:12,472 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:34:12,472 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 05:34:12,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=144, Invalid=843, Unknown=5, NotChecked=0, Total=992 [2022-07-20 05:34:12,472 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 37 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:34:12,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2237 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 688 Invalid, 0 Unknown, 137 Unchecked, 1.8s Time] [2022-07-20 05:34:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 05:34:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2022-07-20 05:34:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 175 states have internal predecessors, (189), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-20 05:34:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2022-07-20 05:34:12,477 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 30 [2022-07-20 05:34:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:34:12,477 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2022-07-20 05:34:12,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:34:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2022-07-20 05:34:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:34:12,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:34:12,478 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:34:12,503 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-20 05:34:12,689 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-20 05:34:12,689 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:34:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:34:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2092985884, now seen corresponding path program 1 times [2022-07-20 05:34:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:34:12,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700946885] [2022-07-20 05:34:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:34:12,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:34:12,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:34:12,692 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-20 05:34:12,693 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-20 05:34:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:34:12,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:34:12,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:34:12,913 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 10 treesize of output 9 [2022-07-20 05:34:12,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:34:12,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:34:12,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:34:12,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:34:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-20 05:34:13,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:34:13,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:34:13,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700946885] [2022-07-20 05:34:13,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700946885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:34:13,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:34:13,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:34:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626828438] [2022-07-20 05:34:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:34:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:34:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:34:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:34:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:34:13,018 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:34:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:34:13,609 INFO L93 Difference]: Finished difference Result 230 states and 271 transitions. [2022-07-20 05:34:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:34:13,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-07-20 05:34:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:34:13,611 INFO L225 Difference]: With dead ends: 230 [2022-07-20 05:34:13,611 INFO L226 Difference]: Without dead ends: 218 [2022-07-20 05:34:13,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:34:13,611 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 51 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:34:13,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 902 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:34:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-20 05:34:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2022-07-20 05:34:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.376923076923077) internal successors, (179), 170 states have internal predecessors, (179), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:34:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2022-07-20 05:34:13,616 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 42 [2022-07-20 05:34:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:34:13,616 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2022-07-20 05:34:13,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:34:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2022-07-20 05:34:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 05:34:13,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:34:13,617 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:34:13,642 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-20 05:34:13,831 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-20 05:34:13,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:34:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:34:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -562772518, now seen corresponding path program 1 times [2022-07-20 05:34:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:34:13,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161594409] [2022-07-20 05:34:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:34:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:34:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:34:13,843 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-20 05:34:13,846 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-20 05:34:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:34:14,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:34:14,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:34:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-20 05:34:14,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:34:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-20 05:34:14,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:34:14,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161594409] [2022-07-20 05:34:14,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161594409] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:34:14,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:34:14,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-20 05:34:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611005494] [2022-07-20 05:34:14,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:34:14,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 05:34:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:34:14,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 05:34:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:34:14,647 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:34:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:34:16,276 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2022-07-20 05:34:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:34:16,277 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2022-07-20 05:34:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:34:16,278 INFO L225 Difference]: With dead ends: 291 [2022-07-20 05:34:16,278 INFO L226 Difference]: Without dead ends: 279 [2022-07-20 05:34:16,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=641, Invalid=1521, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 05:34:16,279 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 232 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:34:16,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 2355 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 05:34:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-20 05:34:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 220. [2022-07-20 05:34:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 177 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:34:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2022-07-20 05:34:16,289 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 56 [2022-07-20 05:34:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:34:16,290 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2022-07-20 05:34:16,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:34:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2022-07-20 05:34:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 05:34:16,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:34:16,293 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:34:16,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:34:16,494 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-20 05:34:16,494 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:34:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:34:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093162, now seen corresponding path program 2 times [2022-07-20 05:34:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:34:16,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367518367] [2022-07-20 05:34:16,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:34:16,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:34:16,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:34:16,507 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-20 05:34:16,509 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-20 05:34:16,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:34:16,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:34:16,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:34:16,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:34:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-07-20 05:34:16,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:34:16,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:34:16,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367518367] [2022-07-20 05:34:16,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367518367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:34:16,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:34:16,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:34:16,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108341254] [2022-07-20 05:34:16,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:34:16,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:34:16,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:34:16,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:34:16,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:34:16,689 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:34:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:34:17,024 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2022-07-20 05:34:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:34:17,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-20 05:34:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:34:17,026 INFO L225 Difference]: With dead ends: 218 [2022-07-20 05:34:17,026 INFO L226 Difference]: Without dead ends: 218 [2022-07-20 05:34:17,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:34:17,026 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:34:17,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:34:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-20 05:34:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-07-20 05:34:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 175 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:34:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2022-07-20 05:34:17,030 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 63 [2022-07-20 05:34:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:34:17,031 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2022-07-20 05:34:17,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:34:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2022-07-20 05:34:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 05:34:17,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:34:17,031 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:34:17,040 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-20 05:34:17,238 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-20 05:34:17,239 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:34:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:34:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093161, now seen corresponding path program 1 times [2022-07-20 05:34:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:34:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901082636] [2022-07-20 05:34:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:34:17,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:34:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:34:17,241 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-20 05:34:17,243 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-20 05:34:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:34:17,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:34:17,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:34:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-20 05:34:17,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:34:17,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:34:17,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901082636] [2022-07-20 05:34:17,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901082636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:34:17,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:34:17,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:34:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233229158] [2022-07-20 05:34:17,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:34:17,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:34:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:34:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:34:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:34:17,688 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:34:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:34:18,117 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2022-07-20 05:34:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:34:18,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-20 05:34:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:34:18,118 INFO L225 Difference]: With dead ends: 216 [2022-07-20 05:34:18,119 INFO L226 Difference]: Without dead ends: 216 [2022-07-20 05:34:18,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:34:18,119 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 21 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:34:18,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 922 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:34:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-20 05:34:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-20 05:34:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 173 states have internal predecessors, (182), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:34:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2022-07-20 05:34:18,123 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 63 [2022-07-20 05:34:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:34:18,123 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2022-07-20 05:34:18,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:34:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2022-07-20 05:34:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 05:34:18,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:34:18,124 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:34:18,139 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-20 05:34:18,331 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-20 05:34:18,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:34:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:34:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash -585378383, now seen corresponding path program 1 times [2022-07-20 05:34:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:34:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195481559] [2022-07-20 05:34:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:34:18,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:34:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:34:18,334 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-20 05:34:18,351 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-20 05:34:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:34:19,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 05:34:19,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:34:19,018 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-20 05:34:19,046 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:34:19,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 05:34:19,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:34:19,189 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,189 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 37 treesize of output 35 [2022-07-20 05:34:19,212 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,212 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 37 treesize of output 35 [2022-07-20 05:34:19,256 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,257 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 37 treesize of output 35 [2022-07-20 05:34:19,296 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,296 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 37 treesize of output 35 [2022-07-20 05:34:19,319 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,319 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 37 treesize of output 35 [2022-07-20 05:34:19,342 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-20 05:34:19,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,361 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 37 treesize of output 35 [2022-07-20 05:34:19,384 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,384 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 37 treesize of output 35 [2022-07-20 05:34:19,410 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,410 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 37 treesize of output 35 [2022-07-20 05:34:19,448 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,448 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 37 treesize of output 35 [2022-07-20 05:34:19,469 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,469 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 37 treesize of output 35 [2022-07-20 05:34:19,499 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:19,499 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 34 treesize of output 35 [2022-07-20 05:34:19,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2022-07-20 05:34:19,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:19,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-07-20 05:34:19,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:34:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-20 05:34:19,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:34:21,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 05:34:21,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) .cse0))))) is different from false [2022-07-20 05:34:21,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:34:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:34:21,555 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 28 [2022-07-20 05:34:21,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:34:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-20 05:34:23,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:34:23,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195481559] [2022-07-20 05:34:23,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195481559] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:34:23,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:34:23,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-07-20 05:34:23,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771743595] [2022-07-20 05:34:23,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:34:23,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:34:23,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:34:23,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:34:23,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=288, Unknown=3, NotChecked=70, Total=420 [2022-07-20 05:34:23,646 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:34:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:34:24,786 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2022-07-20 05:34:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:34:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-07-20 05:34:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:34:24,788 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:34:24,788 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 05:34:24,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=90, Invalid=421, Unknown=3, NotChecked=86, Total=600 [2022-07-20 05:34:24,788 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 29 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:34:24,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2215 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 584 Invalid, 0 Unknown, 398 Unchecked, 1.0s Time] [2022-07-20 05:34:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 05:34:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2022-07-20 05:34:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 172 states have internal predecessors, (181), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:34:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions. [2022-07-20 05:34:24,793 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 64 [2022-07-20 05:34:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:34:24,793 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions. [2022-07-20 05:34:24,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:34:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions. [2022-07-20 05:34:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 05:34:24,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:34:24,794 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:34:24,827 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-20 05:34:25,003 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-20 05:34:25,004 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:34:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:34:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash -585378382, now seen corresponding path program 1 times [2022-07-20 05:34:25,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:34:25,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946267855] [2022-07-20 05:34:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:34:25,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:34:25,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:34:25,006 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-20 05:34:25,008 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-20 05:34:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:34:25,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 05:34:25,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:34:25,716 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-20 05:34:25,736 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 10 treesize of output 9 [2022-07-20 05:34:25,750 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:34:25,751 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-20 05:34:25,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:34:25,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:34:25,949 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:25,950 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 41 treesize of output 39 [2022-07-20 05:34:25,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:25,963 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 16 treesize of output 18 [2022-07-20 05:34:25,981 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:34:25,981 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 16 treesize of output 22 [2022-07-20 05:34:25,986 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 7 treesize of output 3 [2022-07-20 05:34:26,002 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,002 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 41 treesize of output 39 [2022-07-20 05:34:26,039 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,040 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 41 treesize of output 39 [2022-07-20 05:34:26,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:34:26,085 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:34:26,086 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 16 treesize of output 22 [2022-07-20 05:34:26,090 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 7 treesize of output 3 [2022-07-20 05:34:26,102 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,103 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 41 treesize of output 39 [2022-07-20 05:34:26,134 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,134 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 41 treesize of output 39 [2022-07-20 05:34:26,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,146 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 16 treesize of output 18 [2022-07-20 05:34:26,192 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:34:26,193 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 16 treesize of output 22 [2022-07-20 05:34:26,198 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 7 treesize of output 3 [2022-07-20 05:34:26,220 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,221 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 41 treesize of output 39 [2022-07-20 05:34:26,253 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:34:26,253 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 16 treesize of output 22 [2022-07-20 05:34:26,258 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 7 treesize of output 3 [2022-07-20 05:34:26,271 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,271 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 41 treesize of output 39 [2022-07-20 05:34:26,311 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,312 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 41 treesize of output 39 [2022-07-20 05:34:26,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,325 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 16 treesize of output 18 [2022-07-20 05:34:26,343 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:34:26,343 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 16 treesize of output 22 [2022-07-20 05:34:26,347 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 7 treesize of output 3 [2022-07-20 05:34:26,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,361 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 41 treesize of output 39 [2022-07-20 05:34:26,421 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:34:26,421 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 16 treesize of output 22 [2022-07-20 05:34:26,425 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 7 treesize of output 3 [2022-07-20 05:34:26,438 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,438 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 41 treesize of output 39 [2022-07-20 05:34:26,473 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,474 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 41 treesize of output 39 [2022-07-20 05:34:26,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,491 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 16 treesize of output 18 [2022-07-20 05:34:26,508 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:34:26,509 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 50 treesize of output 49 [2022-07-20 05:34:26,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:34:26,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 05:34:26,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-07-20 05:34:26,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,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, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-20 05:34:26,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:34:26,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-07-20 05:34:26,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:34:26,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:34:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-20 05:34:26,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:18,778 WARN L233 SmtUtils]: Spent 51.78s on a formula simplification that was a NOOP. DAG size: 227 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-20 05:35:24,201 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:35:24,201 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 40 treesize of output 1 [2022-07-20 05:35:24,206 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:35:24,206 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 37 treesize of output 1 [2022-07-20 05:35:25,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:35:25,124 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 45 treesize of output 36 [2022-07-20 05:35:25,126 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 54 treesize of output 36 [2022-07-20 05:35:25,130 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 19 treesize of output 11 [2022-07-20 05:35:25,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:35:25,148 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:35:25,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:35:25,165 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 05:35:25,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:35:25,171 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 33 treesize of output 21 [2022-07-20 05:35:25,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:35:25,176 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 24 treesize of output 12 [2022-07-20 05:35:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-20 05:35:25,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:25,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946267855] [2022-07-20 05:35:25,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946267855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:25,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:35:25,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-07-20 05:35:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761893455] [2022-07-20 05:35:25,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:25,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:35:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:35:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=358, Unknown=7, NotChecked=0, Total=420 [2022-07-20 05:35:25,387 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:35:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:29,042 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2022-07-20 05:35:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:35:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-07-20 05:35:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:29,044 INFO L225 Difference]: With dead ends: 221 [2022-07-20 05:35:29,044 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 05:35:29,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=150, Invalid=835, Unknown=7, NotChecked=0, Total=992 [2022-07-20 05:35:29,045 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 42 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:29,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2321 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 832 Invalid, 0 Unknown, 261 Unchecked, 2.6s Time] [2022-07-20 05:35:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 05:35:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2022-07-20 05:35:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.313868613138686) internal successors, (180), 171 states have internal predecessors, (180), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-20 05:35:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-07-20 05:35:29,049 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 64 [2022-07-20 05:35:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:29,050 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-07-20 05:35:29,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:35:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-07-20 05:35:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 05:35:29,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:29,050 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:29,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-20 05:35:29,259 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-20 05:35:29,260 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:35:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741073, now seen corresponding path program 1 times [2022-07-20 05:35:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:35:29,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257902546] [2022-07-20 05:35:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:29,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:35:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:35:29,271 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-20 05:35:29,295 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-20 05:35:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:29,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 05:35:29,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:29,970 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-20 05:35:30,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:35:30,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:35:30,254 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 05:35:30,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 36 [2022-07-20 05:35:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 128 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-20 05:35:30,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 128 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-20 05:35:30,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:30,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257902546] [2022-07-20 05:35:30,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257902546] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:30,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:35:30,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2022-07-20 05:35:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251094569] [2022-07-20 05:35:30,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:30,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:35:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:35:30,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:35:30,968 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:35:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:32,420 INFO L93 Difference]: Finished difference Result 262 states and 318 transitions. [2022-07-20 05:35:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:35:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2022-07-20 05:35:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:32,423 INFO L225 Difference]: With dead ends: 262 [2022-07-20 05:35:32,423 INFO L226 Difference]: Without dead ends: 262 [2022-07-20 05:35:32,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:35:32,423 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 150 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:32,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1077 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 936 Invalid, 0 Unknown, 566 Unchecked, 1.0s Time] [2022-07-20 05:35:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-20 05:35:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2022-07-20 05:35:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 188 states have internal predecessors, (204), 40 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2022-07-20 05:35:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2022-07-20 05:35:32,428 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 71 [2022-07-20 05:35:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:32,429 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2022-07-20 05:35:32,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:35:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2022-07-20 05:35:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 05:35:32,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:32,430 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:32,443 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-20 05:35:32,639 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-20 05:35:32,639 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:35:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741072, now seen corresponding path program 1 times [2022-07-20 05:35:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:35:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179143374] [2022-07-20 05:35:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:32,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:35:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:35:32,643 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-20 05:35:32,644 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-20 05:35:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:33,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 05:35:33,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:33,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:35:33,735 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 29 treesize of output 17 [2022-07-20 05:35:34,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:35:34,098 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-20 05:35:34,098 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 2 case distinctions, treesize of input 15 treesize of output 27 [2022-07-20 05:35:34,120 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:35:34,120 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-20 05:35:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-20 05:35:34,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:37,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_DUPFFnew_~ans~0#1.base_64| (_ BitVec 32)) (v_ArrVal_2948 (_ BitVec 32)) (|v_DUPFFnew_#Ultimate.C_memset_#ptr#1.base_54| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~f~0#1.offset|))) (and (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~f~0#1.offset|) .cse0) (bvule .cse0 (select (store (store |c_#length| |v_DUPFFnew_~ans~0#1.base_64| v_ArrVal_2948) |v_DUPFFnew_#Ultimate.C_memset_#ptr#1.base_54| (_ bv12 32)) |c_ULTIMATE.start_main_~f~0#1.base|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_DUPFFnew_~ans~0#1.base_64|)))))) is different from false [2022-07-20 05:35:37,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:37,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179143374] [2022-07-20 05:35:37,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179143374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:37,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753151430] [2022-07-20 05:35:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:37,066 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:35:37,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:35:37,068 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:35:37,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-07-20 05:35:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:38,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 05:35:38,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:38,815 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-20 05:35:38,820 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-20 05:35:38,905 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:35:38,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 05:35:38,922 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:35:38,922 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-20 05:35:39,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:35:39,638 INFO L356 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-07-20 05:35:39,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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-07-20 05:35:39,649 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:35:39,649 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-20 05:35:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-20 05:35:39,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:42,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_DUPFFnew_~ans~0#1.base_67| (_ BitVec 32)) (v_ArrVal_3241 (_ BitVec 32)) (v_ArrVal_3242 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_DUPFFnew_~ans~0#1.base_67|))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~f~0#1.offset|))) (and (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~f~0#1.offset|) .cse0) (bvule .cse0 (select (store (store |c_#length| |v_DUPFFnew_~ans~0#1.base_67| v_ArrVal_3242) v_ArrVal_3241 (_ bv12 32)) |c_ULTIMATE.start_main_~f~0#1.base|)))))) is different from false [2022-07-20 05:35:42,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1753151430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:42,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:35:42,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2022-07-20 05:35:42,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691675152] [2022-07-20 05:35:42,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:42,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 05:35:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 05:35:42,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1088, Unknown=2, NotChecked=134, Total=1332 [2022-07-20 05:35:42,143 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 30 states, 27 states have (on average 2.962962962962963) internal successors, (80), 23 states have internal predecessors, (80), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 05:35:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:44,739 INFO L93 Difference]: Finished difference Result 262 states and 317 transitions. [2022-07-20 05:35:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:35:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.962962962962963) internal successors, (80), 23 states have internal predecessors, (80), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2022-07-20 05:35:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:44,741 INFO L225 Difference]: With dead ends: 262 [2022-07-20 05:35:44,741 INFO L226 Difference]: Without dead ends: 262 [2022-07-20 05:35:44,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=193, Invalid=1883, Unknown=2, NotChecked=178, Total=2256 [2022-07-20 05:35:44,742 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 143 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 912 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:44,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1431 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 969 Invalid, 0 Unknown, 912 Unchecked, 1.9s Time] [2022-07-20 05:35:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-20 05:35:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2022-07-20 05:35:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 158 states have (on average 1.3101265822784811) internal successors, (207), 192 states have internal predecessors, (207), 40 states have call successors, (40), 13 states have call predecessors, (40), 14 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2022-07-20 05:35:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 290 transitions. [2022-07-20 05:35:44,754 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 290 transitions. Word has length 71 [2022-07-20 05:35:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:44,755 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 290 transitions. [2022-07-20 05:35:44,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.962962962962963) internal successors, (80), 23 states have internal predecessors, (80), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 05:35:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 290 transitions. [2022-07-20 05:35:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 05:35:44,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:44,756 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:44,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2022-07-20 05:35:44,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:45,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:35:45,171 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:35:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -242190254, now seen corresponding path program 1 times [2022-07-20 05:35:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:35:45,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530024333] [2022-07-20 05:35:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:45,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:35:45,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:35:45,173 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:35:45,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 05:35:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:45,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:35:45,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-07-20 05:35:45,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:35:45,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530024333] [2022-07-20 05:35:45,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530024333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:45,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:45,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 05:35:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345837908] [2022-07-20 05:35:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:45,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:35:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:45,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:35:45,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:35:45,793 INFO L87 Difference]: Start difference. First operand 244 states and 290 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:35:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:46,451 INFO L93 Difference]: Finished difference Result 250 states and 295 transitions. [2022-07-20 05:35:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:35:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-07-20 05:35:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:46,452 INFO L225 Difference]: With dead ends: 250 [2022-07-20 05:35:46,452 INFO L226 Difference]: Without dead ends: 250 [2022-07-20 05:35:46,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:35:46,453 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:46,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1252 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 50 Unchecked, 0.6s Time] [2022-07-20 05:35:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-20 05:35:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2022-07-20 05:35:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 162 states have (on average 1.308641975308642) internal successors, (212), 196 states have internal predecessors, (212), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2022-07-20 05:35:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 295 transitions. [2022-07-20 05:35:46,457 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 295 transitions. Word has length 77 [2022-07-20 05:35:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:46,457 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 295 transitions. [2022-07-20 05:35:46,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:35:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 295 transitions. [2022-07-20 05:35:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 05:35:46,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:46,458 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:46,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:46,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:35:46,671 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:35:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash -242190253, now seen corresponding path program 1 times [2022-07-20 05:35:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:35:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229373650] [2022-07-20 05:35:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:46,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:35:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:35:46,673 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:35:46,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 05:35:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:47,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 05:35:47,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-20 05:35:47,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:35:47,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:47,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229373650] [2022-07-20 05:35:47,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229373650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:47,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:47,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:35:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293868720] [2022-07-20 05:35:47,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:47,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:35:47,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:47,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:35:47,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:35:47,459 INFO L87 Difference]: Start difference. First operand 249 states and 295 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:35:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:48,404 INFO L93 Difference]: Finished difference Result 249 states and 294 transitions. [2022-07-20 05:35:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:35:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-07-20 05:35:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:48,406 INFO L225 Difference]: With dead ends: 249 [2022-07-20 05:35:48,406 INFO L226 Difference]: Without dead ends: 249 [2022-07-20 05:35:48,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:35:48,407 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 30 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:48,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1195 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 49 Unchecked, 0.9s Time] [2022-07-20 05:35:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-20 05:35:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-07-20 05:35:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 196 states have internal predecessors, (211), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2022-07-20 05:35:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2022-07-20 05:35:48,411 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 77 [2022-07-20 05:35:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:48,412 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2022-07-20 05:35:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:35:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2022-07-20 05:35:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-20 05:35:48,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:48,412 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:48,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-20 05:35:48,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:35:48,613 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:35:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1668104532, now seen corresponding path program 1 times [2022-07-20 05:35:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:35:48,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784997414] [2022-07-20 05:35:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:48,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:35:48,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:35:48,619 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:35:48,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 05:35:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:49,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:35:49,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 4 proven. 136 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-20 05:35:49,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:49,780 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 8 treesize of output 6 [2022-07-20 05:35:49,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:35:49,982 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 16 treesize of output 20 [2022-07-20 05:35:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 3 proven. 136 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-20 05:35:50,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784997414] [2022-07-20 05:35:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784997414] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:50,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:35:50,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-07-20 05:35:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748326155] [2022-07-20 05:35:50,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:50,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 05:35:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 05:35:50,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-07-20 05:35:50,540 INFO L87 Difference]: Start difference. First operand 249 states and 294 transitions. Second operand has 25 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 19 states have internal predecessors, (94), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-20 05:35:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:53,718 INFO L93 Difference]: Finished difference Result 269 states and 313 transitions. [2022-07-20 05:35:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:35:53,720 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 19 states have internal predecessors, (94), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 84 [2022-07-20 05:35:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:53,721 INFO L225 Difference]: With dead ends: 269 [2022-07-20 05:35:53,721 INFO L226 Difference]: Without dead ends: 269 [2022-07-20 05:35:53,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2022-07-20 05:35:53,721 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 120 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:53,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 2070 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 743 Invalid, 0 Unknown, 97 Unchecked, 2.7s Time] [2022-07-20 05:35:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-20 05:35:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2022-07-20 05:35:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 203 states have internal predecessors, (220), 41 states have call successors, (41), 17 states have call predecessors, (41), 16 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2022-07-20 05:35:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 305 transitions. [2022-07-20 05:35:53,725 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 305 transitions. Word has length 84 [2022-07-20 05:35:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:53,726 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 305 transitions. [2022-07-20 05:35:53,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 19 states have internal predecessors, (94), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-20 05:35:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2022-07-20 05:35:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-20 05:35:53,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:53,726 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:53,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:53,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:35:53,927 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:35:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953710, now seen corresponding path program 1 times [2022-07-20 05:35:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:35:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17831909] [2022-07-20 05:35:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:53,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:35:53,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:35:53,929 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:35:53,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 05:35:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:54,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 05:35:54,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-20 05:35:54,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-20 05:35:54,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17831909] [2022-07-20 05:35:54,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17831909] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:54,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:35:54,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2022-07-20 05:35:54,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778386430] [2022-07-20 05:35:54,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:54,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:35:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:35:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:35:54,775 INFO L87 Difference]: Start difference. First operand 259 states and 305 transitions. Second operand has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 05:35:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:55,927 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2022-07-20 05:35:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:35:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-07-20 05:35:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:55,930 INFO L225 Difference]: With dead ends: 280 [2022-07-20 05:35:55,930 INFO L226 Difference]: Without dead ends: 280 [2022-07-20 05:35:55,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:35:55,930 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 37 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:55,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1355 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 625 Invalid, 0 Unknown, 65 Unchecked, 1.1s Time] [2022-07-20 05:35:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-20 05:35:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 266. [2022-07-20 05:35:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 208 states have internal predecessors, (226), 42 states have call successors, (42), 19 states have call predecessors, (42), 17 states have return successors, (45), 41 states have call predecessors, (45), 42 states have call successors, (45) [2022-07-20 05:35:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 313 transitions. [2022-07-20 05:35:55,947 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 313 transitions. Word has length 86 [2022-07-20 05:35:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:55,947 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 313 transitions. [2022-07-20 05:35:55,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 05:35:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 313 transitions. [2022-07-20 05:35:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-20 05:35:55,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:55,948 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:55,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:56,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:35:56,162 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:35:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953709, now seen corresponding path program 1 times [2022-07-20 05:35:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:35:56,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654088870] [2022-07-20 05:35:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:35:56,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:35:56,164 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:35:56,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 05:35:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 05:35:56,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-20 05:35:57,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:58,069 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 24 treesize of output 20 [2022-07-20 05:35:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-20 05:35:58,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:35:58,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654088870] [2022-07-20 05:35:58,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654088870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:58,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:35:58,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-07-20 05:35:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510512323] [2022-07-20 05:35:58,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:58,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 05:35:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:35:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 05:35:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-07-20 05:35:58,186 INFO L87 Difference]: Start difference. First operand 266 states and 313 transitions. Second operand has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 05:36:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:01,181 INFO L93 Difference]: Finished difference Result 284 states and 333 transitions. [2022-07-20 05:36:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:36:01,182 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2022-07-20 05:36:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:01,183 INFO L225 Difference]: With dead ends: 284 [2022-07-20 05:36:01,183 INFO L226 Difference]: Without dead ends: 284 [2022-07-20 05:36:01,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-07-20 05:36:01,184 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 55 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:01,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 2764 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1156 Invalid, 0 Unknown, 57 Unchecked, 2.8s Time] [2022-07-20 05:36:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-20 05:36:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 279. [2022-07-20 05:36:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 185 states have (on average 1.2972972972972974) internal successors, (240), 219 states have internal predecessors, (240), 44 states have call successors, (44), 20 states have call predecessors, (44), 18 states have return successors, (47), 42 states have call predecessors, (47), 44 states have call successors, (47) [2022-07-20 05:36:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 331 transitions. [2022-07-20 05:36:01,188 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 331 transitions. Word has length 86 [2022-07-20 05:36:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:01,189 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 331 transitions. [2022-07-20 05:36:01,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 05:36:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 331 transitions. [2022-07-20 05:36:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 05:36:01,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:01,189 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:01,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-20 05:36:01,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:01,400 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash 194820021, now seen corresponding path program 2 times [2022-07-20 05:36:01,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:01,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548177742] [2022-07-20 05:36:01,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:36:01,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:01,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:01,402 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:01,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 05:36:02,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:36:02,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:02,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:36:02,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-07-20 05:36:02,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:02,286 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:36:02,287 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 12 treesize of output 11 [2022-07-20 05:36:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-07-20 05:36:02,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548177742] [2022-07-20 05:36:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548177742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:02,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2022-07-20 05:36:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29790927] [2022-07-20 05:36:02,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:36:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:36:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:36:02,296 INFO L87 Difference]: Start difference. First operand 279 states and 331 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 05:36:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:03,115 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions. [2022-07-20 05:36:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:36:03,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2022-07-20 05:36:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:03,117 INFO L225 Difference]: With dead ends: 308 [2022-07-20 05:36:03,117 INFO L226 Difference]: Without dead ends: 308 [2022-07-20 05:36:03,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:36:03,117 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 82 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:03,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1093 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 518 Invalid, 0 Unknown, 63 Unchecked, 0.7s Time] [2022-07-20 05:36:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-20 05:36:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 280. [2022-07-20 05:36:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 187 states have (on average 1.2834224598930482) internal successors, (240), 219 states have internal predecessors, (240), 44 states have call successors, (44), 21 states have call predecessors, (44), 18 states have return successors, (47), 42 states have call predecessors, (47), 44 states have call successors, (47) [2022-07-20 05:36:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 331 transitions. [2022-07-20 05:36:03,122 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 331 transitions. Word has length 92 [2022-07-20 05:36:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:03,122 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 331 transitions. [2022-07-20 05:36:03,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 05:36:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 331 transitions. [2022-07-20 05:36:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 05:36:03,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:03,123 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:03,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-20 05:36:03,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:03,332 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash 194820022, now seen corresponding path program 2 times [2022-07-20 05:36:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:03,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705870236] [2022-07-20 05:36:03,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:36:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:03,334 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:03,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-20 05:36:04,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:36:04,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:04,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 05:36:04,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 143 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-20 05:36:04,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:04,988 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 8 treesize of output 6 [2022-07-20 05:36:05,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:36:05,182 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 16 treesize of output 20 [2022-07-20 05:36:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 143 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-20 05:36:05,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705870236] [2022-07-20 05:36:05,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705870236] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:05,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:05,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2022-07-20 05:36:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560998943] [2022-07-20 05:36:05,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:36:05,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:05,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:36:05,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-07-20 05:36:05,771 INFO L87 Difference]: Start difference. First operand 280 states and 331 transitions. Second operand has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-20 05:36:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:13,930 INFO L93 Difference]: Finished difference Result 443 states and 541 transitions. [2022-07-20 05:36:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:36:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 92 [2022-07-20 05:36:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:13,934 INFO L225 Difference]: With dead ends: 443 [2022-07-20 05:36:13,934 INFO L226 Difference]: Without dead ends: 443 [2022-07-20 05:36:13,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=189, Invalid=1617, Unknown=0, NotChecked=0, Total=1806 [2022-07-20 05:36:13,935 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 266 mSDsluCounter, 4833 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:13,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 5171 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2145 Invalid, 0 Unknown, 173 Unchecked, 6.7s Time] [2022-07-20 05:36:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-20 05:36:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 393. [2022-07-20 05:36:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 255 states have (on average 1.3725490196078431) internal successors, (350), 293 states have internal predecessors, (350), 82 states have call successors, (82), 24 states have call predecessors, (82), 25 states have return successors, (91), 81 states have call predecessors, (91), 82 states have call successors, (91) [2022-07-20 05:36:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 523 transitions. [2022-07-20 05:36:13,950 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 523 transitions. Word has length 92 [2022-07-20 05:36:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:13,950 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 523 transitions. [2022-07-20 05:36:13,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-20 05:36:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 523 transitions. [2022-07-20 05:36:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 05:36:13,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:13,951 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:13,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:14,164 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -947573994, now seen corresponding path program 1 times [2022-07-20 05:36:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:14,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440848773] [2022-07-20 05:36:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:14,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:14,167 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-20 05:36:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:14,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 05:36:14,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-20 05:36:14,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:14,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:14,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440848773] [2022-07-20 05:36:14,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440848773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:14,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:14,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:36:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124042026] [2022-07-20 05:36:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:14,778 INFO L87 Difference]: Start difference. First operand 393 states and 523 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-20 05:36:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:14,783 INFO L93 Difference]: Finished difference Result 376 states and 490 transitions. [2022-07-20 05:36:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-07-20 05:36:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:14,785 INFO L225 Difference]: With dead ends: 376 [2022-07-20 05:36:14,785 INFO L226 Difference]: Without dead ends: 372 [2022-07-20 05:36:14,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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-20 05:36:14,786 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:14,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-20 05:36:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2022-07-20 05:36:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.3430962343096233) internal successors, (321), 275 states have internal predecessors, (321), 78 states have call successors, (78), 23 states have call predecessors, (78), 24 states have return successors, (87), 79 states have call predecessors, (87), 78 states have call successors, (87) [2022-07-20 05:36:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 486 transitions. [2022-07-20 05:36:14,800 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 486 transitions. Word has length 92 [2022-07-20 05:36:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:14,800 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 486 transitions. [2022-07-20 05:36:14,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-20 05:36:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 486 transitions. [2022-07-20 05:36:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-20 05:36:14,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:14,801 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:14,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:15,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:15,015 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883697, now seen corresponding path program 3 times [2022-07-20 05:36:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:15,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256933615] [2022-07-20 05:36:15,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:36:15,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:15,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:15,017 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:15,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-20 05:36:15,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 05:36:15,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:15,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:36:15,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-07-20 05:36:15,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:16,052 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:36:16,053 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 12 treesize of output 11 [2022-07-20 05:36:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-07-20 05:36:16,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:16,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256933615] [2022-07-20 05:36:16,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256933615] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:16,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:16,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-20 05:36:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126881457] [2022-07-20 05:36:16,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:16,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:36:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:36:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:36:16,066 INFO L87 Difference]: Start difference. First operand 372 states and 486 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-20 05:36:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:16,777 INFO L93 Difference]: Finished difference Result 404 states and 524 transitions. [2022-07-20 05:36:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:36:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 101 [2022-07-20 05:36:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:16,779 INFO L225 Difference]: With dead ends: 404 [2022-07-20 05:36:16,779 INFO L226 Difference]: Without dead ends: 404 [2022-07-20 05:36:16,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:36:16,779 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 79 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:16,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 976 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:36:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-07-20 05:36:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 369. [2022-07-20 05:36:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 237 states have (on average 1.3459915611814346) internal successors, (319), 273 states have internal predecessors, (319), 78 states have call successors, (78), 23 states have call predecessors, (78), 23 states have return successors, (85), 78 states have call predecessors, (85), 78 states have call successors, (85) [2022-07-20 05:36:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 482 transitions. [2022-07-20 05:36:16,786 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 482 transitions. Word has length 101 [2022-07-20 05:36:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:16,786 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 482 transitions. [2022-07-20 05:36:16,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-20 05:36:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 482 transitions. [2022-07-20 05:36:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-20 05:36:16,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:16,791 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:16,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:17,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:17,005 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883696, now seen corresponding path program 3 times [2022-07-20 05:36:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:17,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682293949] [2022-07-20 05:36:17,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:36:17,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:17,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:17,007 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:17,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-20 05:36:18,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 05:36:18,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:18,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:36:18,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-20 05:36:18,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:18,798 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 8 treesize of output 6 [2022-07-20 05:36:18,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:36:18,984 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 16 treesize of output 20 [2022-07-20 05:36:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-20 05:36:19,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:19,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682293949] [2022-07-20 05:36:19,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682293949] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:19,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:19,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2022-07-20 05:36:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201512087] [2022-07-20 05:36:19,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:19,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 05:36:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:19,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 05:36:19,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-07-20 05:36:19,715 INFO L87 Difference]: Start difference. First operand 369 states and 482 transitions. Second operand has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-20 05:36:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:28,961 INFO L93 Difference]: Finished difference Result 669 states and 905 transitions. [2022-07-20 05:36:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 05:36:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 101 [2022-07-20 05:36:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:28,964 INFO L225 Difference]: With dead ends: 669 [2022-07-20 05:36:28,964 INFO L226 Difference]: Without dead ends: 669 [2022-07-20 05:36:28,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=283, Invalid=2167, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 05:36:28,965 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 964 mSDsluCounter, 5459 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 5874 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:28,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 5874 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-20 05:36:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-20 05:36:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 570. [2022-07-20 05:36:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 353 states have (on average 1.501416430594901) internal successors, (530), 396 states have internal predecessors, (530), 163 states have call successors, (163), 25 states have call predecessors, (163), 23 states have return successors, (163), 163 states have call predecessors, (163), 163 states have call successors, (163) [2022-07-20 05:36:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 856 transitions. [2022-07-20 05:36:28,976 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 856 transitions. Word has length 101 [2022-07-20 05:36:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:28,976 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 856 transitions. [2022-07-20 05:36:28,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-20 05:36:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 856 transitions. [2022-07-20 05:36:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-20 05:36:28,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:28,977 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:28,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:29,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:29,191 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2143025534, now seen corresponding path program 1 times [2022-07-20 05:36:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:29,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221700811] [2022-07-20 05:36:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:29,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:29,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:29,200 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:29,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-20 05:36:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:30,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 05:36:30,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:30,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:30,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:30,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:30,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:30,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:30,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:30,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-07-20 05:36:30,543 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:36:30,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 18 [2022-07-20 05:36:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-20 05:36:30,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:30,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:30,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221700811] [2022-07-20 05:36:30,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221700811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:30,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:30,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 05:36:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626385674] [2022-07-20 05:36:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:30,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 05:36:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:30,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 05:36:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:36:30,585 INFO L87 Difference]: Start difference. First operand 570 states and 856 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 05:36:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:30,928 INFO L93 Difference]: Finished difference Result 507 states and 733 transitions. [2022-07-20 05:36:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:36:30,930 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 99 [2022-07-20 05:36:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:30,931 INFO L225 Difference]: With dead ends: 507 [2022-07-20 05:36:30,931 INFO L226 Difference]: Without dead ends: 491 [2022-07-20 05:36:30,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:36:30,932 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 13 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:30,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2050 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 131 Unchecked, 0.3s Time] [2022-07-20 05:36:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-20 05:36:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-20 05:36:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 345 states have internal predecessors, (449), 134 states have call successors, (134), 23 states have call predecessors, (134), 21 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2022-07-20 05:36:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 717 transitions. [2022-07-20 05:36:30,941 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 717 transitions. Word has length 99 [2022-07-20 05:36:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:30,941 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 717 transitions. [2022-07-20 05:36:30,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 05:36:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 717 transitions. [2022-07-20 05:36:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 05:36:30,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:30,942 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:30,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:31,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:31,155 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash 957572595, now seen corresponding path program 4 times [2022-07-20 05:36:31,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:31,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653228730] [2022-07-20 05:36:31,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:36:31,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:31,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:31,158 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:31,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-20 05:36:31,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:36:31,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:31,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 05:36:31,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 141 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-07-20 05:36:32,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:33,486 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 24 treesize of output 20 [2022-07-20 05:36:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 141 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-07-20 05:36:33,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:33,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653228730] [2022-07-20 05:36:33,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653228730] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:33,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:33,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-07-20 05:36:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021107248] [2022-07-20 05:36:33,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:33,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 05:36:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:33,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 05:36:33,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-07-20 05:36:33,614 INFO L87 Difference]: Start difference. First operand 491 states and 717 transitions. Second operand has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 7 states have call successors, (18), 8 states have call predecessors, (18), 4 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-20 05:36:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:36,454 INFO L93 Difference]: Finished difference Result 508 states and 746 transitions. [2022-07-20 05:36:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:36:36,456 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 7 states have call successors, (18), 8 states have call predecessors, (18), 4 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 107 [2022-07-20 05:36:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:36,458 INFO L225 Difference]: With dead ends: 508 [2022-07-20 05:36:36,458 INFO L226 Difference]: Without dead ends: 508 [2022-07-20 05:36:36,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 181 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:36:36,458 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 70 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:36,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2093 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 887 Invalid, 0 Unknown, 68 Unchecked, 2.4s Time] [2022-07-20 05:36:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-07-20 05:36:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 499. [2022-07-20 05:36:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 311 states have (on average 1.459807073954984) internal successors, (454), 352 states have internal predecessors, (454), 134 states have call successors, (134), 24 states have call predecessors, (134), 23 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2022-07-20 05:36:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 722 transitions. [2022-07-20 05:36:36,488 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 722 transitions. Word has length 107 [2022-07-20 05:36:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:36,489 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 722 transitions. [2022-07-20 05:36:36,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 7 states have call successors, (18), 8 states have call predecessors, (18), 4 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-20 05:36:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 722 transitions. [2022-07-20 05:36:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-20 05:36:36,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:36,490 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:36,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-20 05:36:36,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:36,707 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting DUPFFexgcdErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1221664532, now seen corresponding path program 1 times [2022-07-20 05:36:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:36,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730891593] [2022-07-20 05:36:36,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:36,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:36,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:36,709 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:36,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-20 05:36:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:37,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:36:37,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-20 05:36:38,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:38,892 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 8 treesize of output 6 [2022-07-20 05:36:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-20 05:36:38,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:38,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730891593] [2022-07-20 05:36:38,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730891593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:38,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:38,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-20 05:36:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052773796] [2022-07-20 05:36:38,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:38,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:36:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:36:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:36:38,972 INFO L87 Difference]: Start difference. First operand 499 states and 722 transitions. Second operand has 21 states, 20 states have (on average 4.55) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-20 05:36:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:42,792 INFO L93 Difference]: Finished difference Result 531 states and 748 transitions. [2022-07-20 05:36:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:36:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 113 [2022-07-20 05:36:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:42,795 INFO L225 Difference]: With dead ends: 531 [2022-07-20 05:36:42,795 INFO L226 Difference]: Without dead ends: 531 [2022-07-20 05:36:42,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 194 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-07-20 05:36:42,796 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 218 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:42,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1930 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1141 Invalid, 0 Unknown, 115 Unchecked, 3.3s Time] [2022-07-20 05:36:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-07-20 05:36:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 509. [2022-07-20 05:36:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 319 states have (on average 1.4420062695924765) internal successors, (460), 360 states have internal predecessors, (460), 134 states have call successors, (134), 26 states have call predecessors, (134), 25 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2022-07-20 05:36:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 728 transitions. [2022-07-20 05:36:42,820 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 728 transitions. Word has length 113 [2022-07-20 05:36:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:42,820 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 728 transitions. [2022-07-20 05:36:42,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-20 05:36:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 728 transitions. [2022-07-20 05:36:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 05:36:42,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:42,821 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:42,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:43,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:36:43,042 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:36:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash 783105185, now seen corresponding path program 1 times [2022-07-20 05:36:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:43,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660799020] [2022-07-20 05:36:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:43,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:43,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:43,045 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:36:43,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-20 05:36:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:44,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-20 05:36:44,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:44,432 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-20 05:36:44,467 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:36:44,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 05:36:44,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:36:44,652 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,652 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 37 treesize of output 35 [2022-07-20 05:36:44,700 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,700 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 37 treesize of output 35 [2022-07-20 05:36:44,735 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,735 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 37 treesize of output 35 [2022-07-20 05:36:44,761 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,761 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 37 treesize of output 35 [2022-07-20 05:36:44,794 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,795 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 37 treesize of output 35 [2022-07-20 05:36:44,826 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,827 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 37 treesize of output 35 [2022-07-20 05:36:44,849 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,849 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 37 treesize of output 35 [2022-07-20 05:36:44,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,872 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 37 treesize of output 35 [2022-07-20 05:36:44,894 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,894 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 37 treesize of output 35 [2022-07-20 05:36:44,916 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,916 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 37 treesize of output 35 [2022-07-20 05:36:44,938 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,938 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 37 treesize of output 35 [2022-07-20 05:36:44,964 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:44,964 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 34 treesize of output 35 [2022-07-20 05:36:44,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:44,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2022-07-20 05:36:45,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-07-20 05:36:45,187 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:36:45,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-20 05:36:45,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:45,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2022-07-20 05:36:46,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:36:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-20 05:36:46,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:46,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse0) v_ArrVal_7152) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-20 05:36:46,405 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~ret67#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0) v_ArrVal_7152) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-20 05:36:50,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_#res#1.base|) .cse0) v_ArrVal_7152) |c_DUPFFnew_#res#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-20 05:36:50,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_7152) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-20 05:36:50,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (_ BitVec 32)) (v_ArrVal_7147 (_ BitVec 32)) (v_ArrVal_7145 (_ BitVec 32)) (v_ArrVal_7144 (_ BitVec 32)) (v_ArrVal_7143 (_ BitVec 32)) (v_ArrVal_7142 (_ BitVec 32)) (v_ArrVal_7151 (_ BitVec 32)) (v_ArrVal_7150 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse0 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_7145) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_7144) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7143) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7142) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7147) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_7151) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7150) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7149)) (select .cse0 .cse1) v_ArrVal_7152)) |c_DUPFFnew_~ans~0#1.base|) .cse1))))) is different from false [2022-07-20 05:36:50,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (_ BitVec 32)) (v_ArrVal_7147 (_ BitVec 32)) (v_ArrVal_7145 (_ BitVec 32)) (v_ArrVal_7144 (_ BitVec 32)) (v_ArrVal_7143 (_ BitVec 32)) (v_ArrVal_7142 (_ BitVec 32)) (v_ArrVal_7151 (_ BitVec 32)) (v_ArrVal_7150 (_ BitVec 32))) (= (select |c_#valid| (let ((.cse2 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_7141))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse1 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_7145) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_7144) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7143) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7142) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7147) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_7151) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7150) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7149)) (select .cse1 .cse2) v_ArrVal_7152))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1))) is different from false [2022-07-20 05:36:50,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (_ BitVec 32)) (v_ArrVal_7147 (_ BitVec 32)) (v_ArrVal_7145 (_ BitVec 32)) (v_ArrVal_7144 (_ BitVec 32)) (v_ArrVal_7143 (_ BitVec 32)) (v_ArrVal_7142 (_ BitVec 32)) (v_ArrVal_7151 (_ BitVec 32)) (v_ArrVal_7150 (_ BitVec 32))) (= (select |c_#valid| (let ((.cse2 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_7141))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse1 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_7145) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_7144) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7143) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7142) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7147) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_7151) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7150) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7149)) (select .cse1 .cse2) v_ArrVal_7152))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1))) is different from false [2022-07-20 05:36:50,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (_ BitVec 32)) (v_ArrVal_7147 (_ BitVec 32)) (v_ArrVal_7145 (_ BitVec 32)) (v_ArrVal_7144 (_ BitVec 32)) (v_ArrVal_7143 (_ BitVec 32)) (v_ArrVal_7142 (_ BitVec 32)) (v_ArrVal_7151 (_ BitVec 32)) (v_ArrVal_7150 (_ BitVec 32))) (= (select |c_#valid| (let ((.cse2 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse2) v_ArrVal_7141))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse1 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_7145) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_7144) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7143) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7142) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7147) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_7151) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7150) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_7149)) (select .cse1 .cse2) v_ArrVal_7152))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1))) is different from false [2022-07-20 05:36:50,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:36:50,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 83 [2022-07-20 05:36:51,002 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 98 treesize of output 74 [2022-07-20 05:36:51,005 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 70 treesize of output 62 [2022-07-20 05:36:51,009 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 36 treesize of output 24 [2022-07-20 05:36:58,727 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 22 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:36:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 178 trivial. 12 not checked. [2022-07-20 05:36:58,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:58,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660799020] [2022-07-20 05:36:58,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660799020] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:58,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:58,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2022-07-20 05:36:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724927486] [2022-07-20 05:36:58,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:58,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 05:36:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:58,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 05:36:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=623, Unknown=9, NotChecked=456, Total=1190 [2022-07-20 05:36:58,741 INFO L87 Difference]: Start difference. First operand 509 states and 728 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-20 05:37:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:37:01,160 INFO L93 Difference]: Finished difference Result 533 states and 763 transitions. [2022-07-20 05:37:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:37:01,161 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 114 [2022-07-20 05:37:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:37:01,180 INFO L225 Difference]: With dead ends: 533 [2022-07-20 05:37:01,181 INFO L226 Difference]: Without dead ends: 533 [2022-07-20 05:37:01,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 182 SyntacticMatches, 20 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=157, Invalid=988, Unknown=9, NotChecked=568, Total=1722 [2022-07-20 05:37:01,181 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 81 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1708 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:37:01,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 3099 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1194 Invalid, 0 Unknown, 1708 Unchecked, 1.9s Time] [2022-07-20 05:37:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-20 05:37:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 519. [2022-07-20 05:37:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 327 states have (on average 1.4250764525993884) internal successors, (466), 368 states have internal predecessors, (466), 134 states have call successors, (134), 28 states have call predecessors, (134), 27 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2022-07-20 05:37:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 734 transitions. [2022-07-20 05:37:01,190 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 734 transitions. Word has length 114 [2022-07-20 05:37:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:37:01,191 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 734 transitions. [2022-07-20 05:37:01,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-20 05:37:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 734 transitions. [2022-07-20 05:37:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 05:37:01,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:37:01,193 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:37:01,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-20 05:37:01,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:37:01,410 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-07-20 05:37:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:37:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 783105186, now seen corresponding path program 1 times [2022-07-20 05:37:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:37:01,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383310598] [2022-07-20 05:37:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:37:01,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:37:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:37:01,412 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:37:01,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-20 05:37:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:37:02,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 05:37:02,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:37:02,810 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-20 05:37:02,838 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:37:02,838 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-20 05:37:02,843 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 10 treesize of output 9 [2022-07-20 05:37:02,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:37:02,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:37:03,076 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,076 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 41 treesize of output 39 [2022-07-20 05:37:03,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,096 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 16 treesize of output 18 [2022-07-20 05:37:03,124 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,124 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 41 treesize of output 39 [2022-07-20 05:37:03,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,144 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 16 treesize of output 18 [2022-07-20 05:37:03,166 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,167 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 41 treesize of output 39 [2022-07-20 05:37:03,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,181 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 16 treesize of output 18 [2022-07-20 05:37:03,201 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:37:03,202 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 16 treesize of output 22 [2022-07-20 05:37:03,205 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 7 treesize of output 3 [2022-07-20 05:37:03,226 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-07-20 05:37:03,269 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,269 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 41 treesize of output 39 [2022-07-20 05:37:03,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,286 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 16 treesize of output 18 [2022-07-20 05:37:03,308 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:37:03,308 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 16 treesize of output 22 [2022-07-20 05:37:03,315 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 7 treesize of output 3 [2022-07-20 05:37:03,335 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-07-20 05:37:03,399 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,399 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 41 treesize of output 39 [2022-07-20 05:37:03,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,418 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 16 treesize of output 18 [2022-07-20 05:37:03,473 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:37:03,474 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 16 treesize of output 22 [2022-07-20 05:37:03,477 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 7 treesize of output 3 [2022-07-20 05:37:03,501 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,502 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 41 treesize of output 39 [2022-07-20 05:37:03,555 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:37:03,555 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 16 treesize of output 22 [2022-07-20 05:37:03,562 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 7 treesize of output 3 [2022-07-20 05:37:03,583 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,583 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 41 treesize of output 39 [2022-07-20 05:37:03,626 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:37:03,627 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 16 treesize of output 22 [2022-07-20 05:37:03,634 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 7 treesize of output 3 [2022-07-20 05:37:03,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,655 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 41 treesize of output 39 [2022-07-20 05:37:03,700 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,700 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 41 treesize of output 39 [2022-07-20 05:37:03,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,725 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 16 treesize of output 18 [2022-07-20 05:37:03,751 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:03,751 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 50 treesize of output 49 [2022-07-20 05:37:03,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:37:03,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 05:37:03,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-07-20 05:37:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,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, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-07-20 05:37:03,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:03,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-20 05:37:04,080 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:37:04,080 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 42 treesize of output 41 [2022-07-20 05:37:04,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,085 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 20 treesize of output 22 [2022-07-20 05:37:04,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2022-07-20 05:37:04,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:37:04,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 05:37:05,182 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 15 treesize of output 7 [2022-07-20 05:37:05,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:37:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-20 05:37:05,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:37:06,076 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_7529) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_7530) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0))))) (forall ((v_ArrVal_7529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_7529) |c_ULTIMATE.start_main_~g~0#1.base|) (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32))))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 05:37:06,101 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse1) v_ArrVal_7529) |c_ULTIMATE.start_main_~g~0#1.base|) .cse1)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_7529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7529) |c_ULTIMATE.start_main_~g~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7530) |c_ULTIMATE.start_main_~g~0#1.base|) .cse3))))))) is different from false [2022-07-20 05:37:06,128 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~ret67#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7529) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7530) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1)))))) (forall ((v_ArrVal_7529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~ret67#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse3) v_ArrVal_7529) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse3)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2022-07-20 05:37:48,948 WARN L233 SmtUtils]: Spent 42.81s on a formula simplification that was a NOOP. DAG size: 227 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-20 05:37:54,591 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:37:54,592 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 156 treesize of output 1 [2022-07-20 05:37:54,602 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:37:54,602 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 151 treesize of output 1