./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:40:38,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:40:38,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:40:38,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:40:38,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:40:38,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:40:38,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:40:38,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:40:38,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:40:38,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:40:38,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:40:38,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:40:38,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:40:38,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:40:38,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:40:38,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:40:38,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:40:38,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:40:38,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:40:38,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:40:38,177 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:40:38,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:40:38,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:40:38,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:40:38,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:40:38,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:40:38,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:40:38,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:40:38,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:40:38,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:40:38,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:40:38,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:40:38,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:40:38,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:40:38,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:40:38,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:40:38,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:40:38,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:40:38,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:40:38,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:40:38,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:40:38,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:40:38,208 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 12:40:38,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:40:38,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:40:38,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:40:38,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:40:38,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:40:38,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:40:38,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:40:38,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:40:38,241 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:40:38,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:40:38,242 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:40:38,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:40:38,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:40:38,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:40:38,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:40:38,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:40:38,243 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:40:38,243 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:40:38,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:40:38,244 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:40:38,244 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:40:38,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:40:38,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:40:38,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:40:38,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:40:38,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:40:38,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:40:38,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:40:38,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 12:40:38,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 12:40:38,245 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2022-07-23 12:40:38,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:40:38,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:40:38,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:40:38,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:40:38,475 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:40:38,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-07-23 12:40:38,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4f41642/f957242c7dcb43d4a3e4bef1c1b06a99/FLAG994bb9510 [2022-07-23 12:40:39,021 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:40:39,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-07-23 12:40:39,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4f41642/f957242c7dcb43d4a3e4bef1c1b06a99/FLAG994bb9510 [2022-07-23 12:40:39,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4f41642/f957242c7dcb43d4a3e4bef1c1b06a99 [2022-07-23 12:40:39,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:40:39,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:40:39,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:40:39,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:40:39,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:40:39,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:40:39" (1/1) ... [2022-07-23 12:40:39,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d91b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:39, skipping insertion in model container [2022-07-23 12:40:39,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:40:39" (1/1) ... [2022-07-23 12:40:39,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:40:39,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:40:39,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-07-23 12:40:39,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-07-23 12:40:39,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:40:39,833 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-23 12:40:39,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7685a67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:39, skipping insertion in model container [2022-07-23 12:40:39,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:40:39,835 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 12:40:39,837 INFO L158 Benchmark]: Toolchain (without parser) took 510.74ms. Allocated memory is still 136.3MB. Free memory was 104.5MB in the beginning and 96.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-23 12:40:39,838 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 91.6MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 12:40:39,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.42ms. Allocated memory is still 136.3MB. Free memory was 114.2MB in the beginning and 96.1MB in the end (delta: 18.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-07-23 12:40:39,840 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.14ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 91.6MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.42ms. Allocated memory is still 136.3MB. Free memory was 114.2MB in the beginning and 96.1MB in the end (delta: 18.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:40:41,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:40:41,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:40:41,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:40:41,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:40:41,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:40:41,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:40:41,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:40:41,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:40:41,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:40:41,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:40:41,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:40:41,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:40:41,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:40:41,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:40:41,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:40:41,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:40:41,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:40:41,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:40:41,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:40:41,651 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:40:41,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:40:41,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:40:41,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:40:41,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:40:41,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:40:41,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:40:41,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:40:41,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:40:41,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:40:41,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:40:41,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:40:41,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:40:41,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:40:41,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:40:41,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:40:41,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:40:41,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:40:41,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:40:41,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:40:41,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:40:41,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:40:41,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 12:40:41,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:40:41,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:40:41,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:40:41,702 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:40:41,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:40:41,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:40:41,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:40:41,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:40:41,704 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:40:41,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:40:41,705 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:40:41,705 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:40:41,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:40:41,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:40:41,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:40:41,705 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:40:41,705 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:40:41,706 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:40:41,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:40:41,706 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:40:41,706 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 12:40:41,706 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 12:40:41,706 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:40:41,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:40:41,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:40:41,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:40:41,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:40:41,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:40:41,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:40:41,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:40:41,708 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 12:40:41,708 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 12:40:41,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 12:40:41,708 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2022-07-23 12:40:41,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:40:41,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:40:41,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:40:42,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:40:42,002 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:40:42,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-07-23 12:40:42,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d5a6b18/3bb27f7c6b3a42c2a8ececc6891f4d02/FLAGb9bafc7df [2022-07-23 12:40:42,476 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:40:42,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-07-23 12:40:42,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d5a6b18/3bb27f7c6b3a42c2a8ececc6891f4d02/FLAGb9bafc7df [2022-07-23 12:40:42,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d5a6b18/3bb27f7c6b3a42c2a8ececc6891f4d02 [2022-07-23 12:40:42,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:40:42,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:40:42,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:40:42,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:40:42,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:40:42,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:40:42" (1/1) ... [2022-07-23 12:40:42,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a793b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:42, skipping insertion in model container [2022-07-23 12:40:42,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:40:42" (1/1) ... [2022-07-23 12:40:42,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:40:42,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:40:43,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-07-23 12:40:43,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-07-23 12:40:43,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:40:43,400 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 12:40:43,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:40:43,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-07-23 12:40:43,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-07-23 12:40:43,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:40:43,530 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 12:40:43,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-07-23 12:40:43,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-07-23 12:40:43,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:40:43,658 INFO L208 MainTranslator]: Completed translation [2022-07-23 12:40:43,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43 WrapperNode [2022-07-23 12:40:43,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:40:43,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 12:40:43,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 12:40:43,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 12:40:43,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,757 INFO L137 Inliner]: procedures = 180, calls = 487, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1721 [2022-07-23 12:40:43,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 12:40:43,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 12:40:43,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 12:40:43,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 12:40:43,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 12:40:43,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 12:40:43,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 12:40:43,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 12:40:43,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (1/1) ... [2022-07-23 12:40:43,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:40:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 12:40:43,908 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-23 12:40:43,939 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-23 12:40:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 12:40:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 12:40:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 12:40:43,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 12:40:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 12:40:43,971 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 12:40:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 12:40:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 12:40:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 12:40:43,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 12:40:44,232 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 12:40:44,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 12:40:44,236 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 12:40:49,355 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 12:40:49,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 12:40:49,388 INFO L299 CfgBuilder]: Removed 100 assume(true) statements. [2022-07-23 12:40:49,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:40:49 BoogieIcfgContainer [2022-07-23 12:40:49,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 12:40:49,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 12:40:49,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 12:40:49,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 12:40:49,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:40:42" (1/3) ... [2022-07-23 12:40:49,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa6f646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:40:49, skipping insertion in model container [2022-07-23 12:40:49,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:40:43" (2/3) ... [2022-07-23 12:40:49,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa6f646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:40:49, skipping insertion in model container [2022-07-23 12:40:49,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:40:49" (3/3) ... [2022-07-23 12:40:49,408 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2022-07-23 12:40:49,420 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 12:40:49,433 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 932 error locations. [2022-07-23 12:40:49,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 12:40:49,549 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@5bd7b278, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7478ce0e [2022-07-23 12:40:49,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 932 error locations. [2022-07-23 12:40:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:40:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:40:49,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:40:49,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:40:49,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:40:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:40:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-23 12:40:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:40:49,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368466543] [2022-07-23 12:40:49,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:40:49,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:40:49,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:40:49,589 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-23 12:40:49,618 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-23 12:40:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:40:49,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-23 12:40:49,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:40:49,764 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-23 12:40:49,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:40:49,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:40:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368466543] [2022-07-23 12:40:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368466543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:40:49,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:40:49,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:40:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091465792] [2022-07-23 12:40:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:40:49,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 12:40:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:40:49,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 12:40:49,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 12:40:49,792 INFO L87 Difference]: Start difference. First operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:40:49,879 INFO L93 Difference]: Finished difference Result 1815 states and 1917 transitions. [2022-07-23 12:40:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 12:40:49,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 12:40:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:40:49,901 INFO L225 Difference]: With dead ends: 1815 [2022-07-23 12:40:49,901 INFO L226 Difference]: Without dead ends: 1813 [2022-07-23 12:40:49,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 12:40:49,905 INFO L413 NwaCegarLoop]: 1917 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:40:49,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:40:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-07-23 12:40:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2022-07-23 12:40:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 884 states have (on average 2.1414027149321266) internal successors, (1893), 1804 states have internal predecessors, (1893), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:40:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 1915 transitions. [2022-07-23 12:40:50,022 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 1915 transitions. Word has length 5 [2022-07-23 12:40:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:40:50,023 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 1915 transitions. [2022-07-23 12:40:50,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 1915 transitions. [2022-07-23 12:40:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:40:50,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:40:50,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:40:50,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 12:40:50,232 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-23 12:40:50,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:40:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:40:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-23 12:40:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:40:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659231240] [2022-07-23 12:40:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:40:50,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:40:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:40:50,237 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-23 12:40:50,239 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-23 12:40:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:40:50,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:40:50,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:40:50,429 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-23 12:40:50,451 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-23 12:40:50,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:40:50,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:40:50,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659231240] [2022-07-23 12:40:50,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659231240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:40:50,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:40:50,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:40:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371218470] [2022-07-23 12:40:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:40:50,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:40:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:40:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:40:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:40:50,455 INFO L87 Difference]: Start difference. First operand 1813 states and 1915 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:40:52,954 INFO L93 Difference]: Finished difference Result 2069 states and 2214 transitions. [2022-07-23 12:40:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:40:52,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 12:40:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:40:52,962 INFO L225 Difference]: With dead ends: 2069 [2022-07-23 12:40:52,962 INFO L226 Difference]: Without dead ends: 2069 [2022-07-23 12:40:52,962 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-23 12:40:52,964 INFO L413 NwaCegarLoop]: 1354 mSDtfsCounter, 1369 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 12:40:52,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1809 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-23 12:40:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2022-07-23 12:40:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1798. [2022-07-23 12:40:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 960 states have (on average 2.017708333333333) internal successors, (1937), 1789 states have internal predecessors, (1937), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:40:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 1959 transitions. [2022-07-23 12:40:53,003 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 1959 transitions. Word has length 5 [2022-07-23 12:40:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:40:53,003 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 1959 transitions. [2022-07-23 12:40:53,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 1959 transitions. [2022-07-23 12:40:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:40:53,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:40:53,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:40:53,026 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-23 12:40:53,230 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-23 12:40:53,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:40:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:40:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-23 12:40:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:40:53,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390899061] [2022-07-23 12:40:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:40:53,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:40:53,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:40:53,234 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-23 12:40:53,271 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-23 12:40:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:40:53,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:40:53,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:40:53,397 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-23 12:40:53,410 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-23 12:40:53,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:40:53,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:40:53,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390899061] [2022-07-23 12:40:53,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390899061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:40:53,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:40:53,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:40:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672903892] [2022-07-23 12:40:53,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:40:53,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:40:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:40:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:40:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:40:53,413 INFO L87 Difference]: Start difference. First operand 1798 states and 1959 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:40:56,433 INFO L93 Difference]: Finished difference Result 2318 states and 2529 transitions. [2022-07-23 12:40:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:40:56,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 12:40:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:40:56,440 INFO L225 Difference]: With dead ends: 2318 [2022-07-23 12:40:56,440 INFO L226 Difference]: Without dead ends: 2318 [2022-07-23 12:40:56,440 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-23 12:40:56,441 INFO L413 NwaCegarLoop]: 1746 mSDtfsCounter, 741 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:40:56,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2548 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 12:40:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-07-23 12:40:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1954. [2022-07-23 12:40:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1126 states have (on average 1.992007104795737) internal successors, (2243), 1945 states have internal predecessors, (2243), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:40:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2265 transitions. [2022-07-23 12:40:56,476 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2265 transitions. Word has length 5 [2022-07-23 12:40:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:40:56,477 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2265 transitions. [2022-07-23 12:40:56,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2265 transitions. [2022-07-23 12:40:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 12:40:56,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:40:56,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 12:40:56,486 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-23 12:40:56,684 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-23 12:40:56,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:40:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:40:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-23 12:40:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:40:56,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114331747] [2022-07-23 12:40:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:40:56,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:40:56,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:40:56,696 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-23 12:40:56,727 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-23 12:40:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:40:56,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:40:56,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:40:56,824 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-23 12:40:56,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:40:56,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:40:56,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114331747] [2022-07-23 12:40:56,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114331747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:40:56,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:40:56,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:40:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418048211] [2022-07-23 12:40:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:40:56,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:40:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:40:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:40:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:40:56,836 INFO L87 Difference]: Start difference. First operand 1954 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:40:56,923 INFO L93 Difference]: Finished difference Result 3514 states and 4117 transitions. [2022-07-23 12:40:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:40:56,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 12:40:56,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:40:56,935 INFO L225 Difference]: With dead ends: 3514 [2022-07-23 12:40:56,935 INFO L226 Difference]: Without dead ends: 3514 [2022-07-23 12:40:56,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:40:56,936 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 1377 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 4069 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:40:56,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 4069 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:40:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2022-07-23 12:40:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 1956. [2022-07-23 12:40:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1128 states have (on average 1.9902482269503545) internal successors, (2245), 1947 states have internal predecessors, (2245), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:40:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2267 transitions. [2022-07-23 12:40:56,974 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2267 transitions. Word has length 6 [2022-07-23 12:40:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:40:56,975 INFO L495 AbstractCegarLoop]: Abstraction has 1956 states and 2267 transitions. [2022-07-23 12:40:56,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2267 transitions. [2022-07-23 12:40:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 12:40:56,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:40:56,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:40:56,982 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-23 12:40:57,182 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-23 12:40:57,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:40:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:40:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-23 12:40:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:40:57,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672320995] [2022-07-23 12:40:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:40:57,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:40:57,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:40:57,185 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-23 12:40:57,187 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-23 12:40:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:40:57,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:40:57,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:40:57,344 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-23 12:40:57,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:40:57,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:40:57,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672320995] [2022-07-23 12:40:57,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672320995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:40:57,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:40:57,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:40:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438449632] [2022-07-23 12:40:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:40:57,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:40:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:40:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:40:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:40:57,345 INFO L87 Difference]: Start difference. First operand 1956 states and 2267 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:40:57,369 INFO L93 Difference]: Finished difference Result 1920 states and 2230 transitions. [2022-07-23 12:40:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:40:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 12:40:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:40:57,374 INFO L225 Difference]: With dead ends: 1920 [2022-07-23 12:40:57,374 INFO L226 Difference]: Without dead ends: 1920 [2022-07-23 12:40:57,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:40:57,375 INFO L413 NwaCegarLoop]: 1766 mSDtfsCounter, 1736 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:40:57,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 1794 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:40:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2022-07-23 12:40:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1914. [2022-07-23 12:40:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1110 states have (on average 1.9837837837837837) internal successors, (2202), 1905 states have internal predecessors, (2202), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:40:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2224 transitions. [2022-07-23 12:40:57,394 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2224 transitions. Word has length 11 [2022-07-23 12:40:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:40:57,395 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2224 transitions. [2022-07-23 12:40:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2224 transitions. [2022-07-23 12:40:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 12:40:57,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:40:57,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:40:57,405 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-23 12:40:57,603 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-23 12:40:57,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:40:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:40:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-23 12:40:57,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:40:57,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108667736] [2022-07-23 12:40:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:40:57,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:40:57,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:40:57,607 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-23 12:40:57,608 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-23 12:40:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:40:57,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:40:57,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:40:57,758 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-23 12:40:57,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:40:57,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:40:57,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108667736] [2022-07-23 12:40:57,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108667736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:40:57,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:40:57,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:40:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028070873] [2022-07-23 12:40:57,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:40:57,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:40:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:40:57,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:40:57,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:40:57,761 INFO L87 Difference]: Start difference. First operand 1914 states and 2224 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:40:57,820 INFO L93 Difference]: Finished difference Result 1899 states and 2202 transitions. [2022-07-23 12:40:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:40:57,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 12:40:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:40:57,825 INFO L225 Difference]: With dead ends: 1899 [2022-07-23 12:40:57,825 INFO L226 Difference]: Without dead ends: 1899 [2022-07-23 12:40:57,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:40:57,825 INFO L413 NwaCegarLoop]: 1721 mSDtfsCounter, 1707 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:40:57,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 3463 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:40:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-07-23 12:40:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1892. [2022-07-23 12:40:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1102 states have (on average 1.971869328493648) internal successors, (2173), 1883 states have internal predecessors, (2173), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:40:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2195 transitions. [2022-07-23 12:40:57,853 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2195 transitions. Word has length 13 [2022-07-23 12:40:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:40:57,853 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2195 transitions. [2022-07-23 12:40:57,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:40:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2195 transitions. [2022-07-23 12:40:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 12:40:57,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:40:57,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:40:57,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-23 12:40:58,061 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-23 12:40:58,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:40:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:40:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-23 12:40:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:40:58,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047008622] [2022-07-23 12:40:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:40:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:40:58,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:40:58,065 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-23 12:40:58,115 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-23 12:40:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:40:58,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:40:58,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:40:58,258 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-23 12:40:58,311 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-23 12:40:58,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:40:58,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:40:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047008622] [2022-07-23 12:40:58,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047008622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:40:58,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:40:58,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:40:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803219312] [2022-07-23 12:40:58,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:40:58,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:40:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:40:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:40:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:40:58,317 INFO L87 Difference]: Start difference. First operand 1892 states and 2195 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:01,543 INFO L93 Difference]: Finished difference Result 3106 states and 3455 transitions. [2022-07-23 12:41:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:41:01,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 12:41:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:01,554 INFO L225 Difference]: With dead ends: 3106 [2022-07-23 12:41:01,554 INFO L226 Difference]: Without dead ends: 3106 [2022-07-23 12:41:01,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:41:01,556 INFO L413 NwaCegarLoop]: 1071 mSDtfsCounter, 3382 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:01,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 2422 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 12:41:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-07-23 12:41:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1888. [2022-07-23 12:41:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1102 states have (on average 1.9682395644283122) internal successors, (2169), 1879 states have internal predecessors, (2169), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:41:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2191 transitions. [2022-07-23 12:41:01,589 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2191 transitions. Word has length 27 [2022-07-23 12:41:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:01,590 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2191 transitions. [2022-07-23 12:41:01,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2191 transitions. [2022-07-23 12:41:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 12:41:01,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:01,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:01,605 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-23 12:41:01,801 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-23 12:41:01,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-23 12:41:01,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:01,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848517004] [2022-07-23 12:41:01,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:01,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:01,805 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-23 12:41:01,820 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-23 12:41:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:01,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:41:01,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:02,005 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-23 12:41:02,096 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-23 12:41:02,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:41:02,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:02,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848517004] [2022-07-23 12:41:02,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848517004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:41:02,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:41:02,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:41:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220762027] [2022-07-23 12:41:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:41:02,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:41:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:41:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:41:02,099 INFO L87 Difference]: Start difference. First operand 1888 states and 2191 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:05,940 INFO L93 Difference]: Finished difference Result 2634 states and 2855 transitions. [2022-07-23 12:41:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:41:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 12:41:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:05,947 INFO L225 Difference]: With dead ends: 2634 [2022-07-23 12:41:05,947 INFO L226 Difference]: Without dead ends: 2634 [2022-07-23 12:41:05,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:41:05,947 INFO L413 NwaCegarLoop]: 1272 mSDtfsCounter, 1687 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:05,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 2885 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-23 12:41:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-07-23 12:41:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1884. [2022-07-23 12:41:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1102 states have (on average 1.9646098003629764) internal successors, (2165), 1875 states have internal predecessors, (2165), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:41:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2187 transitions. [2022-07-23 12:41:05,969 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2187 transitions. Word has length 27 [2022-07-23 12:41:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:05,969 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2187 transitions. [2022-07-23 12:41:05,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2187 transitions. [2022-07-23 12:41:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 12:41:05,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:05,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:05,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 12:41:06,178 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-23 12:41:06,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-23 12:41:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:06,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136291137] [2022-07-23 12:41:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:06,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:06,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:06,182 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-23 12:41:06,184 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-23 12:41:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:06,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:41:06,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:06,437 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-23 12:41:06,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:41:06,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136291137] [2022-07-23 12:41:06,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136291137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:41:06,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:41:06,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:41:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70411209] [2022-07-23 12:41:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:41:06,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:41:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:41:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:41:06,440 INFO L87 Difference]: Start difference. First operand 1884 states and 2187 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:06,483 INFO L93 Difference]: Finished difference Result 1884 states and 2183 transitions. [2022-07-23 12:41:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:41:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 12:41:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:06,491 INFO L225 Difference]: With dead ends: 1884 [2022-07-23 12:41:06,491 INFO L226 Difference]: Without dead ends: 1884 [2022-07-23 12:41:06,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:41:06,493 INFO L413 NwaCegarLoop]: 1715 mSDtfsCounter, 1683 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:06,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 3441 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:41:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-07-23 12:41:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1878. [2022-07-23 12:41:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1096 states have (on average 1.9662408759124088) internal successors, (2155), 1869 states have internal predecessors, (2155), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:41:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2177 transitions. [2022-07-23 12:41:06,535 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2177 transitions. Word has length 42 [2022-07-23 12:41:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:06,536 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2177 transitions. [2022-07-23 12:41:06,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2177 transitions. [2022-07-23 12:41:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 12:41:06,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:06,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:06,560 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-23 12:41:06,748 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-23 12:41:06,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-23 12:41:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:06,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103933965] [2022-07-23 12:41:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:06,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:06,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:06,752 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-23 12:41:06,756 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-23 12:41:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:06,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:41:06,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:07,122 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-23 12:41:07,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:41:07,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:07,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103933965] [2022-07-23 12:41:07,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103933965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:41:07,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:41:07,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:41:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313091842] [2022-07-23 12:41:07,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:41:07,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:41:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:07,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:41:07,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:41:07,123 INFO L87 Difference]: Start difference. First operand 1878 states and 2177 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:07,262 INFO L93 Difference]: Finished difference Result 2297 states and 2613 transitions. [2022-07-23 12:41:07,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:41:07,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-23 12:41:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:07,267 INFO L225 Difference]: With dead ends: 2297 [2022-07-23 12:41:07,267 INFO L226 Difference]: Without dead ends: 2297 [2022-07-23 12:41:07,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:41:07,268 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 455 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:07,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3382 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:41:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2022-07-23 12:41:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1924. [2022-07-23 12:41:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1142 states have (on average 1.9273204903677759) internal successors, (2201), 1915 states have internal predecessors, (2201), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:41:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2223 transitions. [2022-07-23 12:41:07,288 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2223 transitions. Word has length 50 [2022-07-23 12:41:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:07,288 INFO L495 AbstractCegarLoop]: Abstraction has 1924 states and 2223 transitions. [2022-07-23 12:41:07,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2223 transitions. [2022-07-23 12:41:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 12:41:07,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:07,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:07,302 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-23 12:41:07,500 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-23 12:41:07,500 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-23 12:41:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:07,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191765890] [2022-07-23 12:41:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:07,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:07,503 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-23 12:41:07,505 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-23 12:41:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:07,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:41:07,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:07,822 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-23 12:41:07,841 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-23 12:41:08,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:41:08,092 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-23 12:41:08,100 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:41:08,100 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-23 12:41:08,109 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-23 12:41:08,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:41:08,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:08,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191765890] [2022-07-23 12:41:08,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191765890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:41:08,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:41:08,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:41:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509399127] [2022-07-23 12:41:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:41:08,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:41:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:41:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:41:08,111 INFO L87 Difference]: Start difference. First operand 1924 states and 2223 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:10,787 INFO L93 Difference]: Finished difference Result 2111 states and 2394 transitions. [2022-07-23 12:41:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:41:10,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-23 12:41:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:10,792 INFO L225 Difference]: With dead ends: 2111 [2022-07-23 12:41:10,792 INFO L226 Difference]: Without dead ends: 2111 [2022-07-23 12:41:10,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:41:10,793 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1569 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:10,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1308 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 12:41:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2022-07-23 12:41:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1674. [2022-07-23 12:41:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 976 states have (on average 1.8442622950819672) internal successors, (1800), 1665 states have internal predecessors, (1800), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:41:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 1822 transitions. [2022-07-23 12:41:10,810 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 1822 transitions. Word has length 53 [2022-07-23 12:41:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:10,810 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 1822 transitions. [2022-07-23 12:41:10,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1822 transitions. [2022-07-23 12:41:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 12:41:10,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:10,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:10,825 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-23 12:41:11,027 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-23 12:41:11,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-23 12:41:11,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:11,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966144263] [2022-07-23 12:41:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:11,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:11,044 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-23 12:41:11,046 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-23 12:41:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:11,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:41:11,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:11,306 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-23 12:41:11,317 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-23 12:41:11,331 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-23 12:41:11,337 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-23 12:41:11,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:41:11,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:11,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966144263] [2022-07-23 12:41:11,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966144263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:41:11,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:41:11,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:41:11,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373222907] [2022-07-23 12:41:11,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:41:11,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:41:11,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:41:11,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:41:11,340 INFO L87 Difference]: Start difference. First operand 1674 states and 1822 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:13,940 INFO L93 Difference]: Finished difference Result 1673 states and 1821 transitions. [2022-07-23 12:41:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:41:13,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-23 12:41:13,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:13,950 INFO L225 Difference]: With dead ends: 1673 [2022-07-23 12:41:13,950 INFO L226 Difference]: Without dead ends: 1673 [2022-07-23 12:41:13,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:41:13,952 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:13,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4160 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-23 12:41:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-07-23 12:41:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-07-23 12:41:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 976 states have (on average 1.8432377049180328) internal successors, (1799), 1664 states have internal predecessors, (1799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:41:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1821 transitions. [2022-07-23 12:41:13,991 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1821 transitions. Word has length 58 [2022-07-23 12:41:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:13,992 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1821 transitions. [2022-07-23 12:41:13,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1821 transitions. [2022-07-23 12:41:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 12:41:13,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:13,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:14,013 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-23 12:41:14,202 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-23 12:41:14,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-23 12:41:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:14,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626704710] [2022-07-23 12:41:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:14,205 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-23 12:41:14,207 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-23 12:41:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:14,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 12:41:14,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:14,436 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-23 12:41:14,453 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-23 12:41:14,458 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-23 12:41:14,497 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-23 12:41:14,500 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-23 12:41:14,509 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-23 12:41:14,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:41:14,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:14,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626704710] [2022-07-23 12:41:14,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626704710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:41:14,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:41:14,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:41:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523287188] [2022-07-23 12:41:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:41:14,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:41:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:41:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:41:14,511 INFO L87 Difference]: Start difference. First operand 1673 states and 1821 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:17,930 INFO L93 Difference]: Finished difference Result 1672 states and 1820 transitions. [2022-07-23 12:41:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:41:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-23 12:41:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:17,934 INFO L225 Difference]: With dead ends: 1672 [2022-07-23 12:41:17,934 INFO L226 Difference]: Without dead ends: 1672 [2022-07-23 12:41:17,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:41:17,934 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 2 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4218 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:17,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4218 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-23 12:41:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2022-07-23 12:41:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2022-07-23 12:41:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 975 states have (on average 1.8441025641025641) internal successors, (1798), 1663 states have internal predecessors, (1798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:41:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1820 transitions. [2022-07-23 12:41:17,948 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1820 transitions. Word has length 58 [2022-07-23 12:41:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:17,948 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1820 transitions. [2022-07-23 12:41:17,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:41:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1820 transitions. [2022-07-23 12:41:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 12:41:17,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:17,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:17,961 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-23 12:41:18,159 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-23 12:41:18,159 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:18,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1810601854, now seen corresponding path program 1 times [2022-07-23 12:41:18,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:18,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414404883] [2022-07-23 12:41:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:18,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:18,162 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-23 12:41:18,164 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-23 12:41:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:18,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:41:18,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:18,449 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-23 12:41:18,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:41:18,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:18,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414404883] [2022-07-23 12:41:18,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414404883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:41:18,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:41:18,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:41:18,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022583416] [2022-07-23 12:41:18,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:41:18,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:41:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:18,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:41:18,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:41:18,452 INFO L87 Difference]: Start difference. First operand 1672 states and 1820 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 12:41:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:18,499 INFO L93 Difference]: Finished difference Result 1675 states and 1825 transitions. [2022-07-23 12:41:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:41:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-07-23 12:41:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:18,504 INFO L225 Difference]: With dead ends: 1675 [2022-07-23 12:41:18,504 INFO L226 Difference]: Without dead ends: 1675 [2022-07-23 12:41:18,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:41:18,505 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 2 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4894 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:18,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4894 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:41:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-07-23 12:41:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-07-23 12:41:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 977 states have (on average 1.8433981576253837) internal successors, (1801), 1666 states have internal predecessors, (1801), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:41:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1825 transitions. [2022-07-23 12:41:18,523 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1825 transitions. Word has length 66 [2022-07-23 12:41:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:18,524 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 1825 transitions. [2022-07-23 12:41:18,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 12:41:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1825 transitions. [2022-07-23 12:41:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 12:41:18,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:18,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:18,541 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-23 12:41:18,734 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-23 12:41:18,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:18,735 INFO L85 PathProgramCache]: Analyzing trace with hash 279721407, now seen corresponding path program 1 times [2022-07-23 12:41:18,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:18,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538045845] [2022-07-23 12:41:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:41:18,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:18,746 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-23 12:41:18,748 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-23 12:41:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:41:19,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:41:19,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:19,021 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-23 12:41:19,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:41:19,084 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-23 12:41:19,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:19,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538045845] [2022-07-23 12:41:19,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538045845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:41:19,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:41:19,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 12:41:19,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460775701] [2022-07-23 12:41:19,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:41:19,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:41:19,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:19,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:41:19,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:41:19,086 INFO L87 Difference]: Start difference. First operand 1675 states and 1825 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:19,263 INFO L93 Difference]: Finished difference Result 1687 states and 1843 transitions. [2022-07-23 12:41:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:41:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-23 12:41:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:19,280 INFO L225 Difference]: With dead ends: 1687 [2022-07-23 12:41:19,281 INFO L226 Difference]: Without dead ends: 1687 [2022-07-23 12:41:19,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-23 12:41:19,282 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 15 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9771 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:19,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9771 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:41:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-07-23 12:41:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1685. [2022-07-23 12:41:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 986 states have (on average 1.841784989858012) internal successors, (1816), 1675 states have internal predecessors, (1816), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:41:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1840 transitions. [2022-07-23 12:41:19,303 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1840 transitions. Word has length 67 [2022-07-23 12:41:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:19,303 INFO L495 AbstractCegarLoop]: Abstraction has 1685 states and 1840 transitions. [2022-07-23 12:41:19,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1840 transitions. [2022-07-23 12:41:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 12:41:19,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:19,304 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:19,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-23 12:41:19,511 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-23 12:41:19,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -431906882, now seen corresponding path program 2 times [2022-07-23 12:41:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990881579] [2022-07-23 12:41:19,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:41:19,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:19,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:19,514 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-23 12:41:19,515 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-23 12:41:19,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 12:41:19,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:41:20,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:41:20,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:20,054 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-23 12:41:20,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:41:20,179 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-23 12:41:20,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:20,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990881579] [2022-07-23 12:41:20,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990881579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:41:20,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:41:20,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 12:41:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633034594] [2022-07-23 12:41:20,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:41:20,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 12:41:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:20,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 12:41:20,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 12:41:20,181 INFO L87 Difference]: Start difference. First operand 1685 states and 1840 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:20,701 INFO L93 Difference]: Finished difference Result 1706 states and 1872 transitions. [2022-07-23 12:41:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 12:41:20,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-23 12:41:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:20,706 INFO L225 Difference]: With dead ends: 1706 [2022-07-23 12:41:20,706 INFO L226 Difference]: Without dead ends: 1702 [2022-07-23 12:41:20,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-23 12:41:20,709 INFO L413 NwaCegarLoop]: 1637 mSDtfsCounter, 57 mSDsluCounter, 9790 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 11427 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:20,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 11427 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:41:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-07-23 12:41:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1694. [2022-07-23 12:41:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 995 states have (on average 1.8371859296482411) internal successors, (1828), 1684 states have internal predecessors, (1828), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:41:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 1852 transitions. [2022-07-23 12:41:20,734 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 1852 transitions. Word has length 70 [2022-07-23 12:41:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:20,734 INFO L495 AbstractCegarLoop]: Abstraction has 1694 states and 1852 transitions. [2022-07-23 12:41:20,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1852 transitions. [2022-07-23 12:41:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 12:41:20,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:20,739 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:20,759 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-23 12:41:20,949 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-23 12:41:20,950 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:20,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:20,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1909247970, now seen corresponding path program 3 times [2022-07-23 12:41:20,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:20,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703467407] [2022-07-23 12:41:20,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 12:41:20,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:20,954 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-23 12:41:20,955 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-23 12:41:21,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 12:41:21,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:41:21,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 12:41:21,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:41:21,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:41:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:41:22,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:22,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703467407] [2022-07-23 12:41:22,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703467407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:41:22,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:41:22,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 12:41:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806451662] [2022-07-23 12:41:22,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:41:22,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 12:41:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 12:41:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 12:41:22,171 INFO L87 Difference]: Start difference. First operand 1694 states and 1852 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:24,764 INFO L93 Difference]: Finished difference Result 1736 states and 1928 transitions. [2022-07-23 12:41:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 12:41:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-23 12:41:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:24,767 INFO L225 Difference]: With dead ends: 1736 [2022-07-23 12:41:24,768 INFO L226 Difference]: Without dead ends: 1730 [2022-07-23 12:41:24,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 12:41:24,769 INFO L413 NwaCegarLoop]: 1641 mSDtfsCounter, 129 mSDsluCounter, 17996 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 19637 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:24,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 19637 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 12:41:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-07-23 12:41:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1712. [2022-07-23 12:41:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1013 states have (on average 1.8272458045409674) internal successors, (1851), 1702 states have internal predecessors, (1851), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:41:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 1875 transitions. [2022-07-23 12:41:24,789 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 1875 transitions. Word has length 76 [2022-07-23 12:41:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:24,789 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 1875 transitions. [2022-07-23 12:41:24,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 1875 transitions. [2022-07-23 12:41:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 12:41:24,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:24,790 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:24,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-23 12:41:25,015 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-23 12:41:25,015 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2142570274, now seen corresponding path program 4 times [2022-07-23 12:41:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:25,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639092585] [2022-07-23 12:41:25,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 12:41:25,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:25,018 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-23 12:41:25,020 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-23 12:41:25,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 12:41:25,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:41:25,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 12:41:25,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:41:25,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:41:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:41:26,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639092585] [2022-07-23 12:41:26,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639092585] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:41:26,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:41:26,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 12:41:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061022633] [2022-07-23 12:41:26,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:41:26,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 12:41:26,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:41:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 12:41:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 12:41:26,926 INFO L87 Difference]: Start difference. First operand 1712 states and 1875 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:41:37,143 INFO L93 Difference]: Finished difference Result 1792 states and 2008 transitions. [2022-07-23 12:41:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 12:41:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-23 12:41:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:41:37,146 INFO L225 Difference]: With dead ends: 1792 [2022-07-23 12:41:37,146 INFO L226 Difference]: Without dead ends: 1788 [2022-07-23 12:41:37,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 12:41:37,149 INFO L413 NwaCegarLoop]: 1654 mSDtfsCounter, 413 mSDsluCounter, 37931 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 39585 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 12:41:37,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 39585 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 12:41:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-07-23 12:41:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1746. [2022-07-23 12:41:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1047 states have (on average 1.8118433619866285) internal successors, (1897), 1736 states have internal predecessors, (1897), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:41:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 1921 transitions. [2022-07-23 12:41:37,163 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 1921 transitions. Word has length 88 [2022-07-23 12:41:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:41:37,163 INFO L495 AbstractCegarLoop]: Abstraction has 1746 states and 1921 transitions. [2022-07-23 12:41:37,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:41:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 1921 transitions. [2022-07-23 12:41:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 12:41:37,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:41:37,164 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:41:37,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-23 12:41:37,375 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-23 12:41:37,376 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:41:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:41:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash 286593598, now seen corresponding path program 5 times [2022-07-23 12:41:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:41:37,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516337018] [2022-07-23 12:41:37,377 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:41:37,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:41:37,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:41:37,379 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-23 12:41:37,382 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-23 12:41:38,611 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:41:38,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:41:38,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 12:41:38,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:41:38,670 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-23 12:41:38,739 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:41:38,739 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-23 12:41:38,756 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-23 12:41:38,803 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 22 treesize of output 10 [2022-07-23 12:41:39,121 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1608)))) is different from true [2022-07-23 12:41:39,436 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1621) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:41:39,993 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:41:39,993 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-23 12:41:40,027 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-23 12:41:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-07-23 12:41:40,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:41:40,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:41:40,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516337018] [2022-07-23 12:41:40,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516337018] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:41:40,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1433997023] [2022-07-23 12:41:40,256 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:41:40,256 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:41:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:41:40,258 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 12:41:40,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-23 12:43:12,957 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:43:12,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:43:13,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-23 12:43:13,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:43:13,227 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-23 12:43:13,284 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:43:13,285 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-23 12:43:13,301 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-23 12:43:13,338 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 22 treesize of output 10 [2022-07-23 12:43:13,762 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2062) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:43:14,149 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2081)))) is different from true [2022-07-23 12:43:14,425 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:43:14,425 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-23 12:43:14,452 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-23 12:43:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-07-23 12:43:14,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:43:14,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1433997023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:43:14,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:43:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2022-07-23 12:43:14,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657933279] [2022-07-23 12:43:14,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:43:14,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 12:43:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:43:14,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 12:43:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=97, Unknown=14, NotChecked=92, Total=240 [2022-07-23 12:43:14,670 INFO L87 Difference]: Start difference. First operand 1746 states and 1921 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 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-23 12:43:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:43:19,115 INFO L93 Difference]: Finished difference Result 2069 states and 2231 transitions. [2022-07-23 12:43:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 12:43:19,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 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 110 [2022-07-23 12:43:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:43:19,119 INFO L225 Difference]: With dead ends: 2069 [2022-07-23 12:43:19,119 INFO L226 Difference]: Without dead ends: 2065 [2022-07-23 12:43:19,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 88 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=16, NotChecked=108, Total=306 [2022-07-23 12:43:19,120 INFO L413 NwaCegarLoop]: 1056 mSDtfsCounter, 1139 mSDsluCounter, 4752 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 5808 SdHoareTripleChecker+Invalid, 13055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9637 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:43:19,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 5808 Invalid, 13055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3406 Invalid, 0 Unknown, 9637 Unchecked, 4.3s Time] [2022-07-23 12:43:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2022-07-23 12:43:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1794. [2022-07-23 12:43:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1095 states have (on average 1.7762557077625571) internal successors, (1945), 1783 states have internal predecessors, (1945), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:43:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 1969 transitions. [2022-07-23 12:43:19,139 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 1969 transitions. Word has length 110 [2022-07-23 12:43:19,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:43:19,139 INFO L495 AbstractCegarLoop]: Abstraction has 1794 states and 1969 transitions. [2022-07-23 12:43:19,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 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-23 12:43:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 1969 transitions. [2022-07-23 12:43:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 12:43:19,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:43:19,140 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:43:19,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-23 12:43:19,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-23 12:43:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 12:43:19,555 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:43:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:43:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 286593599, now seen corresponding path program 1 times [2022-07-23 12:43:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:43:19,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401634978] [2022-07-23 12:43:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:43:19,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:43:19,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:43:19,558 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:43:19,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 12:43:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:43:20,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-23 12:43:20,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:43:20,377 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-23 12:43:20,447 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:43:20,448 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-23 12:43:20,454 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 6 treesize of output 5 [2022-07-23 12:43:20,468 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-23 12:43:20,475 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-23 12:43:20,547 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 22 treesize of output 10 [2022-07-23 12:43:20,552 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 9 treesize of output 3 [2022-07-23 12:43:20,625 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:43:20,634 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-23 12:43:20,642 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:43:20,651 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:43:20,706 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-23 12:43:20,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:43:20,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:43:20,756 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-23 12:43:20,765 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:43:20,796 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-23 12:43:20,810 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:43:20,841 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-23 12:43:20,850 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534)))) is different from true [2022-07-23 12:43:20,880 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:43:20,890 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:43:20,899 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:43:20,971 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:43:20,979 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552)))) is different from true [2022-07-23 12:43:21,009 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:43:21,066 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563)))) is different from true [2022-07-23 12:43:21,079 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564)))) is different from true [2022-07-23 12:43:21,087 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566)))) is different from true [2022-07-23 12:43:21,122 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:43:21,132 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:43:21,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:43:21,214 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2581))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580)))) is different from true [2022-07-23 12:43:21,223 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582)))) is different from true [2022-07-23 12:43:21,232 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:43:21,273 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:43:21,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 12:43:21,277 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-23 12:43:21,302 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-23 12:43:21,306 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-23 12:43:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-07-23 12:43:21,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:43:21,943 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-23 12:43:21,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:43:21,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401634978] [2022-07-23 12:43:21,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401634978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:43:21,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1161159191] [2022-07-23 12:43:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:43:21,948 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:43:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:43:21,950 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 12:43:21,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process