./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:54:19,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:54:19,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:54:19,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:54:19,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:54:19,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:54:19,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:54:19,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:54:19,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:54:19,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:54:19,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:54:19,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:54:19,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:54:19,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:54:19,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:54:19,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:54:19,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:54:19,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:54:19,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:54:19,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:54:19,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:54:19,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:54:19,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:54:19,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:54:19,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:54:19,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:54:19,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:54:19,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:54:19,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:54:19,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:54:19,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:54:19,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:54:19,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:54:19,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:54:19,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:54:19,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:54:19,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:54:19,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:54:19,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:54:19,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:54:19,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:54:19,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-19 13:54:19,814 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:54:19,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:54:19,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:54:19,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:54:19,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:54:19,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:54:19,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:54:19,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:54:19,817 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:54:19,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:54:19,818 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:54:19,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:54:19,819 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:54:19,819 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:54:19,819 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:54:19,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:54:19,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:54:19,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:54:19,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:54:19,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:54:19,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:54:19,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 13:54:19,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-19 13:54:19,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:54:19,821 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2021-12-19 13:54:19,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:54:20,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:54:20,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:54:20,019 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:54:20,019 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:54:20,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2021-12-19 13:54:20,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f93e247/5d61f07e776a43e5bd8c49b4dfe67beb/FLAG8b8269655 [2021-12-19 13:54:20,529 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:54:20,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2021-12-19 13:54:20,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f93e247/5d61f07e776a43e5bd8c49b4dfe67beb/FLAG8b8269655 [2021-12-19 13:54:20,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f93e247/5d61f07e776a43e5bd8c49b4dfe67beb [2021-12-19 13:54:20,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:54:20,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:54:20,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:54:20,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:54:20,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:54:20,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:54:20" (1/1) ... [2021-12-19 13:54:20,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636588d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:20, skipping insertion in model container [2021-12-19 13:54:20,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:54:20" (1/1) ... [2021-12-19 13:54:20,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:54:20,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:54:21,306 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_SAX_test6-2.i[44118,44131] [2021-12-19 13:54:21,318 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_SAX_test6-2.i[44660,44673] [2021-12-19 13:54:21,438 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_SAX_test6-2.i[56247,56260] [2021-12-19 13:54:21,443 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_SAX_test6-2.i[56368,56381] [2021-12-19 13:54:21,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:54:21,477 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-19 13:54:21,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@16c46528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:21, skipping insertion in model container [2021-12-19 13:54:21,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:54:21,479 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-19 13:54:21,480 INFO L158 Benchmark]: Toolchain (without parser) took 637.57ms. Allocated memory is still 130.0MB. Free memory was 97.3MB in the beginning and 92.0MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 13:54:21,480 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 13:54:21,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.69ms. Allocated memory is still 130.0MB. Free memory was 97.3MB in the beginning and 92.0MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 13:54:21,482 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.15ms. Allocated memory is still 100.7MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.69ms. Allocated memory is still 130.0MB. Free memory was 97.3MB in the beginning and 92.0MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:54:23,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:54:23,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:54:23,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:54:23,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:54:23,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:54:23,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:54:23,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:54:23,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:54:23,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:54:23,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:54:23,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:54:23,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:54:23,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:54:23,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:54:23,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:54:23,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:54:23,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:54:23,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:54:23,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:54:23,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:54:23,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:54:23,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:54:23,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:54:23,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:54:23,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:54:23,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:54:23,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:54:23,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:54:23,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:54:23,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:54:23,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:54:23,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:54:23,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:54:23,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:54:23,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:54:23,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:54:23,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:54:23,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:54:23,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:54:23,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:54:23,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-19 13:54:23,283 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:54:23,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:54:23,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:54:23,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:54:23,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:54:23,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:54:23,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:54:23,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:54:23,287 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:54:23,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:54:23,288 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:54:23,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:54:23,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:54:23,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:54:23,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-19 13:54:23,289 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:54:23,290 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:54:23,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:54:23,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:54:23,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:54:23,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:54:23,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:54:23,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:54:23,291 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-19 13:54:23,291 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-19 13:54:23,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:54:23,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-19 13:54:23,291 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2021-12-19 13:54:23,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:54:23,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:54:23,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:54:23,601 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:54:23,601 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:54:23,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2021-12-19 13:54:23,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f841ae/eb308253b1604e27b20fc566e555f442/FLAG2134938e2 [2021-12-19 13:54:24,066 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:54:24,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2021-12-19 13:54:24,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f841ae/eb308253b1604e27b20fc566e555f442/FLAG2134938e2 [2021-12-19 13:54:24,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f841ae/eb308253b1604e27b20fc566e555f442 [2021-12-19 13:54:24,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:54:24,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:54:24,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:54:24,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:54:24,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:54:24,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:54:24" (1/1) ... [2021-12-19 13:54:24,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4648c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:24, skipping insertion in model container [2021-12-19 13:54:24,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:54:24" (1/1) ... [2021-12-19 13:54:24,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:54:24,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:54:24,872 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_SAX_test6-2.i[44118,44131] [2021-12-19 13:54:24,880 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_SAX_test6-2.i[44660,44673] [2021-12-19 13:54:24,980 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_SAX_test6-2.i[56247,56260] [2021-12-19 13:54:24,982 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_SAX_test6-2.i[56368,56381] [2021-12-19 13:54:24,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:54:25,010 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-19 13:54:25,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:54:25,074 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_SAX_test6-2.i[44118,44131] [2021-12-19 13:54:25,076 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_SAX_test6-2.i[44660,44673] [2021-12-19 13:54:25,141 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_SAX_test6-2.i[56247,56260] [2021-12-19 13:54:25,142 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_SAX_test6-2.i[56368,56381] [2021-12-19 13:54:25,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:54:25,173 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 13:54:25,211 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_SAX_test6-2.i[44118,44131] [2021-12-19 13:54:25,214 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_SAX_test6-2.i[44660,44673] [2021-12-19 13:54:25,280 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_SAX_test6-2.i[56247,56260] [2021-12-19 13:54:25,282 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_SAX_test6-2.i[56368,56381] [2021-12-19 13:54:25,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:54:25,341 INFO L208 MainTranslator]: Completed translation [2021-12-19 13:54:25,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25 WrapperNode [2021-12-19 13:54:25,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:54:25,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 13:54:25,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 13:54:25,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 13:54:25,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,441 INFO L137 Inliner]: procedures = 285, calls = 347, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1204 [2021-12-19 13:54:25,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 13:54:25,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 13:54:25,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 13:54:25,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 13:54:25,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 13:54:25,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 13:54:25,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 13:54:25,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 13:54:25,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (1/1) ... [2021-12-19 13:54:25,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:54:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 13:54:25,657 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) [2021-12-19 13:54:25,675 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 [2021-12-19 13:54:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-19 13:54:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-19 13:54:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 13:54:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-19 13:54:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-19 13:54:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 13:54:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-19 13:54:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-19 13:54:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2021-12-19 13:54:25,690 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2021-12-19 13:54:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-19 13:54:25,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-19 13:54:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-19 13:54:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 13:54:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2021-12-19 13:54:25,691 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2021-12-19 13:54:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-19 13:54:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2021-12-19 13:54:25,692 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2021-12-19 13:54:25,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 13:54:25,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 13:54:25,890 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 13:54:25,904 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 13:54:29,516 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 13:54:29,548 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 13:54:29,550 INFO L301 CfgBuilder]: Removed 72 assume(true) statements. [2021-12-19 13:54:29,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:54:29 BoogieIcfgContainer [2021-12-19 13:54:29,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 13:54:29,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-19 13:54:29,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-19 13:54:29,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-19 13:54:29,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:54:24" (1/3) ... [2021-12-19 13:54:29,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c32c7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:54:29, skipping insertion in model container [2021-12-19 13:54:29,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:54:25" (2/3) ... [2021-12-19 13:54:29,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c32c7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:54:29, skipping insertion in model container [2021-12-19 13:54:29,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:54:29" (3/3) ... [2021-12-19 13:54:29,560 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2021-12-19 13:54:29,564 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-19 13:54:29,564 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2021-12-19 13:54:29,604 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-19 13:54:29,610 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-19 13:54:29,610 INFO L340 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2021-12-19 13:54:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 1280 states, 626 states have (on average 2.2444089456869007) internal successors, (1405), 1260 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-19 13:54:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:54:29,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:29,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:54:29,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2021-12-19 13:54:29,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:29,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143143411] [2021-12-19 13:54:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:29,664 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:29,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:29,667 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) [2021-12-19 13:54:29,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-19 13:54:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:29,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:54:29,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:29,872 INFO L388 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 [2021-12-19 13:54:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:29,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:29,898 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:29,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143143411] [2021-12-19 13:54:29,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143143411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:29,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:29,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:54:29,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076627497] [2021-12-19 13:54:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:29,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:54:29,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:54:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:54:29,933 INFO L87 Difference]: Start difference. First operand has 1280 states, 626 states have (on average 2.2444089456869007) internal successors, (1405), 1260 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:31,765 INFO L93 Difference]: Finished difference Result 1537 states and 1627 transitions. [2021-12-19 13:54:31,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:54:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-19 13:54:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:31,790 INFO L225 Difference]: With dead ends: 1537 [2021-12-19 13:54:31,791 INFO L226 Difference]: Without dead ends: 1535 [2021-12-19 13:54:31,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:54:31,800 INFO L933 BasicCegarLoop]: 911 mSDtfsCounter, 906 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:31,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 1258 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-19 13:54:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2021-12-19 13:54:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1300. [2021-12-19 13:54:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 660 states have (on average 2.106060606060606) internal successors, (1390), 1281 states have internal predecessors, (1390), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 13:54:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1420 transitions. [2021-12-19 13:54:31,908 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1420 transitions. Word has length 3 [2021-12-19 13:54:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:31,908 INFO L470 AbstractCegarLoop]: Abstraction has 1300 states and 1420 transitions. [2021-12-19 13:54:31,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1420 transitions. [2021-12-19 13:54:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:54:31,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:31,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:54:31,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:32,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:32,117 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2021-12-19 13:54:32,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:32,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293872898] [2021-12-19 13:54:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:32,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:32,121 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) [2021-12-19 13:54:32,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-19 13:54:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:32,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:54:32,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:32,236 INFO L388 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 [2021-12-19 13:54:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:32,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:32,246 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:32,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293872898] [2021-12-19 13:54:32,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293872898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:32,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:32,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:54:32,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430990847] [2021-12-19 13:54:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:32,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:54:32,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:54:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:54:32,249 INFO L87 Difference]: Start difference. First operand 1300 states and 1420 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:34,673 INFO L93 Difference]: Finished difference Result 1891 states and 2058 transitions. [2021-12-19 13:54:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:54:34,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-19 13:54:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:34,679 INFO L225 Difference]: With dead ends: 1891 [2021-12-19 13:54:34,679 INFO L226 Difference]: Without dead ends: 1891 [2021-12-19 13:54:34,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:54:34,680 INFO L933 BasicCegarLoop]: 1055 mSDtfsCounter, 624 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:34,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 1758 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-19 13:54:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-12-19 13:54:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1504. [2021-12-19 13:54:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 863 states have (on average 2.0880648899188876) internal successors, (1802), 1483 states have internal predecessors, (1802), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:54:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1836 transitions. [2021-12-19 13:54:34,754 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1836 transitions. Word has length 3 [2021-12-19 13:54:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:34,755 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 1836 transitions. [2021-12-19 13:54:34,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1836 transitions. [2021-12-19 13:54:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-19 13:54:34,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:34,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:54:34,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-19 13:54:34,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:34,963 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2021-12-19 13:54:34,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:34,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131568563] [2021-12-19 13:54:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:34,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:34,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:34,966 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) [2021-12-19 13:54:34,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-19 13:54:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:35,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:54:35,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:35,116 INFO L388 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 [2021-12-19 13:54:35,122 INFO L388 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 [2021-12-19 13:54:35,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:54:35,195 INFO L388 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 [2021-12-19 13:54:35,205 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:54:35,206 INFO L388 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 14 treesize of output 14 [2021-12-19 13:54:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:35,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:35,235 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:35,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131568563] [2021-12-19 13:54:35,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131568563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:35,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:35,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:54:35,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917737239] [2021-12-19 13:54:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:35,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:35,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:35,238 INFO L87 Difference]: Start difference. First operand 1504 states and 1836 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-19 13:54:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:38,971 INFO L93 Difference]: Finished difference Result 2569 states and 2979 transitions. [2021-12-19 13:54:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:54:38,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-19 13:54:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:38,978 INFO L225 Difference]: With dead ends: 2569 [2021-12-19 13:54:38,979 INFO L226 Difference]: Without dead ends: 2569 [2021-12-19 13:54:38,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:38,980 INFO L933 BasicCegarLoop]: 718 mSDtfsCounter, 2002 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:38,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2008 Valid, 1477 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-19 13:54:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2021-12-19 13:54:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1649. [2021-12-19 13:54:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1008 states have (on average 2.068452380952381) internal successors, (2085), 1628 states have internal predecessors, (2085), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:54:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2119 transitions. [2021-12-19 13:54:39,032 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2119 transitions. Word has length 8 [2021-12-19 13:54:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:39,035 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2119 transitions. [2021-12-19 13:54:39,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-19 13:54:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2119 transitions. [2021-12-19 13:54:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 13:54:39,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:39,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:54:39,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-19 13:54:39,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:39,247 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:39,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2021-12-19 13:54:39,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:39,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360659341] [2021-12-19 13:54:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:39,248 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:39,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:39,250 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) [2021-12-19 13:54:39,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-19 13:54:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:39,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:54:39,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:39,374 INFO L388 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 [2021-12-19 13:54:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:39,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:39,393 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:39,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360659341] [2021-12-19 13:54:39,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360659341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:39,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:39,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:54:39,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443617505] [2021-12-19 13:54:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:39,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:39,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:39,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:39,397 INFO L87 Difference]: Start difference. First operand 1649 states and 2119 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:54:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:42,082 INFO L93 Difference]: Finished difference Result 2811 states and 3512 transitions. [2021-12-19 13:54:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:54:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-19 13:54:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:42,090 INFO L225 Difference]: With dead ends: 2811 [2021-12-19 13:54:42,096 INFO L226 Difference]: Without dead ends: 2811 [2021-12-19 13:54:42,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:42,097 INFO L933 BasicCegarLoop]: 1321 mSDtfsCounter, 2333 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:42,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2339 Valid, 2579 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-19 13:54:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2021-12-19 13:54:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 1604. [2021-12-19 13:54:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1008 states have (on average 2.009920634920635) internal successors, (2026), 1583 states have internal predecessors, (2026), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:54:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2060 transitions. [2021-12-19 13:54:42,127 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2060 transitions. Word has length 9 [2021-12-19 13:54:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:42,128 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2060 transitions. [2021-12-19 13:54:42,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:54:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2060 transitions. [2021-12-19 13:54:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 13:54:42,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:42,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:54:42,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:42,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:42,336 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:42,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2021-12-19 13:54:42,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:42,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147835435] [2021-12-19 13:54:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:42,337 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:42,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:42,338 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) [2021-12-19 13:54:42,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-19 13:54:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:42,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:54:42,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:42,486 INFO L388 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 [2021-12-19 13:54:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:42,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:42,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:42,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147835435] [2021-12-19 13:54:42,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147835435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:42,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:42,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:54:42,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747434706] [2021-12-19 13:54:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:42,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:42,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:42,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:42,529 INFO L87 Difference]: Start difference. First operand 1604 states and 2060 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:54:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:45,628 INFO L93 Difference]: Finished difference Result 2440 states and 3105 transitions. [2021-12-19 13:54:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:54:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-19 13:54:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:45,635 INFO L225 Difference]: With dead ends: 2440 [2021-12-19 13:54:45,636 INFO L226 Difference]: Without dead ends: 2440 [2021-12-19 13:54:45,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:45,639 INFO L933 BasicCegarLoop]: 1513 mSDtfsCounter, 1581 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:45,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1586 Valid, 2720 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-19 13:54:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2021-12-19 13:54:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 1594. [2021-12-19 13:54:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1008 states have (on average 1.9861111111111112) internal successors, (2002), 1573 states have internal predecessors, (2002), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:54:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2036 transitions. [2021-12-19 13:54:45,668 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2036 transitions. Word has length 9 [2021-12-19 13:54:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:45,669 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2036 transitions. [2021-12-19 13:54:45,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:54:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2036 transitions. [2021-12-19 13:54:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-19 13:54:45,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:45,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:54:45,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:45,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:45,881 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -856298529, now seen corresponding path program 1 times [2021-12-19 13:54:45,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:45,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861994472] [2021-12-19 13:54:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:45,884 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:45,885 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) [2021-12-19 13:54:45,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-19 13:54:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:46,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:54:46,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:46,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:46,072 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:46,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861994472] [2021-12-19 13:54:46,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861994472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:46,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:46,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:54:46,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664108577] [2021-12-19 13:54:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:46,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:46,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:46,074 INFO L87 Difference]: Start difference. First operand 1594 states and 2036 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-19 13:54:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:46,699 INFO L93 Difference]: Finished difference Result 2264 states and 2809 transitions. [2021-12-19 13:54:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:54:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2021-12-19 13:54:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:46,706 INFO L225 Difference]: With dead ends: 2264 [2021-12-19 13:54:46,706 INFO L226 Difference]: Without dead ends: 2264 [2021-12-19 13:54:46,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:46,707 INFO L933 BasicCegarLoop]: 1454 mSDtfsCounter, 748 mSDsluCounter, 2419 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:46,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 3873 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-19 13:54:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2021-12-19 13:54:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1852. [2021-12-19 13:54:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1263 states have (on average 1.990498812351544) internal successors, (2514), 1828 states have internal predecessors, (2514), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-19 13:54:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2554 transitions. [2021-12-19 13:54:46,735 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2554 transitions. Word has length 11 [2021-12-19 13:54:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:46,736 INFO L470 AbstractCegarLoop]: Abstraction has 1852 states and 2554 transitions. [2021-12-19 13:54:46,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-19 13:54:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2554 transitions. [2021-12-19 13:54:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-19 13:54:46,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:46,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:54:46,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:46,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:46,945 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2126591358, now seen corresponding path program 1 times [2021-12-19 13:54:46,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:46,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427493869] [2021-12-19 13:54:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:46,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:46,947 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) [2021-12-19 13:54:46,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-19 13:54:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:47,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:54:47,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:47,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:54:47,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:54:47,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:54:47,217 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-19 13:54:47,217 INFO L388 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-19 13:54:47,247 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-19 13:54:47,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-19 13:54:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:47,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:47,269 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:47,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427493869] [2021-12-19 13:54:47,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427493869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:47,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:47,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:54:47,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367696183] [2021-12-19 13:54:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:47,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:47,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:47,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:47,270 INFO L87 Difference]: Start difference. First operand 1852 states and 2554 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:48,545 INFO L93 Difference]: Finished difference Result 2000 states and 2409 transitions. [2021-12-19 13:54:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:54:48,547 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-19 13:54:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:48,551 INFO L225 Difference]: With dead ends: 2000 [2021-12-19 13:54:48,552 INFO L226 Difference]: Without dead ends: 2000 [2021-12-19 13:54:48,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:48,552 INFO L933 BasicCegarLoop]: 1391 mSDtfsCounter, 501 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:48,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 3873 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-19 13:54:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2021-12-19 13:54:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1494. [2021-12-19 13:54:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 907 states have (on average 1.9757442116868797) internal successors, (1792), 1472 states have internal predecessors, (1792), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:54:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1828 transitions. [2021-12-19 13:54:48,571 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1828 transitions. Word has length 14 [2021-12-19 13:54:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:48,571 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 1828 transitions. [2021-12-19 13:54:48,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1828 transitions. [2021-12-19 13:54:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-19 13:54:48,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:48,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:54:48,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:48,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:48,781 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2021-12-19 13:54:48,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:48,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230082610] [2021-12-19 13:54:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:48,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:48,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:48,783 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) [2021-12-19 13:54:48,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-19 13:54:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:48,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 13:54:48,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:48,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:48,954 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:48,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230082610] [2021-12-19 13:54:48,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230082610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:48,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:48,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:54:48,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537923322] [2021-12-19 13:54:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:48,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:54:48,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:54:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:54:48,956 INFO L87 Difference]: Start difference. First operand 1494 states and 1828 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:48,976 INFO L93 Difference]: Finished difference Result 1434 states and 1742 transitions. [2021-12-19 13:54:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:54:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-19 13:54:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:48,979 INFO L225 Difference]: With dead ends: 1434 [2021-12-19 13:54:48,980 INFO L226 Difference]: Without dead ends: 1434 [2021-12-19 13:54:48,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:54:48,980 INFO L933 BasicCegarLoop]: 1239 mSDtfsCounter, 1165 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1308 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 [2021-12-19 13:54:48,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 1308 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:54:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2021-12-19 13:54:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2021-12-19 13:54:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 871 states have (on average 1.9586681974741675) internal successors, (1706), 1412 states have internal predecessors, (1706), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:54:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1742 transitions. [2021-12-19 13:54:48,996 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1742 transitions. Word has length 19 [2021-12-19 13:54:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:48,996 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1742 transitions. [2021-12-19 13:54:48,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1742 transitions. [2021-12-19 13:54:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-19 13:54:48,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:48,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:54:49,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:49,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:49,206 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:49,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2021-12-19 13:54:49,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:49,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443842967] [2021-12-19 13:54:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:49,207 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:49,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:49,208 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) [2021-12-19 13:54:49,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-19 13:54:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:49,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:54:49,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:49,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:49,402 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443842967] [2021-12-19 13:54:49,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443842967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:49,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:49,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:54:49,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488184510] [2021-12-19 13:54:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:49,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:49,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:49,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:49,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:49,404 INFO L87 Difference]: Start difference. First operand 1434 states and 1742 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-19 13:54:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:49,455 INFO L93 Difference]: Finished difference Result 1406 states and 1686 transitions. [2021-12-19 13:54:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:54:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2021-12-19 13:54:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:49,459 INFO L225 Difference]: With dead ends: 1406 [2021-12-19 13:54:49,459 INFO L226 Difference]: Without dead ends: 1406 [2021-12-19 13:54:49,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:49,460 INFO L933 BasicCegarLoop]: 1194 mSDtfsCounter, 1136 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 2450 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 [2021-12-19 13:54:49,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1150 Valid, 2450 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:54:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-12-19 13:54:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1404. [2021-12-19 13:54:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 855 states have (on average 1.9274853801169591) internal successors, (1648), 1382 states have internal predecessors, (1648), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:54:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1684 transitions. [2021-12-19 13:54:49,479 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1684 transitions. Word has length 21 [2021-12-19 13:54:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:49,479 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1684 transitions. [2021-12-19 13:54:49,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-19 13:54:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1684 transitions. [2021-12-19 13:54:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 13:54:49,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:49,480 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:54:49,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:49,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:49,688 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2021-12-19 13:54:49,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:49,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403591070] [2021-12-19 13:54:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:49,690 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:49,691 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) [2021-12-19 13:54:49,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-19 13:54:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:49,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:54:49,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:49,856 INFO L388 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 [2021-12-19 13:54:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:49,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:49,935 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403591070] [2021-12-19 13:54:49,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403591070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:49,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:49,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:54:49,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527432142] [2021-12-19 13:54:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:49,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:54:49,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:54:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:49,937 INFO L87 Difference]: Start difference. First operand 1404 states and 1684 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:54:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:52,878 INFO L93 Difference]: Finished difference Result 2572 states and 3080 transitions. [2021-12-19 13:54:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:54:52,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2021-12-19 13:54:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:52,885 INFO L225 Difference]: With dead ends: 2572 [2021-12-19 13:54:52,885 INFO L226 Difference]: Without dead ends: 2572 [2021-12-19 13:54:52,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:54:52,885 INFO L933 BasicCegarLoop]: 1149 mSDtfsCounter, 2421 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:52,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2424 Valid, 2737 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-19 13:54:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-12-19 13:54:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1400. [2021-12-19 13:54:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 855 states have (on average 1.9181286549707601) internal successors, (1640), 1378 states have internal predecessors, (1640), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:54:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1676 transitions. [2021-12-19 13:54:52,902 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1676 transitions. Word has length 35 [2021-12-19 13:54:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:52,903 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1676 transitions. [2021-12-19 13:54:52,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:54:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1676 transitions. [2021-12-19 13:54:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 13:54:52,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:52,906 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:54:52,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-19 13:54:53,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:53,114 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2021-12-19 13:54:53,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:53,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448808744] [2021-12-19 13:54:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:53,115 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:53,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:53,116 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) [2021-12-19 13:54:53,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-19 13:54:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:53,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 13:54:53,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:53,297 INFO L388 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 [2021-12-19 13:54:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:53,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:53,484 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:53,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448808744] [2021-12-19 13:54:53,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448808744] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:53,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:53,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:54:53,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335567311] [2021-12-19 13:54:53,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:53,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:54:53,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:53,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:54:53,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:53,486 INFO L87 Difference]: Start difference. First operand 1400 states and 1676 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:54:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:56,745 INFO L93 Difference]: Finished difference Result 2214 states and 2659 transitions. [2021-12-19 13:54:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 13:54:56,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2021-12-19 13:54:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:56,750 INFO L225 Difference]: With dead ends: 2214 [2021-12-19 13:54:56,750 INFO L226 Difference]: Without dead ends: 2214 [2021-12-19 13:54:56,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:54:56,751 INFO L933 BasicCegarLoop]: 1548 mSDtfsCounter, 2194 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:54:56,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2194 Valid, 3317 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-19 13:54:56,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2021-12-19 13:54:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1396. [2021-12-19 13:54:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 855 states have (on average 1.9087719298245613) internal successors, (1632), 1374 states have internal predecessors, (1632), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:54:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1668 transitions. [2021-12-19 13:54:56,766 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1668 transitions. Word has length 35 [2021-12-19 13:54:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:56,767 INFO L470 AbstractCegarLoop]: Abstraction has 1396 states and 1668 transitions. [2021-12-19 13:54:56,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:54:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1668 transitions. [2021-12-19 13:54:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-19 13:54:56,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:56,768 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:54:56,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-19 13:54:56,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:56,976 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2063645645, now seen corresponding path program 1 times [2021-12-19 13:54:56,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782017914] [2021-12-19 13:54:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:56,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:56,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:56,992 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) [2021-12-19 13:54:56,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-19 13:54:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:57,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:54:57,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:57,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:57,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:57,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782017914] [2021-12-19 13:54:57,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782017914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:57,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:57,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:54:57,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988273548] [2021-12-19 13:54:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:57,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:57,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:57,294 INFO L87 Difference]: Start difference. First operand 1396 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:54:57,335 INFO L93 Difference]: Finished difference Result 1384 states and 1648 transitions. [2021-12-19 13:54:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:54:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-19 13:54:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:54:57,345 INFO L225 Difference]: With dead ends: 1384 [2021-12-19 13:54:57,345 INFO L226 Difference]: Without dead ends: 1384 [2021-12-19 13:54:57,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:54:57,346 INFO L933 BasicCegarLoop]: 1188 mSDtfsCounter, 1112 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 2428 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 [2021-12-19 13:54:57,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 2428 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:54:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2021-12-19 13:54:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2021-12-19 13:54:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 843 states have (on average 1.9122182680901543) internal successors, (1612), 1362 states have internal predecessors, (1612), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:54:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1648 transitions. [2021-12-19 13:54:57,373 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1648 transitions. Word has length 54 [2021-12-19 13:54:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:54:57,373 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1648 transitions. [2021-12-19 13:54:57,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:54:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1648 transitions. [2021-12-19 13:54:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 13:54:57,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:54:57,375 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:54:57,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-19 13:54:57,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:54:57,585 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:54:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:54:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash -202859289, now seen corresponding path program 1 times [2021-12-19 13:54:57,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:54:57,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793270206] [2021-12-19 13:54:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:54:57,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:54:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:54:57,591 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) [2021-12-19 13:54:57,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-19 13:54:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:54:57,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 13:54:57,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:54:57,910 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:54:57,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2021-12-19 13:54:57,938 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 13:54:57,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2021-12-19 13:54:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:54:58,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:54:58,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:54:58,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793270206] [2021-12-19 13:54:58,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793270206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:54:58,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:54:58,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:54:58,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69553572] [2021-12-19 13:54:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:54:58,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:54:58,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:54:58,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:54:58,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:54:58,190 INFO L87 Difference]: Start difference. First operand 1384 states and 1648 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:55:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:01,351 INFO L93 Difference]: Finished difference Result 3213 states and 3778 transitions. [2021-12-19 13:55:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:55:01,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-19 13:55:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:01,358 INFO L225 Difference]: With dead ends: 3213 [2021-12-19 13:55:01,358 INFO L226 Difference]: Without dead ends: 3213 [2021-12-19 13:55:01,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:55:01,358 INFO L933 BasicCegarLoop]: 1287 mSDtfsCounter, 1759 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:01,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1762 Valid, 2677 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-19 13:55:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2021-12-19 13:55:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 1839. [2021-12-19 13:55:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1282 states have (on average 1.8985959438377535) internal successors, (2434), 1804 states have internal predecessors, (2434), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-19 13:55:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2496 transitions. [2021-12-19 13:55:01,384 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2496 transitions. Word has length 62 [2021-12-19 13:55:01,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:01,384 INFO L470 AbstractCegarLoop]: Abstraction has 1839 states and 2496 transitions. [2021-12-19 13:55:01,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:55:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2496 transitions. [2021-12-19 13:55:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 13:55:01,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:01,388 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:55:01,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:01,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:01,599 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -202859288, now seen corresponding path program 1 times [2021-12-19 13:55:01,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675870389] [2021-12-19 13:55:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:01,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:01,601 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) [2021-12-19 13:55:01,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-19 13:55:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:01,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 13:55:01,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:01,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:55:01,969 INFO L388 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 [2021-12-19 13:55:02,023 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:55:02,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-19 13:55:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:02,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:02,580 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675870389] [2021-12-19 13:55:02,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675870389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:02,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:02,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:55:02,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741116655] [2021-12-19 13:55:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:02,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:55:02,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:02,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:55:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:55:02,582 INFO L87 Difference]: Start difference. First operand 1839 states and 2496 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:55:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:06,218 INFO L93 Difference]: Finished difference Result 1845 states and 2503 transitions. [2021-12-19 13:55:06,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:55:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-19 13:55:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:06,223 INFO L225 Difference]: With dead ends: 1845 [2021-12-19 13:55:06,223 INFO L226 Difference]: Without dead ends: 1845 [2021-12-19 13:55:06,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:55:06,223 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 111 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:06,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 3393 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-19 13:55:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2021-12-19 13:55:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1844. [2021-12-19 13:55:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1286 states have (on average 1.895800933125972) internal successors, (2438), 1808 states have internal predecessors, (2438), 32 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-19 13:55:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2502 transitions. [2021-12-19 13:55:06,255 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2502 transitions. Word has length 62 [2021-12-19 13:55:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:06,256 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 2502 transitions. [2021-12-19 13:55:06,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:55:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2502 transitions. [2021-12-19 13:55:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 13:55:06,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:06,257 INFO L514 BasicCegarLoop]: 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, 1] [2021-12-19 13:55:06,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-19 13:55:06,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:06,460 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1136013504, now seen corresponding path program 1 times [2021-12-19 13:55:06,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:06,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892674438] [2021-12-19 13:55:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:06,461 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:06,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:06,462 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) [2021-12-19 13:55:06,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-19 13:55:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:55:06,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:06,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:06,873 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:06,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892674438] [2021-12-19 13:55:06,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892674438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:06,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:06,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 13:55:06,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019518812] [2021-12-19 13:55:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:06,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:55:06,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:55:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:55:06,874 INFO L87 Difference]: Start difference. First operand 1844 states and 2502 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:55:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:06,947 INFO L93 Difference]: Finished difference Result 1870 states and 2529 transitions. [2021-12-19 13:55:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 13:55:06,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-19 13:55:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:06,951 INFO L225 Difference]: With dead ends: 1870 [2021-12-19 13:55:06,951 INFO L226 Difference]: Without dead ends: 1870 [2021-12-19 13:55:06,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:55:06,951 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 19 mSDsluCounter, 4733 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5918 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:06,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 5918 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:55:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2021-12-19 13:55:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1868. [2021-12-19 13:55:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1304 states have (on average 1.8872699386503067) internal successors, (2461), 1828 states have internal predecessors, (2461), 34 states have call successors, (34), 13 states have call predecessors, (34), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2021-12-19 13:55:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2529 transitions. [2021-12-19 13:55:06,981 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2529 transitions. Word has length 68 [2021-12-19 13:55:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:06,981 INFO L470 AbstractCegarLoop]: Abstraction has 1868 states and 2529 transitions. [2021-12-19 13:55:06,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:55:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2529 transitions. [2021-12-19 13:55:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 13:55:06,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:06,982 INFO L514 BasicCegarLoop]: 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, 1] [2021-12-19 13:55:07,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:07,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:07,193 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1078181117, now seen corresponding path program 1 times [2021-12-19 13:55:07,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:07,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321090711] [2021-12-19 13:55:07,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:07,194 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:07,195 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) [2021-12-19 13:55:07,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-19 13:55:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:07,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 13:55:07,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:07,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:07,614 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:07,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321090711] [2021-12-19 13:55:07,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321090711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:07,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:07,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:55:07,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801677952] [2021-12-19 13:55:07,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:07,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:55:07,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:07,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:55:07,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:55:07,615 INFO L87 Difference]: Start difference. First operand 1868 states and 2529 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-19 13:55:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:07,784 INFO L93 Difference]: Finished difference Result 1880 states and 2543 transitions. [2021-12-19 13:55:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:55:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2021-12-19 13:55:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:07,791 INFO L225 Difference]: With dead ends: 1880 [2021-12-19 13:55:07,791 INFO L226 Difference]: Without dead ends: 1880 [2021-12-19 13:55:07,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:55:07,792 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 23 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:07,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 4635 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:55:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2021-12-19 13:55:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1871. [2021-12-19 13:55:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1306 states have (on average 1.8859111791730474) internal successors, (2463), 1830 states have internal predecessors, (2463), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:55:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2532 transitions. [2021-12-19 13:55:07,832 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2532 transitions. Word has length 68 [2021-12-19 13:55:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:07,832 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2532 transitions. [2021-12-19 13:55:07,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-19 13:55:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2532 transitions. [2021-12-19 13:55:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 13:55:07,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:07,833 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:07,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:08,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:08,038 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 396897840, now seen corresponding path program 1 times [2021-12-19 13:55:08,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:08,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856052330] [2021-12-19 13:55:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:08,039 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:08,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:08,040 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) [2021-12-19 13:55:08,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-19 13:55:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:08,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:55:08,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:08,419 INFO L388 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 [2021-12-19 13:55:08,577 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 13:55:08,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-12-19 13:55:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:08,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:08,591 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:08,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856052330] [2021-12-19 13:55:08,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856052330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:08,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:08,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:55:08,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207752838] [2021-12-19 13:55:08,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:08,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:55:08,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:08,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:55:08,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:55:08,593 INFO L87 Difference]: Start difference. First operand 1871 states and 2532 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:55:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:11,793 INFO L93 Difference]: Finished difference Result 3195 states and 4242 transitions. [2021-12-19 13:55:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:55:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-12-19 13:55:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:11,798 INFO L225 Difference]: With dead ends: 3195 [2021-12-19 13:55:11,798 INFO L226 Difference]: Without dead ends: 3195 [2021-12-19 13:55:11,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:55:11,798 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 1622 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 841 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:11,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 3997 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2727 Invalid, 0 Unknown, 841 Unchecked, 3.1s Time] [2021-12-19 13:55:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2021-12-19 13:55:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 1870. [2021-12-19 13:55:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1306 states have (on average 1.8843797856049005) internal successors, (2461), 1829 states have internal predecessors, (2461), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:55:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2530 transitions. [2021-12-19 13:55:11,833 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2530 transitions. Word has length 73 [2021-12-19 13:55:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:11,834 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2530 transitions. [2021-12-19 13:55:11,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:55:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2530 transitions. [2021-12-19 13:55:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 13:55:11,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:11,838 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:11,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:12,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:12,049 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 396897841, now seen corresponding path program 1 times [2021-12-19 13:55:12,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:12,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618534433] [2021-12-19 13:55:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:12,051 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:12,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:12,052 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) [2021-12-19 13:55:12,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-19 13:55:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:12,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 13:55:12,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:12,442 INFO L388 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 [2021-12-19 13:55:12,448 INFO L388 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 [2021-12-19 13:55:12,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:55:12,895 INFO L388 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 [2021-12-19 13:55:12,902 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:55:12,902 INFO L388 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 14 treesize of output 14 [2021-12-19 13:55:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:12,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:12,917 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618534433] [2021-12-19 13:55:12,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618534433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:12,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:12,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 13:55:12,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579674268] [2021-12-19 13:55:12,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:12,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 13:55:12,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 13:55:12,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:55:12,918 INFO L87 Difference]: Start difference. First operand 1870 states and 2530 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:55:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:18,343 INFO L93 Difference]: Finished difference Result 3266 states and 4367 transitions. [2021-12-19 13:55:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 13:55:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-12-19 13:55:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:18,349 INFO L225 Difference]: With dead ends: 3266 [2021-12-19 13:55:18,349 INFO L226 Difference]: Without dead ends: 3266 [2021-12-19 13:55:18,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:55:18,350 INFO L933 BasicCegarLoop]: 1320 mSDtfsCounter, 2395 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 3844 SdHoareTripleChecker+Invalid, 5280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1308 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:18,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2401 Valid, 3844 Invalid, 5280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3940 Invalid, 0 Unknown, 1308 Unchecked, 5.3s Time] [2021-12-19 13:55:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2021-12-19 13:55:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 1866. [2021-12-19 13:55:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1310 states have (on average 1.869465648854962) internal successors, (2449), 1825 states have internal predecessors, (2449), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:55:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2518 transitions. [2021-12-19 13:55:18,370 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2518 transitions. Word has length 73 [2021-12-19 13:55:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:18,370 INFO L470 AbstractCegarLoop]: Abstraction has 1866 states and 2518 transitions. [2021-12-19 13:55:18,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:55:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2518 transitions. [2021-12-19 13:55:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-19 13:55:18,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:18,371 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:18,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:18,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:18,583 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:18,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1622258381, now seen corresponding path program 1 times [2021-12-19 13:55:18,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371400135] [2021-12-19 13:55:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:18,584 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:18,585 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) [2021-12-19 13:55:18,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-19 13:55:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:18,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 13:55:18,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:18,959 INFO L388 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 [2021-12-19 13:55:18,978 INFO L388 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 [2021-12-19 13:55:18,999 INFO L388 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 24 treesize of output 12 [2021-12-19 13:55:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:19,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:19,027 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:19,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371400135] [2021-12-19 13:55:19,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371400135] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:19,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:19,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 13:55:19,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040552061] [2021-12-19 13:55:19,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:19,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-19 13:55:19,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:19,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 13:55:19,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:55:19,029 INFO L87 Difference]: Start difference. First operand 1866 states and 2518 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 13:55:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:22,283 INFO L93 Difference]: Finished difference Result 1881 states and 2534 transitions. [2021-12-19 13:55:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 13:55:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2021-12-19 13:55:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:22,287 INFO L225 Difference]: With dead ends: 1881 [2021-12-19 13:55:22,287 INFO L226 Difference]: Without dead ends: 1881 [2021-12-19 13:55:22,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-19 13:55:22,288 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 23 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4931 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:22,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 4931 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-19 13:55:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2021-12-19 13:55:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1880. [2021-12-19 13:55:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1322 states have (on average 1.8645990922844176) internal successors, (2465), 1837 states have internal predecessors, (2465), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:55:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2534 transitions. [2021-12-19 13:55:22,312 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2534 transitions. Word has length 80 [2021-12-19 13:55:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:22,312 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2534 transitions. [2021-12-19 13:55:22,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 13:55:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2534 transitions. [2021-12-19 13:55:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-19 13:55:22,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:22,314 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:22,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:22,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:22,526 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1249597809, now seen corresponding path program 1 times [2021-12-19 13:55:22,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:22,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149818911] [2021-12-19 13:55:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:22,528 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:22,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:22,529 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:55:22,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-19 13:55:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:22,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-19 13:55:22,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:22,919 INFO L388 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 [2021-12-19 13:55:22,954 INFO L388 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 [2021-12-19 13:55:22,963 INFO L388 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 [2021-12-19 13:55:23,002 INFO L388 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 [2021-12-19 13:55:23,006 INFO L388 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 [2021-12-19 13:55:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:23,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:23,071 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:23,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149818911] [2021-12-19 13:55:23,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149818911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:23,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:23,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-19 13:55:23,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622441800] [2021-12-19 13:55:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:23,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-19 13:55:23,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-19 13:55:23,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-19 13:55:23,072 INFO L87 Difference]: Start difference. First operand 1880 states and 2534 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:55:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:27,657 INFO L93 Difference]: Finished difference Result 1880 states and 2532 transitions. [2021-12-19 13:55:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 13:55:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2021-12-19 13:55:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:27,661 INFO L225 Difference]: With dead ends: 1880 [2021-12-19 13:55:27,661 INFO L226 Difference]: Without dead ends: 1880 [2021-12-19 13:55:27,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-19 13:55:27,661 INFO L933 BasicCegarLoop]: 1166 mSDtfsCounter, 19 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 3469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5957 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:27,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 5957 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3469 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-12-19 13:55:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2021-12-19 13:55:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2021-12-19 13:55:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1322 states have (on average 1.8630862329803328) internal successors, (2463), 1837 states have internal predecessors, (2463), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:55:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2532 transitions. [2021-12-19 13:55:27,690 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2532 transitions. Word has length 81 [2021-12-19 13:55:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:27,691 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2532 transitions. [2021-12-19 13:55:27,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:55:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2532 transitions. [2021-12-19 13:55:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-19 13:55:27,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:27,692 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:27,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:27,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:27,902 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -63374884, now seen corresponding path program 1 times [2021-12-19 13:55:27,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:27,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264273020] [2021-12-19 13:55:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:27,904 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:27,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:27,905 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) [2021-12-19 13:55:27,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-19 13:55:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:28,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:55:28,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:28,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:55:28,325 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:28,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264273020] [2021-12-19 13:55:28,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264273020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:55:28,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:55:28,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:55:28,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675801964] [2021-12-19 13:55:28,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:55:28,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:55:28,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:28,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:55:28,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:55:28,326 INFO L87 Difference]: Start difference. First operand 1880 states and 2532 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-19 13:55:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:28,377 INFO L93 Difference]: Finished difference Result 1896 states and 2550 transitions. [2021-12-19 13:55:28,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:55:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2021-12-19 13:55:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:28,386 INFO L225 Difference]: With dead ends: 1896 [2021-12-19 13:55:28,386 INFO L226 Difference]: Without dead ends: 1890 [2021-12-19 13:55:28,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:55:28,387 INFO L933 BasicCegarLoop]: 1174 mSDtfsCounter, 13 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:28,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 3514 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:55:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2021-12-19 13:55:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2021-12-19 13:55:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1330 states have (on average 1.8593984962406016) internal successors, (2473), 1847 states have internal predecessors, (2473), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:55:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2544 transitions. [2021-12-19 13:55:28,406 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2544 transitions. Word has length 88 [2021-12-19 13:55:28,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:28,406 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 2544 transitions. [2021-12-19 13:55:28,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-19 13:55:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2544 transitions. [2021-12-19 13:55:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-19 13:55:28,407 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:28,407 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:28,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:28,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:28,618 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -407790698, now seen corresponding path program 1 times [2021-12-19 13:55:28,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:28,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915024111] [2021-12-19 13:55:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:55:28,620 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:28,636 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:55:28,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-19 13:55:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:55:28,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 13:55:28,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:29,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:55:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:29,276 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915024111] [2021-12-19 13:55:29,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915024111] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:55:29,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:55:29,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-19 13:55:29,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525029284] [2021-12-19 13:55:29,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:55:29,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-19 13:55:29,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:29,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 13:55:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-19 13:55:29,278 INFO L87 Difference]: Start difference. First operand 1890 states and 2544 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:29,445 INFO L93 Difference]: Finished difference Result 1916 states and 2574 transitions. [2021-12-19 13:55:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 13:55:29,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2021-12-19 13:55:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:29,448 INFO L225 Difference]: With dead ends: 1916 [2021-12-19 13:55:29,449 INFO L226 Difference]: Without dead ends: 1904 [2021-12-19 13:55:29,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2021-12-19 13:55:29,449 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 48 mSDsluCounter, 5851 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7028 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:29,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 7028 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:55:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-12-19 13:55:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1898. [2021-12-19 13:55:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1338 states have (on average 1.8557548579970105) internal successors, (2483), 1855 states have internal predecessors, (2483), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:55:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2554 transitions. [2021-12-19 13:55:29,464 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2554 transitions. Word has length 89 [2021-12-19 13:55:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:29,465 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 2554 transitions. [2021-12-19 13:55:29,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2554 transitions. [2021-12-19 13:55:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-19 13:55:29,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:29,466 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:29,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-19 13:55:29,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:29,676 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:29,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1714460764, now seen corresponding path program 2 times [2021-12-19 13:55:29,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:29,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223418807] [2021-12-19 13:55:29,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 13:55:29,678 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:29,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:29,679 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:55:29,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-19 13:55:30,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 13:55:30,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:55:30,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 13:55:30,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:30,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:55:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:30,695 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223418807] [2021-12-19 13:55:30,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223418807] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:55:30,696 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:55:30,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-19 13:55:30,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702699748] [2021-12-19 13:55:30,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:55:30,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 13:55:30,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 13:55:30,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-19 13:55:30,697 INFO L87 Difference]: Start difference. First operand 1898 states and 2554 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:31,187 INFO L93 Difference]: Finished difference Result 1952 states and 2622 transitions. [2021-12-19 13:55:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-19 13:55:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 92 [2021-12-19 13:55:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:31,191 INFO L225 Difference]: With dead ends: 1952 [2021-12-19 13:55:31,191 INFO L226 Difference]: Without dead ends: 1940 [2021-12-19 13:55:31,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2021-12-19 13:55:31,192 INFO L933 BasicCegarLoop]: 1183 mSDtfsCounter, 78 mSDsluCounter, 8233 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 9416 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:31,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 9416 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 13:55:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-12-19 13:55:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1916. [2021-12-19 13:55:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1356 states have (on average 1.84882005899705) internal successors, (2507), 1873 states have internal predecessors, (2507), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:55:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2578 transitions. [2021-12-19 13:55:31,207 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2578 transitions. Word has length 92 [2021-12-19 13:55:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:31,208 INFO L470 AbstractCegarLoop]: Abstraction has 1916 states and 2578 transitions. [2021-12-19 13:55:31,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2578 transitions. [2021-12-19 13:55:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-19 13:55:31,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:31,209 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:31,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:31,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:31,421 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1774326244, now seen corresponding path program 3 times [2021-12-19 13:55:31,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:31,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227540533] [2021-12-19 13:55:31,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 13:55:31,423 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:31,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:31,424 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:55:31,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-19 13:55:32,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 13:55:32,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:55:32,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 13:55:32,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:32,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:55:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:33,316 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:33,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227540533] [2021-12-19 13:55:33,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227540533] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:55:33,317 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:55:33,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-19 13:55:33,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982472898] [2021-12-19 13:55:33,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:55:33,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-19 13:55:33,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-19 13:55:33,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2021-12-19 13:55:33,318 INFO L87 Difference]: Start difference. First operand 1916 states and 2578 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:35,992 INFO L93 Difference]: Finished difference Result 2024 states and 2726 transitions. [2021-12-19 13:55:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-19 13:55:35,993 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2021-12-19 13:55:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:35,997 INFO L225 Difference]: With dead ends: 2024 [2021-12-19 13:55:35,997 INFO L226 Difference]: Without dead ends: 2006 [2021-12-19 13:55:35,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=924, Invalid=1832, Unknown=0, NotChecked=0, Total=2756 [2021-12-19 13:55:35,999 INFO L933 BasicCegarLoop]: 1195 mSDtfsCounter, 215 mSDsluCounter, 15439 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 16634 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:35,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 16634 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-19 13:55:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2021-12-19 13:55:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1952. [2021-12-19 13:55:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1392 states have (on average 1.834051724137931) internal successors, (2553), 1909 states have internal predecessors, (2553), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:55:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2624 transitions. [2021-12-19 13:55:36,018 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2624 transitions. Word has length 98 [2021-12-19 13:55:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:36,018 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2624 transitions. [2021-12-19 13:55:36,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2624 transitions. [2021-12-19 13:55:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-19 13:55:36,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:36,019 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:36,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-19 13:55:36,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:36,232 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash -824268388, now seen corresponding path program 4 times [2021-12-19 13:55:36,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:36,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600915179] [2021-12-19 13:55:36,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 13:55:36,233 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:36,235 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:55:36,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-19 13:55:36,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 13:55:36,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:55:36,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-19 13:55:36,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:37,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:55:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:55:38,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:38,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600915179] [2021-12-19 13:55:38,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600915179] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:55:38,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:55:38,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2021-12-19 13:55:38,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389363971] [2021-12-19 13:55:38,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:55:38,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-19 13:55:38,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:55:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-19 13:55:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2021-12-19 13:55:38,676 INFO L87 Difference]: Start difference. First operand 1952 states and 2624 transitions. Second operand has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:55:46,662 INFO L93 Difference]: Finished difference Result 2158 states and 2894 transitions. [2021-12-19 13:55:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-19 13:55:46,663 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 110 [2021-12-19 13:55:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:55:46,666 INFO L225 Difference]: With dead ends: 2158 [2021-12-19 13:55:46,666 INFO L226 Difference]: Without dead ends: 2146 [2021-12-19 13:55:46,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4121, Invalid=9921, Unknown=0, NotChecked=0, Total=14042 [2021-12-19 13:55:46,669 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 497 mSDsluCounter, 33741 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 34958 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:55:46,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 34958 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-19 13:55:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2021-12-19 13:55:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2020. [2021-12-19 13:55:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1460 states have (on average 1.8116438356164384) internal successors, (2645), 1977 states have internal predecessors, (2645), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:55:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2716 transitions. [2021-12-19 13:55:46,700 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2716 transitions. Word has length 110 [2021-12-19 13:55:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:55:46,701 INFO L470 AbstractCegarLoop]: Abstraction has 2020 states and 2716 transitions. [2021-12-19 13:55:46,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:55:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2716 transitions. [2021-12-19 13:55:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 13:55:46,703 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:55:46,703 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:55:46,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-19 13:55:46,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:55:46,918 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:55:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:55:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1958349148, now seen corresponding path program 5 times [2021-12-19 13:55:46,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:55:46,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219773407] [2021-12-19 13:55:46,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:55:46,919 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:55:46,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:55:46,936 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:55:46,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-19 13:55:48,355 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:55:48,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:55:48,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-19 13:55:48,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:55:48,414 INFO L388 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 [2021-12-19 13:55:48,588 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:55:48,588 INFO L388 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 20 treesize of output 27 [2021-12-19 13:55:48,610 INFO L388 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 [2021-12-19 13:55:48,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 13:55:50,386 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:55:50,387 INFO L388 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 37 treesize of output 38 [2021-12-19 13:55:50,437 INFO L388 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 34 treesize of output 16 [2021-12-19 13:55:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:55:50,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:55:50,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:55:50,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:55:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219773407] [2021-12-19 13:55:50,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219773407] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:55:50,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1431413467] [2021-12-19 13:55:50,721 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:55:50,721 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:55:50,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:55:50,722 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:55:50,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2021-12-19 13:57:24,924 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:57:24,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:57:25,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 13:57:25,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:57:25,181 INFO L388 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 [2021-12-19 13:57:25,338 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:57:25,339 INFO L388 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 20 treesize of output 27 [2021-12-19 13:57:25,350 INFO L388 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 [2021-12-19 13:57:25,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 13:57:27,096 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:57:27,097 INFO L388 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 37 treesize of output 38 [2021-12-19 13:57:27,130 INFO L388 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 34 treesize of output 16 [2021-12-19 13:57:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:57:27,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:57:27,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3142) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:57:27,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1431413467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:57:27,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:57:27,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-12-19 13:57:27,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171870340] [2021-12-19 13:57:27,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:57:27,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-19 13:57:27,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:57:27,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 13:57:27,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=191, Unknown=15, NotChecked=58, Total=306 [2021-12-19 13:57:27,346 INFO L87 Difference]: Start difference. First operand 2020 states and 2716 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:57:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:57:32,565 INFO L93 Difference]: Finished difference Result 3339 states and 4420 transitions. [2021-12-19 13:57:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-19 13:57:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 132 [2021-12-19 13:57:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:57:32,570 INFO L225 Difference]: With dead ends: 3339 [2021-12-19 13:57:32,570 INFO L226 Difference]: Without dead ends: 3339 [2021-12-19 13:57:32,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 165 SyntacticMatches, 90 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=338, Unknown=21, NotChecked=78, Total=506 [2021-12-19 13:57:32,571 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 1608 mSDsluCounter, 6787 mSDsCounter, 0 mSdLazyCounter, 4570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 7898 SdHoareTripleChecker+Invalid, 7957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3363 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:57:32,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 7898 Invalid, 7957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4570 Invalid, 0 Unknown, 3363 Unchecked, 5.0s Time] [2021-12-19 13:57:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-12-19 13:57:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2019. [2021-12-19 13:57:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1460 states have (on average 1.8102739726027397) internal successors, (2643), 1976 states have internal predecessors, (2643), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:57:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2714 transitions. [2021-12-19 13:57:32,590 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2714 transitions. Word has length 132 [2021-12-19 13:57:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:57:32,591 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 2714 transitions. [2021-12-19 13:57:32,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:57:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2714 transitions. [2021-12-19 13:57:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 13:57:32,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:57:32,592 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:57:32,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2021-12-19 13:57:32,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-19 13:57:33,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:57:33,017 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:57:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:57:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1958349149, now seen corresponding path program 1 times [2021-12-19 13:57:33,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:57:33,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499301049] [2021-12-19 13:57:33,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:57:33,018 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:57:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:57:33,020 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:57:33,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-19 13:57:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:57:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-19 13:57:33,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:57:33,937 INFO L388 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 [2021-12-19 13:57:34,232 INFO L388 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 [2021-12-19 13:57:34,266 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:57:34,266 INFO L388 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 14 treesize of output 14 [2021-12-19 13:57:34,292 INFO L388 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 [2021-12-19 13:57:34,297 INFO L388 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 [2021-12-19 13:57:34,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 13:57:34,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 13:57:35,822 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:57:35,822 INFO L388 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 [2021-12-19 13:57:35,826 INFO L388 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 [2021-12-19 13:57:35,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 13:57:35,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 13:57:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:57:35,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:57:36,685 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:57:36,691 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:57:36,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499301049] [2021-12-19 13:57:36,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499301049] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:57:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1134987789] [2021-12-19 13:57:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:57:36,692 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:57:36,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:57:36,695 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:57:36,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-12-19 14:00:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:00:30,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-19 14:00:30,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:00:30,594 INFO L388 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 [2021-12-19 14:00:30,766 INFO L388 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 [2021-12-19 14:00:30,802 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:00:30,803 INFO L388 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 14 treesize of output 14 [2021-12-19 14:00:30,833 INFO L388 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 [2021-12-19 14:00:30,852 INFO L388 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 [2021-12-19 14:00:30,996 INFO L388 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 [2021-12-19 14:00:30,999 INFO L388 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 [2021-12-19 14:00:32,502 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:00:32,503 INFO L388 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 [2021-12-19 14:00:32,507 INFO L388 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 [2021-12-19 14:00:32,565 INFO L388 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 [2021-12-19 14:00:32,567 INFO L388 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 [2021-12-19 14:00:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:00:32,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:00:33,218 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:00:33,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1134987789] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:00:33,224 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:00:33,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2021-12-19 14:00:33,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178391704] [2021-12-19 14:00:33,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:00:33,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-19 14:00:33,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:00:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-19 14:00:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=390, Unknown=19, NotChecked=82, Total=552 [2021-12-19 14:00:33,225 INFO L87 Difference]: Start difference. First operand 2019 states and 2714 transitions. Second operand has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:00:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:00:45,746 INFO L93 Difference]: Finished difference Result 3340 states and 4420 transitions. [2021-12-19 14:00:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 14:00:45,756 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 132 [2021-12-19 14:00:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:00:45,760 INFO L225 Difference]: With dead ends: 3340 [2021-12-19 14:00:45,760 INFO L226 Difference]: Without dead ends: 3340 [2021-12-19 14:00:45,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 160 SyntacticMatches, 89 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=120, Invalid=730, Unknown=28, NotChecked=114, Total=992 [2021-12-19 14:00:45,761 INFO L933 BasicCegarLoop]: 1112 mSDtfsCounter, 2171 mSDsluCounter, 7312 mSDsCounter, 0 mSdLazyCounter, 11239 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 8424 SdHoareTripleChecker+Invalid, 13865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 11239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2590 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:00:45,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2176 Valid, 8424 Invalid, 13865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 11239 Invalid, 0 Unknown, 2590 Unchecked, 12.1s Time] [2021-12-19 14:00:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2021-12-19 14:00:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2018. [2021-12-19 14:00:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1460 states have (on average 1.808904109589041) internal successors, (2641), 1975 states have internal predecessors, (2641), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:00:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2712 transitions. [2021-12-19 14:00:45,810 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2712 transitions. Word has length 132 [2021-12-19 14:00:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:00:45,811 INFO L470 AbstractCegarLoop]: Abstraction has 2018 states and 2712 transitions. [2021-12-19 14:00:45,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:00:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2712 transitions. [2021-12-19 14:00:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 14:00:45,812 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:00:45,812 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:00:45,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2021-12-19 14:00:46,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-19 14:00:46,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:00:46,213 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:00:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:00:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1655953071, now seen corresponding path program 1 times [2021-12-19 14:00:46,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:00:46,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009917628] [2021-12-19 14:00:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:00:46,214 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:00:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:00:46,218 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:00:46,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-19 14:00:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:00:47,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 14:00:47,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:00:47,256 INFO L388 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 [2021-12-19 14:00:47,431 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:00:47,432 INFO L388 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 20 treesize of output 27 [2021-12-19 14:00:47,454 INFO L388 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 [2021-12-19 14:00:47,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:00:49,360 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:00:49,361 INFO L388 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 37 treesize of output 38 [2021-12-19 14:00:49,448 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:00:49,448 INFO L388 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 37 treesize of output 38 [2021-12-19 14:00:49,467 INFO L388 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 34 treesize of output 16 [2021-12-19 14:00:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:00:49,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:00:49,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 14:00:49,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:00:49,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4770))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4724)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:00:49,754 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:00:49,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009917628] [2021-12-19 14:00:49,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009917628] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:00:49,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [129970285] [2021-12-19 14:00:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:00:49,754 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:00:49,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:00:49,772 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:00:49,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-12-19 14:00:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:00:54,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 14:00:54,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:00:54,992 INFO L388 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 [2021-12-19 14:00:55,195 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:00:55,195 INFO L388 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 20 treesize of output 27 [2021-12-19 14:00:55,203 INFO L388 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 [2021-12-19 14:00:55,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:00:56,994 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:00:56,994 INFO L388 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 37 treesize of output 38 [2021-12-19 14:00:57,046 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:00:57,047 INFO L388 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 37 treesize of output 38 [2021-12-19 14:00:57,072 INFO L388 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 34 treesize of output 16 [2021-12-19 14:00:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:00:57,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:00:57,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:00:57,331 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5256))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5210)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:00:57,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [129970285] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:00:57,332 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:00:57,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2021-12-19 14:00:57,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338308044] [2021-12-19 14:00:57,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:00:57,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-19 14:00:57,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:00:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 14:00:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=248, Unknown=22, NotChecked=180, Total=506 [2021-12-19 14:00:57,334 INFO L87 Difference]: Start difference. First operand 2018 states and 2712 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:01:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:01:02,217 INFO L93 Difference]: Finished difference Result 3337 states and 4416 transitions. [2021-12-19 14:01:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-19 14:01:02,218 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 135 [2021-12-19 14:01:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:01:02,221 INFO L225 Difference]: With dead ends: 3337 [2021-12-19 14:01:02,221 INFO L226 Difference]: Without dead ends: 3337 [2021-12-19 14:01:02,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 172 SyntacticMatches, 90 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=83, Invalid=415, Unknown=28, NotChecked=230, Total=756 [2021-12-19 14:01:02,225 INFO L933 BasicCegarLoop]: 1112 mSDtfsCounter, 1606 mSDsluCounter, 7485 mSDsCounter, 0 mSdLazyCounter, 4285 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 8597 SdHoareTripleChecker+Invalid, 8845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4535 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-12-19 14:01:02,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 8597 Invalid, 8845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4285 Invalid, 0 Unknown, 4535 Unchecked, 4.7s Time] [2021-12-19 14:01:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2021-12-19 14:01:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2017. [2021-12-19 14:01:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1460 states have (on average 1.8075342465753426) internal successors, (2639), 1974 states have internal predecessors, (2639), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:01:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2710 transitions. [2021-12-19 14:01:02,251 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2710 transitions. Word has length 135 [2021-12-19 14:01:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:01:02,252 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2710 transitions. [2021-12-19 14:01:02,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:01:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2710 transitions. [2021-12-19 14:01:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 14:01:02,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:01:02,253 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:01:02,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-19 14:01:02,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2021-12-19 14:01:02,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 14:01:02,684 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:01:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:01:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1655953070, now seen corresponding path program 1 times [2021-12-19 14:01:02,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:01:02,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280392299] [2021-12-19 14:01:02,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:01:02,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:01:02,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:01:02,686 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:01:02,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-19 14:01:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:01:03,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2021-12-19 14:01:03,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:01:03,932 INFO L388 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 [2021-12-19 14:01:04,198 INFO L388 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 [2021-12-19 14:01:04,232 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:01:04,232 INFO L388 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 14 treesize of output 14 [2021-12-19 14:01:04,258 INFO L388 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 [2021-12-19 14:01:04,262 INFO L388 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 [2021-12-19 14:01:04,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 14:01:04,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 14:01:05,792 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:05,792 INFO L388 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 [2021-12-19 14:01:05,799 INFO L388 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 [2021-12-19 14:01:05,893 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:05,894 INFO L388 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 [2021-12-19 14:01:05,897 INFO L388 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 [2021-12-19 14:01:05,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:01:05,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 14:01:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:01:05,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:01:06,111 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:01:06,135 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:01:06,767 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834) .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 14:01:06,774 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:01:06,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280392299] [2021-12-19 14:01:06,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280392299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:01:06,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1986965342] [2021-12-19 14:01:06,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:01:06,775 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:01:06,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:01:06,776 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:01:06,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-12-19 14:01:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:01:11,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-19 14:01:11,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:01:11,871 INFO L388 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 [2021-12-19 14:01:12,050 INFO L388 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 [2021-12-19 14:01:12,074 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:01:12,075 INFO L388 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 14 treesize of output 14 [2021-12-19 14:01:12,116 INFO L388 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 [2021-12-19 14:01:12,122 INFO L388 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 [2021-12-19 14:01:12,247 INFO L388 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 [2021-12-19 14:01:12,250 INFO L388 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 [2021-12-19 14:01:13,637 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 14:01:13,676 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:13,676 INFO L388 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 [2021-12-19 14:01:13,683 INFO L388 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 [2021-12-19 14:01:13,807 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:13,807 INFO L388 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 [2021-12-19 14:01:13,812 INFO L388 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 [2021-12-19 14:01:13,838 INFO L388 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 [2021-12-19 14:01:13,840 INFO L388 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 [2021-12-19 14:01:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 14:01:13,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:01:13,895 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:01:13,919 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:01:14,401 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413) .cse0 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 14:01:14,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1986965342] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:01:14,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:01:14,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2021-12-19 14:01:14,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015926616] [2021-12-19 14:01:14,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:01:14,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-19 14:01:14,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:01:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 14:01:14,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=472, Unknown=27, NotChecked=350, Total=930 [2021-12-19 14:01:14,407 INFO L87 Difference]: Start difference. First operand 2017 states and 2710 transitions. Second operand has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:01:14,952 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5740))) (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5741))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 14:01:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:01:25,230 INFO L93 Difference]: Finished difference Result 3338 states and 4416 transitions. [2021-12-19 14:01:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-19 14:01:25,231 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 135 [2021-12-19 14:01:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:01:25,234 INFO L225 Difference]: With dead ends: 3338 [2021-12-19 14:01:25,234 INFO L226 Difference]: Without dead ends: 3338 [2021-12-19 14:01:25,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 166 SyntacticMatches, 89 SemanticMatches, 39 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=152, Invalid=898, Unknown=38, NotChecked=552, Total=1640 [2021-12-19 14:01:25,243 INFO L933 BasicCegarLoop]: 1109 mSDtfsCounter, 2890 mSDsluCounter, 8574 mSDsCounter, 0 mSdLazyCounter, 10613 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 9683 SdHoareTripleChecker+Invalid, 18098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 10613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7446 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2021-12-19 14:01:25,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2895 Valid, 9683 Invalid, 18098 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 10613 Invalid, 0 Unknown, 7446 Unchecked, 10.4s Time] [2021-12-19 14:01:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2021-12-19 14:01:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2016. [2021-12-19 14:01:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1460 states have (on average 1.8061643835616439) internal successors, (2637), 1973 states have internal predecessors, (2637), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:01:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2708 transitions. [2021-12-19 14:01:25,267 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2708 transitions. Word has length 135 [2021-12-19 14:01:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:01:25,268 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 2708 transitions. [2021-12-19 14:01:25,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:01:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2708 transitions. [2021-12-19 14:01:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 14:01:25,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:01:25,271 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:01:25,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2021-12-19 14:01:25,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-19 14:01:25,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:01:25,684 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:01:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:01:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash -503241629, now seen corresponding path program 1 times [2021-12-19 14:01:25,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:01:25,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405142214] [2021-12-19 14:01:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:01:25,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:01:25,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:01:25,699 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:01:25,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-19 14:01:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:01:26,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 14:01:26,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:01:26,954 INFO L388 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 [2021-12-19 14:01:27,110 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:01:27,110 INFO L388 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 20 treesize of output 27 [2021-12-19 14:01:27,131 INFO L388 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 [2021-12-19 14:01:27,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:01:29,173 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:29,173 INFO L388 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 37 treesize of output 38 [2021-12-19 14:01:29,285 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:29,286 INFO L388 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 37 treesize of output 38 [2021-12-19 14:01:29,364 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:29,364 INFO L388 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 37 treesize of output 38 [2021-12-19 14:01:29,396 INFO L388 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 34 treesize of output 16 [2021-12-19 14:01:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:01:29,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:01:29,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:01:29,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:01:29,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:01:29,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6916))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:01:29,754 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:01:29,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405142214] [2021-12-19 14:01:29,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405142214] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:01:29,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2113704048] [2021-12-19 14:01:29,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:01:29,755 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:01:29,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:01:29,756 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:01:29,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-12-19 14:01:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:01:35,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 14:01:35,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:01:35,467 INFO L388 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 [2021-12-19 14:01:35,641 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:01:35,641 INFO L388 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 20 treesize of output 27 [2021-12-19 14:01:35,650 INFO L388 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 [2021-12-19 14:01:35,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:01:37,538 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:37,538 INFO L388 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 37 treesize of output 38 [2021-12-19 14:01:37,624 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:37,625 INFO L388 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 37 treesize of output 38 [2021-12-19 14:01:37,675 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:37,676 INFO L388 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 37 treesize of output 38 [2021-12-19 14:01:37,693 INFO L388 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 34 treesize of output 16 [2021-12-19 14:01:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:01:37,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:01:37,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 14:01:37,720 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:01:37,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:01:37,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:01:37,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7418))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:01:37,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2113704048] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:01:37,951 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:01:37,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2021-12-19 14:01:37,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514959625] [2021-12-19 14:01:37,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:01:37,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 14:01:37,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:01:37,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 14:01:37,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=281, Unknown=28, NotChecked=378, Total=756 [2021-12-19 14:01:37,953 INFO L87 Difference]: Start difference. First operand 2016 states and 2708 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:01:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:01:44,757 INFO L93 Difference]: Finished difference Result 3335 states and 4412 transitions. [2021-12-19 14:01:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 14:01:44,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 138 [2021-12-19 14:01:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:01:44,760 INFO L225 Difference]: With dead ends: 3335 [2021-12-19 14:01:44,760 INFO L226 Difference]: Without dead ends: 3335 [2021-12-19 14:01:44,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 179 SyntacticMatches, 90 SemanticMatches, 31 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=96, Invalid=458, Unknown=34, NotChecked=468, Total=1056 [2021-12-19 14:01:44,761 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 1610 mSDsluCounter, 8610 mSDsCounter, 0 mSdLazyCounter, 5937 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 9721 SdHoareTripleChecker+Invalid, 11215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5250 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-12-19 14:01:44,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1615 Valid, 9721 Invalid, 11215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 5937 Invalid, 0 Unknown, 5250 Unchecked, 6.6s Time] [2021-12-19 14:01:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-12-19 14:01:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2015. [2021-12-19 14:01:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1460 states have (on average 1.8047945205479452) internal successors, (2635), 1972 states have internal predecessors, (2635), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:01:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2706 transitions. [2021-12-19 14:01:44,779 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2706 transitions. Word has length 138 [2021-12-19 14:01:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:01:44,780 INFO L470 AbstractCegarLoop]: Abstraction has 2015 states and 2706 transitions. [2021-12-19 14:01:44,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:01:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2706 transitions. [2021-12-19 14:01:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 14:01:44,781 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:01:44,782 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:01:44,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2021-12-19 14:01:45,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-12-19 14:01:45,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:01:45,203 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:01:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:01:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash -503241628, now seen corresponding path program 1 times [2021-12-19 14:01:45,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:01:45,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859800260] [2021-12-19 14:01:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:01:45,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:01:45,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:01:45,205 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:01:45,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-19 14:01:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:01:46,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-19 14:01:46,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:01:46,565 INFO L388 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 [2021-12-19 14:01:46,821 INFO L388 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 [2021-12-19 14:01:46,864 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:01:46,865 INFO L388 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 14 treesize of output 14 [2021-12-19 14:01:46,890 INFO L388 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 [2021-12-19 14:01:46,896 INFO L388 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 [2021-12-19 14:01:46,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 14:01:46,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 14:01:48,340 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32)))) is different from true [2021-12-19 14:01:48,383 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:48,383 INFO L388 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 [2021-12-19 14:01:48,388 INFO L388 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 [2021-12-19 14:01:48,478 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:48,478 INFO L388 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 [2021-12-19 14:01:48,482 INFO L388 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 [2021-12-19 14:01:48,564 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:01:48,565 INFO L388 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 [2021-12-19 14:01:48,570 INFO L388 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 [2021-12-19 14:01:48,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 14:01:48,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:01:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 14:01:48,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:01:48,774 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:01:48,797 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:01:48,834 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) .cse0 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 14:01:48,872 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7919))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7920) .cse4 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 14:01:49,518 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013) .cse1 v_ArrVal_7920) (select (select (store .cse2 .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7922))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7919))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013) .cse4 v_ArrVal_7920) .cse5 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 14:01:49,524 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:01:49,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859800260] [2021-12-19 14:01:49,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859800260] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:01:49,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1133895458] [2021-12-19 14:01:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:01:49,524 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:01:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:01:49,525 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:01:49,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-12-19 14:04:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:04:43,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-19 14:04:43,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:04:43,204 INFO L388 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 [2021-12-19 14:04:43,374 INFO L388 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 [2021-12-19 14:04:43,398 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:04:43,399 INFO L388 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 14 treesize of output 14 [2021-12-19 14:04:43,434 INFO L388 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 [2021-12-19 14:04:43,442 INFO L388 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 [2021-12-19 14:04:43,559 INFO L388 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 [2021-12-19 14:04:43,562 INFO L388 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 [2021-12-19 14:04:44,793 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513)))) is different from true [2021-12-19 14:04:44,829 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:04:44,830 INFO L388 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 [2021-12-19 14:04:44,833 INFO L388 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 [2021-12-19 14:04:44,938 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:04:44,938 INFO L388 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 [2021-12-19 14:04:44,941 INFO L388 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 [2021-12-19 14:04:45,006 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:04:45,007 INFO L388 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 [2021-12-19 14:04:45,010 INFO L388 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 [2021-12-19 14:04:45,025 INFO L388 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 [2021-12-19 14:04:45,027 INFO L388 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 [2021-12-19 14:04:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 14:04:45,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:04:45,073 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-19 14:04:45,094 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))) is different from false [2021-12-19 14:04:45,137 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 14:04:45,163 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8516))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8515) .cse1 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_8518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-19 14:04:45,628 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609) .cse1 v_ArrVal_8515) (select (select (store .cse2 .cse1 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_8516))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609) .cse4 v_ArrVal_8515) .cse5 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 14:04:45,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1133895458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:04:45,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:04:45,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2021-12-19 14:04:45,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328902668] [2021-12-19 14:04:45,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:04:45,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-19 14:04:45,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:04:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 14:04:45,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=537, Unknown=13, NotChecked=684, Total=1332 [2021-12-19 14:04:45,635 INFO L87 Difference]: Start difference. First operand 2015 states and 2706 transitions. Second operand has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:04:46,166 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513)))) is different from true [2021-12-19 14:04:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:04:57,703 INFO L93 Difference]: Finished difference Result 3336 states and 4412 transitions. [2021-12-19 14:04:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-19 14:04:57,704 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 138 [2021-12-19 14:04:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:04:57,714 INFO L225 Difference]: With dead ends: 3336 [2021-12-19 14:04:57,716 INFO L226 Difference]: Without dead ends: 3336 [2021-12-19 14:04:57,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 172 SyntacticMatches, 89 SemanticMatches, 46 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=180, Invalid=1048, Unknown=14, NotChecked=1014, Total=2256 [2021-12-19 14:04:57,717 INFO L933 BasicCegarLoop]: 1113 mSDtfsCounter, 2106 mSDsluCounter, 9820 mSDsCounter, 0 mSdLazyCounter, 12472 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 10933 SdHoareTripleChecker+Invalid, 19986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7481 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-12-19 14:04:57,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2111 Valid, 10933 Invalid, 19986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12472 Invalid, 0 Unknown, 7481 Unchecked, 11.7s Time] [2021-12-19 14:04:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-12-19 14:04:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 2014. [2021-12-19 14:04:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 1460 states have (on average 1.8034246575342465) internal successors, (2633), 1971 states have internal predecessors, (2633), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:04:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2704 transitions. [2021-12-19 14:04:57,762 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2704 transitions. Word has length 138 [2021-12-19 14:04:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:04:57,762 INFO L470 AbstractCegarLoop]: Abstraction has 2014 states and 2704 transitions. [2021-12-19 14:04:57,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:04:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2704 transitions. [2021-12-19 14:04:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 14:04:57,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:04:57,763 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:04:57,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-19 14:04:58,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2021-12-19 14:04:58,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 14:04:58,164 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:04:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:04:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1659802424, now seen corresponding path program 1 times [2021-12-19 14:04:58,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:04:58,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609273119] [2021-12-19 14:04:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:04:58,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:04:58,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:04:58,166 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:04:58,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-19 14:04:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:04:59,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 14:04:59,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:04:59,562 INFO L388 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 [2021-12-19 14:04:59,730 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:04:59,730 INFO L388 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 20 treesize of output 27 [2021-12-19 14:04:59,752 INFO L388 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 [2021-12-19 14:04:59,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:05:01,652 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:01,652 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:01,751 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:01,752 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:01,819 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:01,819 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:01,891 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:01,891 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:01,908 INFO L388 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 34 treesize of output 16 [2021-12-19 14:05:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:05:01,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:05:02,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:05:02,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:02,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:02,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:02,079 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:02,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9128))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:02,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:05:02,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609273119] [2021-12-19 14:05:02,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609273119] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:05:02,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [867622656] [2021-12-19 14:05:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:05:02,278 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:05:02,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:05:02,279 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:05:02,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-12-19 14:05:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:05:11,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 14:05:11,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:05:11,601 INFO L388 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 [2021-12-19 14:05:11,713 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:05:11,714 INFO L388 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 20 treesize of output 27 [2021-12-19 14:05:11,723 INFO L388 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 [2021-12-19 14:05:11,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:05:13,454 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:13,454 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:13,505 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:13,505 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:13,534 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:13,535 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:13,562 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:13,563 INFO L388 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 37 treesize of output 38 [2021-12-19 14:05:13,575 INFO L388 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 34 treesize of output 16 [2021-12-19 14:05:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:05:13,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:05:13,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:13,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:13,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:13,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:13,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9646))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:05:13,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [867622656] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:05:13,819 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:05:13,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2021-12-19 14:05:13,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450314707] [2021-12-19 14:05:13,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:05:13,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-19 14:05:13,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:05:13,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 14:05:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=316, Unknown=30, NotChecked=506, Total=930 [2021-12-19 14:05:13,821 INFO L87 Difference]: Start difference. First operand 2014 states and 2704 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:05:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:05:18,245 INFO L93 Difference]: Finished difference Result 3333 states and 4408 transitions. [2021-12-19 14:05:18,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-19 14:05:18,245 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 141 [2021-12-19 14:05:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:05:18,255 INFO L225 Difference]: With dead ends: 3333 [2021-12-19 14:05:18,256 INFO L226 Difference]: Without dead ends: 3333 [2021-12-19 14:05:18,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 187 SyntacticMatches, 91 SemanticMatches, 34 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=503, Unknown=36, NotChecked=616, Total=1260 [2021-12-19 14:05:18,257 INFO L933 BasicCegarLoop]: 1108 mSDtfsCounter, 1600 mSDsluCounter, 6770 mSDsCounter, 0 mSdLazyCounter, 4301 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 7878 SdHoareTripleChecker+Invalid, 9556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5227 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:05:18,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1605 Valid, 7878 Invalid, 9556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4301 Invalid, 0 Unknown, 5227 Unchecked, 4.2s Time] [2021-12-19 14:05:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2021-12-19 14:05:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2013. [2021-12-19 14:05:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1460 states have (on average 1.8020547945205478) internal successors, (2631), 1970 states have internal predecessors, (2631), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:05:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2702 transitions. [2021-12-19 14:05:18,287 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2702 transitions. Word has length 141 [2021-12-19 14:05:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:05:18,288 INFO L470 AbstractCegarLoop]: Abstraction has 2013 states and 2702 transitions. [2021-12-19 14:05:18,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:05:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2702 transitions. [2021-12-19 14:05:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 14:05:18,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:05:18,289 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:05:18,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-12-19 14:05:18,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2021-12-19 14:05:18,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 14:05:18,707 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:05:18,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:05:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1659802425, now seen corresponding path program 1 times [2021-12-19 14:05:18,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:05:18,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024939176] [2021-12-19 14:05:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:05:18,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:05:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:05:18,710 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:05:18,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-19 14:05:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:05:20,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2021-12-19 14:05:20,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:05:20,299 INFO L388 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 [2021-12-19 14:05:20,575 INFO L388 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 [2021-12-19 14:05:20,608 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:05:20,608 INFO L388 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 14 treesize of output 14 [2021-12-19 14:05:20,632 INFO L388 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 [2021-12-19 14:05:20,638 INFO L388 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 [2021-12-19 14:05:20,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 14:05:20,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 14:05:22,098 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:22,098 INFO L388 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 [2021-12-19 14:05:22,102 INFO L388 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 [2021-12-19 14:05:22,194 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:22,194 INFO L388 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 [2021-12-19 14:05:22,197 INFO L388 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 [2021-12-19 14:05:22,271 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:22,272 INFO L388 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 [2021-12-19 14:05:22,275 INFO L388 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 [2021-12-19 14:05:22,354 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:05:22,354 INFO L388 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 [2021-12-19 14:05:22,357 INFO L388 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 [2021-12-19 14:05:22,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 14:05:22,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 14:05:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:05:22,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:05:22,588 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:05:22,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:05:22,645 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:05:22,758 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10164) .cse1 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_10167)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))) is different from false [2021-12-19 14:05:22,873 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse1 v_ArrVal_10164) (select (select (store .cse2 .cse1 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_10165))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse4 v_ArrVal_10164) .cse5 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 14:05:23,726 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10163) .cse1 v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_10162))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_10163) .cse8 v_ArrVal_10164) (select (select (store .cse9 .cse8 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10) v_ArrVal_10167)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10)))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))) is different from false [2021-12-19 14:05:26,034 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10162))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259) .cse1 v_ArrVal_10163) .cse2 v_ArrVal_10164) (select (select (store .cse3 .cse2 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258)) (.cse9 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_10162))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10165))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259) .cse6 v_ArrVal_10163) .cse7 v_ArrVal_10164) .cse8 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-19 14:05:26,047 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:05:26,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024939176] [2021-12-19 14:05:26,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024939176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:05:26,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092368287] [2021-12-19 14:05:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:05:26,048 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:05:26,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:05:26,049 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:05:26,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2021-12-19 14:08:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:08:42,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-19 14:08:42,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:08:42,466 INFO L388 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 [2021-12-19 14:08:43,281 INFO L388 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 [2021-12-19 14:08:43,376 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:08:43,377 INFO L388 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 14 treesize of output 14 [2021-12-19 14:08:43,574 INFO L388 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 [2021-12-19 14:08:43,595 INFO L388 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 [2021-12-19 14:08:44,073 INFO L388 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 [2021-12-19 14:08:44,082 INFO L388 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 Killed by 15