./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:35,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:35,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:35,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:35,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:35,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:35,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:35,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:35,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:35,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:35,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:35,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:35,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:35,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:35,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:35,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:35,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:35,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:35,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:35,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:35,612 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:35,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:35,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:35,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:35,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:35,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:35,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:35,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:35,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:35,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:35,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:35,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:35,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:35,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:35,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:35,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:35,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:35,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:35,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:35,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:35,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:35,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:35,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:35,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:35,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:35,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:35,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:35,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:35,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:35,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:35,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:35,674 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:35,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:35,675 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:35,675 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:35,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:35,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:35,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:35,676 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:35,676 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:35,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:35,677 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:35,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:35,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:35,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:35,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:35,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:35,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:35,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:35,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:35,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:35,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:35,680 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-memcleanup) ) 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2022-07-14 05:50:35,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:35,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:35,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:35,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:35,950 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:35,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2022-07-14 05:50:36,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5107d51/7c8e7a8b9b214361a1f0101c4f126f5e/FLAG96ac4b8c1 [2022-07-14 05:50:36,428 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:36,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2022-07-14 05:50:36,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5107d51/7c8e7a8b9b214361a1f0101c4f126f5e/FLAG96ac4b8c1 [2022-07-14 05:50:36,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5107d51/7c8e7a8b9b214361a1f0101c4f126f5e [2022-07-14 05:50:36,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:36,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:36,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:36,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:36,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:36,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:36" (1/1) ... [2022-07-14 05:50:36,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd284b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:36, skipping insertion in model container [2022-07-14 05:50:36,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:36" (1/1) ... [2022-07-14 05:50:36,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:36,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:36,713 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/list-properties/list_search-1.i[813,826] [2022-07-14 05:50:36,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:36,879 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 05:50:36,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5bf15812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:36, skipping insertion in model container [2022-07-14 05:50:36,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:36,881 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 05:50:36,883 INFO L158 Benchmark]: Toolchain (without parser) took 426.43ms. Allocated memory is still 94.4MB. Free memory was 59.7MB in the beginning and 68.2MB in the end (delta: -8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 05:50:36,884 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 94.4MB. Free memory was 64.1MB in the beginning and 64.1MB in the end (delta: 25.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:50:36,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.79ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 68.2MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 05:50:36,889 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.25ms. Allocated memory is still 94.4MB. Free memory was 64.1MB in the beginning and 64.1MB in the end (delta: 25.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.79ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 68.2MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 542]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:38,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:38,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:38,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:38,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:38,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:38,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:38,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:38,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:38,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:38,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:38,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:38,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:38,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:38,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:38,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:38,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:38,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:38,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:38,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:38,778 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:38,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:38,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:38,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:38,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:38,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:38,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:38,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:38,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:38,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:38,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:38,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:38,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:38,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:38,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:38,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:38,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:38,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:38,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:38,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:38,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:38,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:38,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-14 05:50:38,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:38,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:38,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:38,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:38,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:38,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:38,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:38,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:38,841 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:38,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:38,843 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:38,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:38,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:38,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:38,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:38,843 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:38,844 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:38,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:38,844 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:38,844 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 05:50:38,844 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 05:50:38,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:38,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:38,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:38,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:38,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:38,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:38,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:38,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:38,847 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 05:50:38,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:38,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 05:50:38,847 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-memcleanup) ) 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2022-07-14 05:50:39,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:39,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:39,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:39,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:39,181 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:39,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2022-07-14 05:50:39,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6e6efee/ce0b2b5bdaa845e896830f25549d9e79/FLAG36fdceb99 [2022-07-14 05:50:39,752 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:39,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2022-07-14 05:50:39,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6e6efee/ce0b2b5bdaa845e896830f25549d9e79/FLAG36fdceb99 [2022-07-14 05:50:40,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6e6efee/ce0b2b5bdaa845e896830f25549d9e79 [2022-07-14 05:50:40,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:40,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:40,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:40,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:40,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:40,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d62c42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40, skipping insertion in model container [2022-07-14 05:50:40,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:40,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:40,426 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/list-properties/list_search-1.i[813,826] [2022-07-14 05:50:40,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:40,589 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 05:50:40,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:40,609 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/list-properties/list_search-1.i[813,826] [2022-07-14 05:50:40,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:40,640 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:40,652 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/list-properties/list_search-1.i[813,826] [2022-07-14 05:50:40,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:40,713 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:40,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40 WrapperNode [2022-07-14 05:50:40,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:40,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:40,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:40,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:40,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,767 INFO L137 Inliner]: procedures = 128, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-07-14 05:50:40,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:40,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:40,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:40,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:40,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:40,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:40,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:40,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:40,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (1/1) ... [2022-07-14 05:50:40,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:40,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:40,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 05:50:40,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 05:50:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 05:50:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2022-07-14 05:50:40,885 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2022-07-14 05:50:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 05:50:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 05:50:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:40,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:40,982 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:40,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:41,249 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:41,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:41,255 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 05:50:41,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:41 BoogieIcfgContainer [2022-07-14 05:50:41,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:41,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:41,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:41,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:41,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:40" (1/3) ... [2022-07-14 05:50:41,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bfb463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:41, skipping insertion in model container [2022-07-14 05:50:41,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:40" (2/3) ... [2022-07-14 05:50:41,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bfb463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:41, skipping insertion in model container [2022-07-14 05:50:41,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:41" (3/3) ... [2022-07-14 05:50:41,264 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2022-07-14 05:50:41,277 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:41,277 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-07-14 05:50:41,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:41,350 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@432bf1a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@569d8d1e [2022-07-14 05:50:41,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-07-14 05:50:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 57 states have internal predecessors, (64), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 05:50:41,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:41,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 05:50:41,363 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:41,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 48806309, now seen corresponding path program 1 times [2022-07-14 05:50:41,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:41,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400653805] [2022-07-14 05:50:41,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:41,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:41,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:41,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 05:50:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:41,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:50:41,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:41,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:41,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:41,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:41,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400653805] [2022-07-14 05:50:41,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400653805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:41,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:41,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819568303] [2022-07-14 05:50:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:41,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:41,572 INFO L87 Difference]: Start difference. First operand has 63 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 57 states have internal predecessors, (64), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:41,695 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-07-14 05:50:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:41,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 05:50:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:41,706 INFO L225 Difference]: With dead ends: 59 [2022-07-14 05:50:41,707 INFO L226 Difference]: Without dead ends: 57 [2022-07-14 05:50:41,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:41,712 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:41,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 90 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-14 05:50:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-14 05:50:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-07-14 05:50:41,750 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 5 [2022-07-14 05:50:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:41,750 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-07-14 05:50:41,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-07-14 05:50:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 05:50:41,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:41,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 05:50:41,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:41,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:41,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 48806310, now seen corresponding path program 1 times [2022-07-14 05:50:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:41,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95359136] [2022-07-14 05:50:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:41,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:41,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:41,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:41,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 05:50:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 05:50:42,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:42,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:42,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:42,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95359136] [2022-07-14 05:50:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95359136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:42,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:42,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394492459] [2022-07-14 05:50:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:42,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:42,099 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:42,191 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-14 05:50:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:42,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 05:50:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:42,193 INFO L225 Difference]: With dead ends: 53 [2022-07-14 05:50:42,193 INFO L226 Difference]: Without dead ends: 53 [2022-07-14 05:50:42,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:42,195 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:42,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 91 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-14 05:50:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-14 05:50:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.457142857142857) internal successors, (51), 47 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-07-14 05:50:42,201 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 5 [2022-07-14 05:50:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:42,201 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-07-14 05:50:42,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-07-14 05:50:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 05:50:42,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:42,203 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:42,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:42,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:42,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1546335105, now seen corresponding path program 1 times [2022-07-14 05:50:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:42,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997738807] [2022-07-14 05:50:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:42,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:42,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:42,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:42,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 05:50:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 05:50:42,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 05:50:42,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 05:50:42,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997738807] [2022-07-14 05:50:42,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997738807] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:42,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:42,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-14 05:50:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819179488] [2022-07-14 05:50:42,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:42,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:42,771 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:50:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:43,004 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-07-14 05:50:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:43,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-07-14 05:50:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:43,007 INFO L225 Difference]: With dead ends: 72 [2022-07-14 05:50:43,007 INFO L226 Difference]: Without dead ends: 72 [2022-07-14 05:50:43,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:50:43,008 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 98 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:43,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 162 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-14 05:50:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2022-07-14 05:50:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 53 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 05:50:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-07-14 05:50:43,014 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 41 [2022-07-14 05:50:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:43,015 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-07-14 05:50:43,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:50:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-07-14 05:50:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:50:43,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:43,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:43,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:43,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:43,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1413963380, now seen corresponding path program 1 times [2022-07-14 05:50:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:43,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932886409] [2022-07-14 05:50:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:43,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:43,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 05:50:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:43,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 05:50:43,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:43,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-14 05:50:43,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:43,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:43,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932886409] [2022-07-14 05:50:43,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932886409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:43,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:43,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:43,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570672807] [2022-07-14 05:50:43,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:43,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:43,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:43,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:43,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:43,491 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:43,697 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-07-14 05:50:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:43,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-14 05:50:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:43,699 INFO L225 Difference]: With dead ends: 90 [2022-07-14 05:50:43,699 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 05:50:43,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:43,700 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 99 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:43,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 80 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 05:50:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2022-07-14 05:50:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.425531914893617) internal successors, (67), 58 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 05:50:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-14 05:50:43,706 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 44 [2022-07-14 05:50:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:43,706 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-14 05:50:43,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-07-14 05:50:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:50:43,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:43,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:43,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:43,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:43,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1413963379, now seen corresponding path program 1 times [2022-07-14 05:50:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101886956] [2022-07-14 05:50:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:43,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:43,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:43,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 05:50:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:44,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 05:50:44,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:44,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-14 05:50:44,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:44,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:44,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101886956] [2022-07-14 05:50:44,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101886956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:44,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:44,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129738140] [2022-07-14 05:50:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:44,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:44,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:44,244 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:44,487 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-07-14 05:50:44,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-14 05:50:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:44,489 INFO L225 Difference]: With dead ends: 106 [2022-07-14 05:50:44,489 INFO L226 Difference]: Without dead ends: 106 [2022-07-14 05:50:44,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:44,490 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 103 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:44,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 91 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-14 05:50:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2022-07-14 05:50:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 63 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 05:50:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-07-14 05:50:44,495 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 44 [2022-07-14 05:50:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:44,496 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-07-14 05:50:44,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-07-14 05:50:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 05:50:44,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:44,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:44,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:44,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:44,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1662023696, now seen corresponding path program 1 times [2022-07-14 05:50:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:44,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328443849] [2022-07-14 05:50:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:44,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:44,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:44,710 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:44,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 05:50:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:44,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 05:50:44,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-14 05:50:44,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:44,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:44,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328443849] [2022-07-14 05:50:44,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328443849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:44,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:44,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631281039] [2022-07-14 05:50:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:44,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:44,970 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:45,206 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-07-14 05:50:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:45,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-07-14 05:50:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:45,207 INFO L225 Difference]: With dead ends: 106 [2022-07-14 05:50:45,208 INFO L226 Difference]: Without dead ends: 106 [2022-07-14 05:50:45,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:45,208 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 109 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:45,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 164 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-14 05:50:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2022-07-14 05:50:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 63 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 05:50:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-07-14 05:50:45,214 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 47 [2022-07-14 05:50:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:45,215 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-14 05:50:45,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-07-14 05:50:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 05:50:45,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:45,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:45,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:45,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:45,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1825916083, now seen corresponding path program 1 times [2022-07-14 05:50:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:45,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239334196] [2022-07-14 05:50:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:45,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:45,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:45,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:45,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 05:50:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:45,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 05:50:45,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:45,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-14 05:50:45,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:45,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239334196] [2022-07-14 05:50:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239334196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:45,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670897673] [2022-07-14 05:50:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:45,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:45,797 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:46,193 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-07-14 05:50:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:46,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-07-14 05:50:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:46,199 INFO L225 Difference]: With dead ends: 105 [2022-07-14 05:50:46,199 INFO L226 Difference]: Without dead ends: 105 [2022-07-14 05:50:46,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:46,200 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 147 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:46,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 139 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-14 05:50:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2022-07-14 05:50:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 66 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 05:50:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-14 05:50:46,205 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 49 [2022-07-14 05:50:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:46,205 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-14 05:50:46,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-14 05:50:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 05:50:46,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:46,207 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:46,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:46,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:46,419 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1825916084, now seen corresponding path program 1 times [2022-07-14 05:50:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:46,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026358813] [2022-07-14 05:50:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:46,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:46,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:46,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 05:50:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:46,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 05:50:46,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:46,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-14 05:50:46,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:46,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026358813] [2022-07-14 05:50:46,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026358813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:46,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:46,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749549989] [2022-07-14 05:50:46,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:46,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:46,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:46,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:46,766 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:47,095 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-07-14 05:50:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-07-14 05:50:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:47,096 INFO L225 Difference]: With dead ends: 96 [2022-07-14 05:50:47,096 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 05:50:47,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:47,097 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 125 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:47,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 132 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 05:50:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2022-07-14 05:50:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 69 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 05:50:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-14 05:50:47,102 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 49 [2022-07-14 05:50:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:47,103 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-14 05:50:47,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-14 05:50:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 05:50:47,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:47,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:47,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:47,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:47,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1986857552, now seen corresponding path program 1 times [2022-07-14 05:50:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857748003] [2022-07-14 05:50:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:47,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:47,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:47,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 05:50:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:47,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 05:50:47,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:47,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:47,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:47,855 INFO L356 Elim1Store]: treesize reduction 30, result has 31.8 percent of original size [2022-07-14 05:50:47,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-07-14 05:50:47,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-14 05:50:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:50:48,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:50:48,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:48,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857748003] [2022-07-14 05:50:48,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857748003] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:48,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:48,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-07-14 05:50:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219567728] [2022-07-14 05:50:48,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:48,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 05:50:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:48,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 05:50:48,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-14 05:50:48,336 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 05:50:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:49,418 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2022-07-14 05:50:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 05:50:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-14 05:50:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:49,421 INFO L225 Difference]: With dead ends: 127 [2022-07-14 05:50:49,421 INFO L226 Difference]: Without dead ends: 127 [2022-07-14 05:50:49,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2022-07-14 05:50:49,422 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 376 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:49,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 250 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 05:50:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-14 05:50:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2022-07-14 05:50:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2022-07-14 05:50:49,427 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 51 [2022-07-14 05:50:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:49,428 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2022-07-14 05:50:49,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 05:50:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2022-07-14 05:50:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 05:50:49,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:49,431 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:49,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:49,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:49,637 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1986857553, now seen corresponding path program 1 times [2022-07-14 05:50:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:49,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480117797] [2022-07-14 05:50:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:49,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:49,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:49,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 05:50:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 05:50:49,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:49,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:50,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:50,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:50,179 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-14 05:50:50,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:50:50,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:50,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 05:50:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:50:50,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:50,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:50,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480117797] [2022-07-14 05:50:50,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480117797] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:50,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1526157222] [2022-07-14 05:50:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:50,933 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:50,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:50:50,936 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:50:50,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-07-14 05:50:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:51,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-14 05:50:51,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:51,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:51,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:51,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:51,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:51,841 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 05:50:51,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-14 05:50:51,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:50:52,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:52,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 05:50:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:50:52,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:54,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1526157222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:54,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-14 05:50:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824971377] [2022-07-14 05:50:54,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:54,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 05:50:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 05:50:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=580, Unknown=1, NotChecked=0, Total=650 [2022-07-14 05:50:54,728 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:50:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:57,366 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2022-07-14 05:50:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 05:50:57,366 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-07-14 05:50:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:57,367 INFO L225 Difference]: With dead ends: 155 [2022-07-14 05:50:57,367 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 05:50:57,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=269, Invalid=1452, Unknown=1, NotChecked=0, Total=1722 [2022-07-14 05:50:57,368 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 455 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:57,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 324 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 496 Invalid, 0 Unknown, 237 Unchecked, 1.1s Time] [2022-07-14 05:50:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 05:50:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 86. [2022-07-14 05:50:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 79 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-07-14 05:50:57,382 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 51 [2022-07-14 05:50:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:57,383 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-07-14 05:50:57,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:50:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2022-07-14 05:50:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 05:50:57,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:57,387 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:57,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:57,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:57,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:57,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash -105219752, now seen corresponding path program 1 times [2022-07-14 05:50:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:57,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303066083] [2022-07-14 05:50:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:57,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:57,801 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:57,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 05:50:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:58,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 05:50:58,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:58,258 INFO L356 Elim1Store]: treesize reduction 157, result has 14.7 percent of original size [2022-07-14 05:50:58,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 36 [2022-07-14 05:50:58,287 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 05:50:58,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-07-14 05:50:58,359 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-14 05:50:58,359 INFO L390 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 39 treesize of output 13 [2022-07-14 05:50:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-14 05:50:58,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:58,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:58,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303066083] [2022-07-14 05:50:58,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303066083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:58,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:58,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 05:50:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94420387] [2022-07-14 05:50:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:58,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:50:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:58,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:50:58,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:58,404 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:58,858 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-07-14 05:50:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-07-14 05:50:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:58,859 INFO L225 Difference]: With dead ends: 83 [2022-07-14 05:50:58,859 INFO L226 Difference]: Without dead ends: 83 [2022-07-14 05:50:58,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:50:58,860 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:58,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 287 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 16 Unchecked, 0.3s Time] [2022-07-14 05:50:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-14 05:50:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-14 05:50:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-07-14 05:50:58,864 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 52 [2022-07-14 05:50:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:58,864 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-07-14 05:50:58,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:50:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-07-14 05:50:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 05:50:58,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:58,865 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:58,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:59,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:59,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:50:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1534863564, now seen corresponding path program 1 times [2022-07-14 05:50:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:59,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460614604] [2022-07-14 05:50:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:59,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:59,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:59,069 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:59,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 05:50:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:59,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 05:50:59,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:59,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:59,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 05:50:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:50:59,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:50:59,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460614604] [2022-07-14 05:50:59,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460614604] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:59,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:59,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2022-07-14 05:50:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346300630] [2022-07-14 05:50:59,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:59,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:50:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:50:59,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-14 05:50:59,846 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 05:51:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:01,065 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-07-14 05:51:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 05:51:01,066 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-07-14 05:51:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:01,067 INFO L225 Difference]: With dead ends: 123 [2022-07-14 05:51:01,067 INFO L226 Difference]: Without dead ends: 123 [2022-07-14 05:51:01,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 05:51:01,068 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 258 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:01,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 330 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 05:51:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-14 05:51:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 82. [2022-07-14 05:51:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.296875) internal successors, (83), 75 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2022-07-14 05:51:01,072 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 54 [2022-07-14 05:51:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:01,073 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2022-07-14 05:51:01,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 05:51:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-07-14 05:51:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 05:51:01,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:01,074 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:01,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:01,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:01,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash 527248649, now seen corresponding path program 1 times [2022-07-14 05:51:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:01,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407464735] [2022-07-14 05:51:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:01,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:01,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:01,282 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:01,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 05:51:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:01,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 05:51:01,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:01,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:01,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:51:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:51:01,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:02,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-14 05:51:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:51:03,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:03,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407464735] [2022-07-14 05:51:03,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407464735] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:03,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:03,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2022-07-14 05:51:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862730013] [2022-07-14 05:51:03,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:03,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 05:51:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:03,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 05:51:03,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-07-14 05:51:03,581 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 24 states have internal predecessors, (75), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:51:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:07,499 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2022-07-14 05:51:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 05:51:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 24 states have internal predecessors, (75), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2022-07-14 05:51:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:07,501 INFO L225 Difference]: With dead ends: 139 [2022-07-14 05:51:07,501 INFO L226 Difference]: Without dead ends: 139 [2022-07-14 05:51:07,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=383, Invalid=1969, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 05:51:07,502 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 426 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:07,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 527 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 05:51:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-14 05:51:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 82. [2022-07-14 05:51:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.28125) internal successors, (82), 75 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-07-14 05:51:07,505 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 56 [2022-07-14 05:51:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:07,505 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-07-14 05:51:07,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 24 states have internal predecessors, (75), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:51:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-07-14 05:51:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 05:51:07,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:07,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:07,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:07,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:07,711 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:07,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:07,712 INFO L85 PathProgramCache]: Analyzing trace with hash -69599988, now seen corresponding path program 2 times [2022-07-14 05:51:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:07,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604806972] [2022-07-14 05:51:07,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:07,714 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:07,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 05:51:08,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:08,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:08,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 05:51:08,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:08,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:08,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:08,396 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:51:08,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:51:08,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:08,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:08,842 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 05:51:08,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-07-14 05:51:08,859 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:51:08,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2022-07-14 05:51:08,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-14 05:51:09,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:51:09,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:09,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 45 [2022-07-14 05:51:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:09,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:10,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:10,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-14 05:51:10,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_113 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (bvneg (bvneg (select (store |c_#valid| v_~head~0.base_113 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_113 v_arrayElimArr_2) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32)))))) (_ bv1 1)) (_ bv0 1)) (not (= (select v_arrayElimArr_2 (_ bv4 32)) c_~head~0.base)))) is different from false [2022-07-14 05:51:10,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:10,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604806972] [2022-07-14 05:51:10,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604806972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:10,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [111514464] [2022-07-14 05:51:10,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:10,437 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:10,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:10,438 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:51:10,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-07-14 05:51:10,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:10,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:10,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 05:51:10,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:10,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:11,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:11,347 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:51:11,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:51:11,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:11,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:12,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:12,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-07-14 05:51:12,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:12,193 INFO L356 Elim1Store]: treesize reduction 45, result has 42.3 percent of original size [2022-07-14 05:51:12,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 61 [2022-07-14 05:51:12,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:51:12,908 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:12,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2022-07-14 05:51:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:13,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:13,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:13,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-14 05:51:13,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_119 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_4 (_ bv4 32)) c_~head~0.base)) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_119)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_~head~0.base_119 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_119 v_arrayElimArr_4) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32)))))) (_ bv1 1))))) is different from false [2022-07-14 05:51:13,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [111514464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:13,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:13,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2022-07-14 05:51:13,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102226251] [2022-07-14 05:51:13,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:13,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 05:51:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 05:51:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1277, Unknown=5, NotChecked=146, Total=1560 [2022-07-14 05:51:13,510 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 30 states have internal predecessors, (83), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 05:51:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:14,247 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-07-14 05:51:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 05:51:14,248 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 30 states have internal predecessors, (83), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-07-14 05:51:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:14,249 INFO L225 Difference]: With dead ends: 96 [2022-07-14 05:51:14,249 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 05:51:14,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=208, Invalid=1772, Unknown=8, NotChecked=174, Total=2162 [2022-07-14 05:51:14,249 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 58 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:14,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 474 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 279 Unchecked, 0.3s Time] [2022-07-14 05:51:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 05:51:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2022-07-14 05:51:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 79 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-07-14 05:51:14,252 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 58 [2022-07-14 05:51:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:14,252 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-07-14 05:51:14,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 30 states have internal predecessors, (83), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 05:51:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-07-14 05:51:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 05:51:14,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:14,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:14,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:14,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:14,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:14,660 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash -69599987, now seen corresponding path program 2 times [2022-07-14 05:51:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:14,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434457049] [2022-07-14 05:51:14,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:14,662 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:14,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 05:51:15,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:15,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:15,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-14 05:51:15,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:15,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:15,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:15,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:15,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:15,616 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-14 05:51:15,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2022-07-14 05:51:15,648 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:51:15,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:51:16,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:16,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:16,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-14 05:51:16,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:16,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:51:16,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:16,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 05:51:16,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:16,456 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-07-14 05:51:16,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2022-07-14 05:51:17,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:17,254 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 05:51:17,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 47 [2022-07-14 05:51:17,266 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:51:17,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 05:51:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:17,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:18,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:18,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 05:51:18,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:18,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-14 05:51:18,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:18,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-14 05:51:18,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_125 (_ BitVec 32)) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2137 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (bvneg (select |c_#valid| v_~head~0.base_125)) (_ bv0 1))) (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_125 (store v_ArrVal_2138 (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse2))) (let ((.cse1 (bvadd (_ bv4 32) .cse0))) (and (bvule .cse0 .cse1) (bvule .cse1 (select (store |c_#length| v_~head~0.base_125 (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_125 (store v_ArrVal_2137 (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse2))))))))) is different from false [2022-07-14 05:51:18,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:18,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434457049] [2022-07-14 05:51:18,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434457049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:18,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1196708864] [2022-07-14 05:51:18,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:18,800 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:18,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:18,801 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:51:18,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-07-14 05:51:19,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:19,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:19,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-14 05:51:19,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:19,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:19,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:19,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:19,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:19,639 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-14 05:51:19,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2022-07-14 05:51:19,670 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:51:19,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:51:19,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:19,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:20,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:20,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:51:20,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:20,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-14 05:51:20,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:20,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 05:51:20,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:20,101 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-07-14 05:51:20,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2022-07-14 05:51:20,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:20,677 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 05:51:20,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 47 [2022-07-14 05:51:20,692 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:51:20,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 05:51:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:20,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:21,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:21,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-14 05:51:21,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:21,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-14 05:51:21,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:21,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 05:51:21,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_131 (_ BitVec 32)) (v_ArrVal_2304 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2305 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_131 (store v_ArrVal_2304 (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse1))) (let ((.cse0 (bvadd (_ bv4 32) .cse2))) (and (bvule .cse0 (select (store |c_#length| v_~head~0.base_131 (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_131 (store v_ArrVal_2305 (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse1))) (bvule .cse2 .cse0))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_131)))))) is different from false [2022-07-14 05:51:21,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1196708864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:21,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:21,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2022-07-14 05:51:21,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846588828] [2022-07-14 05:51:21,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:21,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 05:51:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 05:51:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=591, Unknown=5, NotChecked=98, Total=756 [2022-07-14 05:51:21,584 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 05:51:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:23,611 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2022-07-14 05:51:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 05:51:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2022-07-14 05:51:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:23,613 INFO L225 Difference]: With dead ends: 104 [2022-07-14 05:51:23,613 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 05:51:23,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=143, Invalid=1252, Unknown=19, NotChecked=146, Total=1560 [2022-07-14 05:51:23,614 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:23,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 495 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 331 Unchecked, 0.3s Time] [2022-07-14 05:51:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 05:51:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2022-07-14 05:51:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 79 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2022-07-14 05:51:23,616 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 58 [2022-07-14 05:51:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:23,617 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2022-07-14 05:51:23,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 05:51:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-07-14 05:51:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 05:51:23,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:23,618 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:23,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:23,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:24,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:24,023 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash 569105948, now seen corresponding path program 1 times [2022-07-14 05:51:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865629948] [2022-07-14 05:51:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:24,025 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:24,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 05:51:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:24,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-14 05:51:24,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:24,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-07-14 05:51:24,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:24,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2022-07-14 05:51:24,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-14 05:51:24,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:24,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:24,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2022-07-14 05:51:24,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:25,082 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-14 05:51:25,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2022-07-14 05:51:25,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-07-14 05:51:25,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:51:25,833 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-14 05:51:25,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 87 treesize of output 56 [2022-07-14 05:51:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 05:51:25,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:26,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:26,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 75 [2022-07-14 05:51:26,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_137 (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 8)))) (or (not (= (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_137 v_arrayElimArr_17) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd c_~head~0.offset (_ bv3 32))) (select .cse0 (bvadd c_~head~0.offset (_ bv2 32)))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 32)))) (select .cse0 c_~head~0.offset))) (_ bv2 32))) (not (= (select v_arrayElimArr_17 (_ bv0 32)) (_ bv3 8))) (not (= (select v_arrayElimArr_17 (_ bv1 32)) (_ bv0 8))) (not (= (_ bv0 8) (select v_arrayElimArr_17 (_ bv3 32)))) (not (= (select v_arrayElimArr_17 (_ bv2 32)) (_ bv0 8))))) is different from false [2022-07-14 05:51:26,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:26,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865629948] [2022-07-14 05:51:26,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865629948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:26,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1506949738] [2022-07-14 05:51:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:26,929 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:51:26,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-14 05:51:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:27,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 05:51:27,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:27,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:27,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-07-14 05:51:27,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-07-14 05:51:28,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:28,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:28,465 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 05:51:28,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-14 05:51:28,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2022-07-14 05:51:28,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58 [2022-07-14 05:51:28,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2022-07-14 05:51:29,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:29,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:29,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:29,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:29,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:29,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:29,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 22 [2022-07-14 05:51:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:51:29,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:29,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_143 (_ BitVec 32)) (v_ArrVal_2652 (Array (_ BitVec 32) (_ BitVec 8)))) (or (not (= (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_143 v_ArrVal_2652) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd c_~head~0.offset (_ bv3 32))) (select .cse0 (bvadd c_~head~0.offset (_ bv2 32)))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 32)))) (select .cse0 c_~head~0.offset))) (_ bv2 32))) (not (= (bvneg (select |c_#valid| v_~head~0.base_143)) (_ bv0 1))))) is different from false [2022-07-14 05:51:29,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1506949738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:29,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:29,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2022-07-14 05:51:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492835243] [2022-07-14 05:51:29,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:29,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 05:51:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:29,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 05:51:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1375, Unknown=6, NotChecked=150, Total=1640 [2022-07-14 05:51:29,604 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 30 states have internal predecessors, (77), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:51:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:33,028 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-07-14 05:51:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 05:51:33,029 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 30 states have internal predecessors, (77), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-07-14 05:51:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:33,030 INFO L225 Difference]: With dead ends: 91 [2022-07-14 05:51:33,030 INFO L226 Difference]: Without dead ends: 91 [2022-07-14 05:51:33,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=250, Invalid=2608, Unknown=12, NotChecked=210, Total=3080 [2022-07-14 05:51:33,031 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:33,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 761 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 327 Invalid, 0 Unknown, 211 Unchecked, 0.8s Time] [2022-07-14 05:51:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-14 05:51:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-07-14 05:51:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 79 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-07-14 05:51:33,034 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 59 [2022-07-14 05:51:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:33,034 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-07-14 05:51:33,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 30 states have internal predecessors, (77), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 05:51:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-07-14 05:51:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 05:51:33,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:33,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:33,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-14 05:51:33,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:33,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:33,446 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2137373797, now seen corresponding path program 1 times [2022-07-14 05:51:33,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:33,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191063832] [2022-07-14 05:51:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:33,448 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:33,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 05:51:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:33,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 05:51:33,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 05:51:33,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:33,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:33,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191063832] [2022-07-14 05:51:33,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191063832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:33,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:33,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:51:33,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476378748] [2022-07-14 05:51:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:33,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:33,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:33,761 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:51:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:33,770 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-07-14 05:51:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:33,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2022-07-14 05:51:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:33,771 INFO L225 Difference]: With dead ends: 84 [2022-07-14 05:51:33,771 INFO L226 Difference]: Without dead ends: 84 [2022-07-14 05:51:33,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:33,772 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:33,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-14 05:51:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-14 05:51:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 77 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-14 05:51:33,775 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2022-07-14 05:51:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:33,775 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-14 05:51:33,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 05:51:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-14 05:51:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 05:51:33,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:33,776 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:33,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:33,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:33,977 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1015974627, now seen corresponding path program 1 times [2022-07-14 05:51:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:33,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048085176] [2022-07-14 05:51:33,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:33,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:33,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:33,979 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:33,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 05:51:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:34,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-14 05:51:34,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:34,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:34,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:34,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:34,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:34,840 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-14 05:51:34,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2022-07-14 05:51:34,863 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:51:34,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:51:35,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:35,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:35,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:35,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-07-14 05:51:35,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:35,416 INFO L356 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-07-14 05:51:35,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2022-07-14 05:51:35,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:35,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 05:51:35,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 05:51:36,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:36,442 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:36,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 50 [2022-07-14 05:51:36,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2022-07-14 05:51:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:36,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:38,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:38,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-14 05:51:38,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:38,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-14 05:51:38,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:38,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-14 05:51:38,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_149 (_ BitVec 32)) (v_ArrVal_2956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2955 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_149 (store v_ArrVal_2955 (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse2))) (let ((.cse1 (bvadd (_ bv8 32) .cse0))) (and (bvule (bvadd (_ bv4 32) .cse0) .cse1) (bvule .cse1 (select (store |c_#length| v_~head~0.base_149 (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_149 (store v_ArrVal_2956 (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse2))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_149))))))) is different from false [2022-07-14 05:51:38,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048085176] [2022-07-14 05:51:38,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048085176] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [834607570] [2022-07-14 05:51:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:38,216 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:51:38,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-14 05:51:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:38,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-14 05:51:38,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:38,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:38,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:39,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:39,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:39,114 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:51:39,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:51:39,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:51:39,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:39,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:39,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-14 05:51:39,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,997 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-07-14 05:51:39,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2022-07-14 05:51:40,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:40,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:51:40,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 05:51:40,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:41,005 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 05:51:41,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 47 [2022-07-14 05:51:41,018 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:51:41,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 05:51:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:41,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:41,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:41,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-14 05:51:41,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:41,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-14 05:51:41,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:41,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-14 05:51:42,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3125 (_ BitVec 32)) (v_~head~0.base_155 (_ BitVec 32)) (v_ArrVal_3123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3124 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_155 (store v_ArrVal_3123 (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse2))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (and (bvule (bvadd .cse0 (_ bv4 32)) .cse1) (bvule .cse1 (select (store |c_#length| v_~head~0.base_155 v_ArrVal_3125) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_155 (store v_ArrVal_3124 (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse2))))))) (not (= (bvneg (bvneg (select |c_#valid| v_~head~0.base_155))) (_ bv0 1))))) is different from false [2022-07-14 05:51:42,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [834607570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:42,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:42,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2022-07-14 05:51:42,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350636197] [2022-07-14 05:51:42,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:42,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 05:51:42,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 05:51:42,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1154, Unknown=15, NotChecked=138, Total=1406 [2022-07-14 05:51:42,070 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 26 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 05:51:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:44,098 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-07-14 05:51:44,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 05:51:44,099 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 26 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 61 [2022-07-14 05:51:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:44,100 INFO L225 Difference]: With dead ends: 98 [2022-07-14 05:51:44,100 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 05:51:44,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=175, Invalid=1871, Unknown=32, NotChecked=178, Total=2256 [2022-07-14 05:51:44,101 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:44,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 667 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 215 Invalid, 0 Unknown, 307 Unchecked, 0.4s Time] [2022-07-14 05:51:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 05:51:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2022-07-14 05:51:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 80 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-14 05:51:44,104 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 61 [2022-07-14 05:51:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:44,105 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-14 05:51:44,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 26 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 05:51:44,105 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-14 05:51:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 05:51:44,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:44,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:44,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:44,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:44,507 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1021799568, now seen corresponding path program 2 times [2022-07-14 05:51:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:44,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829227376] [2022-07-14 05:51:44,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:44,511 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:44,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 05:51:45,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:45,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:45,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 05:51:45,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:45,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:45,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:45,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:45,727 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 05:51:45,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 29 [2022-07-14 05:51:45,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:51:46,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:46,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2022-07-14 05:51:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:46,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:46,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:46,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-14 05:51:46,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829227376] [2022-07-14 05:51:46,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829227376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1350037929] [2022-07-14 05:51:46,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:46,865 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:46,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:46,866 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:51:46,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-14 05:51:47,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:47,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:47,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 05:51:47,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:47,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:47,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:48,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:48,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:48,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:48,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-14 05:51:48,389 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 05:51:48,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-14 05:51:48,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:51:48,954 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:51:48,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-07-14 05:51:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:48,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:49,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:49,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-14 05:51:49,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_167 (_ BitVec 32))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_167 v_arrayElimArr_31) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_167))))) (not (= (select v_arrayElimArr_31 (_ bv4 32)) c_~head~0.base)))) is different from false [2022-07-14 05:51:49,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1350037929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:49,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:49,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 35 [2022-07-14 05:51:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164428046] [2022-07-14 05:51:49,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:49,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 05:51:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 05:51:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1436, Unknown=6, NotChecked=76, Total=1640 [2022-07-14 05:51:49,344 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 35 states, 35 states have (on average 2.342857142857143) internal successors, (82), 30 states have internal predecessors, (82), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 05:51:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:50,936 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-07-14 05:51:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 05:51:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.342857142857143) internal successors, (82), 30 states have internal predecessors, (82), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-07-14 05:51:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:50,937 INFO L225 Difference]: With dead ends: 96 [2022-07-14 05:51:50,937 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 05:51:50,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=290, Invalid=2886, Unknown=20, NotChecked=110, Total=3306 [2022-07-14 05:51:50,938 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:50,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 892 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 313 Invalid, 0 Unknown, 198 Unchecked, 0.5s Time] [2022-07-14 05:51:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 05:51:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-07-14 05:51:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 states have internal predecessors, (85), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-07-14 05:51:50,941 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 61 [2022-07-14 05:51:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:50,941 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-07-14 05:51:50,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.342857142857143) internal successors, (82), 30 states have internal predecessors, (82), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 05:51:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-07-14 05:51:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 05:51:50,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:50,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:50,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:51,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-07-14 05:51:51,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:51,354 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:51:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -357187888, now seen corresponding path program 3 times [2022-07-14 05:51:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:51,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144168937] [2022-07-14 05:51:51,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:51:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:51,356 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:51,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 05:51:52,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:51:52,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:52,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-14 05:51:52,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:52,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:52,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:52,630 INFO L356 Elim1Store]: treesize reduction 30, result has 31.8 percent of original size [2022-07-14 05:51:52,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-07-14 05:51:52,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:53,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:53,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 05:51:53,091 INFO L356 Elim1Store]: treesize reduction 112, result has 29.6 percent of original size [2022-07-14 05:51:53,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 64 [2022-07-14 05:51:53,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:53,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:51:53,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:53,732 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-14 05:51:53,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 66 [2022-07-14 05:51:53,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:53,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 05:51:53,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:53,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:53,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:53,773 INFO L356 Elim1Store]: treesize reduction 129, result has 30.6 percent of original size [2022-07-14 05:51:53,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 114 [2022-07-14 05:51:55,032 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-14 05:51:55,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 107 [2022-07-14 05:51:55,440 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-14 05:51:55,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 50 [2022-07-14 05:51:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:55,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:56,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:56,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-14 05:51:56,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:56,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-07-14 05:51:56,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_173 (_ BitVec 32)) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| v_~head~0.base_173 (_ bv1 1)) (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_~head~0.base_173 v_arrayElimArr_35))) (select .cse0 (select (select .cse0 c_~head~0.base) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_173 v_arrayElimArr_36) c_~head~0.base) .cse1))))) (_ bv1 1)) (not (= c_~head~0.offset (select v_arrayElimArr_36 (_ bv4 32)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_173))))) (not (= c_~head~0.base (select v_arrayElimArr_35 (_ bv4 32)))))) is different from false [2022-07-14 05:51:56,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144168937] [2022-07-14 05:51:56,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144168937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:56,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [303288651] [2022-07-14 05:51:56,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:51:56,771 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:56,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:56,772 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) [2022-07-14 05:51:56,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-14 05:51:58,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:51:58,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:58,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-14 05:51:58,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:58,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:58,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:59,181 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:51:59,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:51:59,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:59,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:51:59,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:00,200 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-14 05:52:00,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 66 [2022-07-14 05:52:00,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-07-14 05:52:00,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:01,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:01,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,417 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-14 05:52:01,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 61 [2022-07-14 05:52:01,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,462 INFO L356 Elim1Store]: treesize reduction 57, result has 41.8 percent of original size [2022-07-14 05:52:01,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 89 [2022-07-14 05:52:01,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:52:01,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:52:03,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:03,403 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:52:03,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 42 [2022-07-14 05:52:04,434 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-14 05:52:04,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 66 [2022-07-14 05:52:04,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-14 05:52:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:52:06,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:52:10,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:10,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 127 [2022-07-14 05:52:11,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:11,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 124 [2022-07-14 05:52:11,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [303288651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:52:11,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:52:11,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2022-07-14 05:52:11,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900001683] [2022-07-14 05:52:11,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:52:11,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-14 05:52:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:52:11,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-14 05:52:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=4452, Unknown=25, NotChecked=136, Total=4970 [2022-07-14 05:52:11,613 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 47 states have internal predecessors, (105), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 05:52:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:13,492 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-07-14 05:52:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 05:52:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 47 states have internal predecessors, (105), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 65 [2022-07-14 05:52:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:13,493 INFO L225 Difference]: With dead ends: 103 [2022-07-14 05:52:13,493 INFO L226 Difference]: Without dead ends: 103 [2022-07-14 05:52:13,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2354 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=523, Invalid=5915, Unknown=46, NotChecked=158, Total=6642 [2022-07-14 05:52:13,495 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:13,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 557 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 164 Invalid, 0 Unknown, 271 Unchecked, 0.4s Time] [2022-07-14 05:52:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-14 05:52:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2022-07-14 05:52:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 84 states have internal predecessors, (91), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:52:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-14 05:52:13,498 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 65 [2022-07-14 05:52:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:13,498 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-14 05:52:13,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 47 states have internal predecessors, (105), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 05:52:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-14 05:52:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 05:52:13,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:13,499 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:13,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-14 05:52:13,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-14 05:52:13,906 WARN L477 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 [2022-07-14 05:52:13,907 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:52:13,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -357187887, now seen corresponding path program 3 times [2022-07-14 05:52:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:52:13,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958760406] [2022-07-14 05:52:13,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:52:13,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:52:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:52:13,909 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:52:13,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 05:52:15,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:52:15,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:52:15,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-14 05:52:15,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:52:15,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:52:15,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:52:15,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:52:15,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:52:15,529 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:52:15,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:52:15,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:52:15,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:15,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:16,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:16,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-14 05:52:16,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:16,160 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-07-14 05:52:16,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2022-07-14 05:52:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:16,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:52:16,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 05:52:16,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:16,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:16,950 INFO L356 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2022-07-14 05:52:16,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 79 [2022-07-14 05:52:17,022 INFO L356 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-07-14 05:52:17,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 50 [2022-07-14 05:52:17,053 INFO L356 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-07-14 05:52:17,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 05:52:17,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-07-14 05:52:17,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2022-07-14 05:52:17,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-07-14 05:52:22,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:22,322 INFO L356 Elim1Store]: treesize reduction 87, result has 38.7 percent of original size [2022-07-14 05:52:22,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 180 [2022-07-14 05:52:22,462 INFO L356 Elim1Store]: treesize reduction 119, result has 22.2 percent of original size [2022-07-14 05:52:22,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 187 treesize of output 188 [2022-07-14 05:52:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:52:27,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:52:30,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:30,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2022-07-14 05:52:30,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:30,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2022-07-14 05:52:30,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:30,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2022-07-14 05:52:30,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2022-07-14 05:52:30,196 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_~head~0.base_185 (_ BitVec 32)) (v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| v_~head~0.base_185 v_arrayElimArr_47)) (.cse3 (store |c_#memory_$Pointer$.base| v_~head~0.base_185 v_arrayElimArr_46)) (.cse4 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse1 (select (select .cse3 c_~head~0.base) .cse4)) (.cse2 (bvadd (select (select .cse0 c_~head~0.base) .cse4) (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select .cse0 .cse1) .cse2)) (select (store |c_#length| v_~head~0.base_185 (_ bv8 32)) (select (select .cse3 .cse1) .cse2))))) (not (= c_~head~0.offset (select v_arrayElimArr_47 (_ bv4 32)))) (not (= c_~head~0.base (select v_arrayElimArr_46 (_ bv4 32)))))) (forall ((v_~head~0.base_185 (_ BitVec 32)) (v_arrayElimArr_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_49 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_48 (_ bv4 32)) c_~head~0.base)) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| v_~head~0.base_185 v_arrayElimArr_49)) (.cse7 (bvadd c_~head~0.offset (_ bv4 32)))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_185 v_arrayElimArr_48) c_~head~0.base) .cse7)) (bvadd (_ bv4 32) (select (select .cse6 c_~head~0.base) .cse7)))))) (bvule .cse5 (bvadd .cse5 (_ bv4 32)))) (not (= c_~head~0.offset (select v_arrayElimArr_49 (_ bv4 32))))))) is different from false [2022-07-14 05:52:30,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:52:30,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958760406] [2022-07-14 05:52:30,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958760406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:52:30,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871446938] [2022-07-14 05:52:30,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:52:30,209 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:52:30,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:52:30,210 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) [2022-07-14 05:52:30,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-14 05:52:32,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:52:32,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:52:32,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 108 conjunts are in the unsatisfiable core [2022-07-14 05:52:32,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:52:32,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:52:32,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:52:32,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:52:32,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:52:32,531 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:52:32,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:52:32,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:52:33,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:33,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:33,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:33,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-07-14 05:52:33,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:33,911 INFO L356 Elim1Store]: treesize reduction 63, result has 41.7 percent of original size [2022-07-14 05:52:33,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 73 [2022-07-14 05:52:33,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:33,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 05:52:33,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 05:52:34,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:34,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:34,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:34,635 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-14 05:52:34,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 125 [2022-07-14 05:52:34,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:34,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:34,652 INFO L356 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-07-14 05:52:34,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 154 [2022-07-14 05:52:34,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:34,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:34,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:34,687 INFO L356 Elim1Store]: treesize reduction 4, result has 88.2 percent of original size [2022-07-14 05:52:34,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 49 [2022-07-14 05:52:34,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:34,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2022-07-14 05:52:38,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:38,256 INFO L356 Elim1Store]: treesize reduction 97, result has 16.4 percent of original size [2022-07-14 05:52:38,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 307 treesize of output 150 [2022-07-14 05:52:38,289 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-14 05:52:38,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 48 [2022-07-14 05:52:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:52:39,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:52:44,156 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:44,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 216 [2022-07-14 05:52:44,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:52:44,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 213 [2022-07-14 05:52:44,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_191 (_ BitVec 32)) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| v_~head~0.base_191 v_arrayElimArr_54)) (.cse6 (store |c_#memory_$Pointer$.offset| v_~head~0.base_191 v_arrayElimArr_55)) (.cse9 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse8 (select (select .cse6 c_~head~0.base) .cse9)) (.cse1 (store |c_#length| v_~head~0.base_191 (_ bv8 32))) (.cse3 (select (select .cse2 c_~head~0.base) .cse9))) (let ((.cse7 (select .cse1 .cse3)) (.cse4 (bvadd (_ bv4 32) .cse8))) (or (let ((.cse5 (select (select .cse6 .cse3) .cse4))) (let ((.cse0 (bvadd (_ bv4 32) .cse5))) (and (bvule .cse0 (select .cse1 (select (select .cse2 .cse3) .cse4))) (bvule .cse5 .cse0)))) (not (= c_~head~0.offset (select v_arrayElimArr_55 (_ bv4 32)))) (not (bvule .cse4 .cse7)) (not (= (bvneg (select |c_#valid| v_~head~0.base_191)) (_ bv0 1))) (not (bvule (bvadd (_ bv8 32) .cse8) .cse7)) (not (= (select v_arrayElimArr_54 (_ bv4 32)) c_~head~0.base)) (not (bvule .cse8 .cse4))))))) is different from false [2022-07-14 05:52:44,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [871446938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:52:44,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:52:44,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 43 [2022-07-14 05:52:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627025241] [2022-07-14 05:52:44,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:52:44,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-14 05:52:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:52:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-14 05:52:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3222, Unknown=15, NotChecked=230, Total=3660 [2022-07-14 05:52:44,802 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 44 states, 43 states have (on average 2.13953488372093) internal successors, (92), 39 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 05:52:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:53,025 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-07-14 05:52:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 05:52:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.13953488372093) internal successors, (92), 39 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 65 [2022-07-14 05:52:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:53,026 INFO L225 Difference]: With dead ends: 101 [2022-07-14 05:52:53,027 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 05:52:53,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=377, Invalid=5740, Unknown=53, NotChecked=310, Total=6480 [2022-07-14 05:52:53,029 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:53,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1026 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 257 Invalid, 0 Unknown, 498 Unchecked, 0.5s Time] [2022-07-14 05:52:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 05:52:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-07-14 05:52:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 84 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:52:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-07-14 05:52:53,032 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 65 [2022-07-14 05:52:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:53,032 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-07-14 05:52:53,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.13953488372093) internal successors, (92), 39 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 05:52:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-07-14 05:52:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 05:52:53,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:53,033 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:53,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-14 05:52:53,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-14 05:52:53,442 WARN L477 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 [2022-07-14 05:52:53,443 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:52:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash 243815640, now seen corresponding path program 2 times [2022-07-14 05:52:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:52:53,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290397294] [2022-07-14 05:52:53,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:52:53,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:52:53,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:52:53,445 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:52:53,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-14 05:52:54,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:52:54,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:52:54,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-14 05:52:54,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:52:54,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:52:54,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-07-14 05:52:54,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-07-14 05:52:54,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:52:54,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:52:54,609 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 05:52:54,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-14 05:52:54,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2022-07-14 05:52:54,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:54,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-14 05:52:55,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2022-07-14 05:52:55,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:55,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:52:55,324 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 05:52:55,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 88 [2022-07-14 05:52:55,346 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-14 05:52:55,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 69 [2022-07-14 05:52:55,369 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:52:55,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2022-07-14 05:52:55,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:55,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-14 05:52:55,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2022-07-14 05:52:55,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2022-07-14 05:52:58,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:58,729 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 05:52:58,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 135 [2022-07-14 05:52:58,765 INFO L356 Elim1Store]: treesize reduction 22, result has 24.1 percent of original size [2022-07-14 05:52:58,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 107 [2022-07-14 05:52:59,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:59,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:59,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:59,280 INFO L356 Elim1Store]: treesize reduction 34, result has 48.5 percent of original size [2022-07-14 05:52:59,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 6 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 86 treesize of output 67 [2022-07-14 05:52:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:52:59,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:53:01,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:01,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 195 [2022-07-14 05:53:01,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:01,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 188 treesize of output 159 [2022-07-14 05:53:01,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:01,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2022-07-14 05:53:01,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 8))) (v_~head~0.base_197 (_ BitVec 32)) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_197 v_arrayElimArr_61) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_197 v_arrayElimArr_60) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_197 v_arrayElimArr_62) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd .cse1 (_ bv1 32)))) (select .cse0 .cse1)))) (_ bv2 32))) (not (= c_~head~0.offset (select v_arrayElimArr_62 (_ bv4 32)))) (not (= (select v_arrayElimArr_61 (_ bv0 32)) (_ bv3 8))) (not (= (select v_arrayElimArr_61 (_ bv2 32)) (_ bv0 8))) (not (= (select v_arrayElimArr_61 (_ bv1 32)) (_ bv0 8))) (not (= c_~head~0.base (select v_arrayElimArr_60 (_ bv4 32)))) (not (= (_ bv0 8) (select v_arrayElimArr_61 (_ bv3 32)))))) is different from false [2022-07-14 05:53:01,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:53:01,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290397294] [2022-07-14 05:53:01,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290397294] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:53:01,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [628502538] [2022-07-14 05:53:01,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:53:01,172 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:53:01,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:53:01,173 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) [2022-07-14 05:53:01,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-14 05:53:02,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:53:02,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:53:02,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-14 05:53:02,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:53:02,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:53:02,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-07-14 05:53:02,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:02,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-07-14 05:53:03,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:53:03,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:53:03,869 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-14 05:53:03,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 77 [2022-07-14 05:53:03,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:03,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:03,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:03,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 13 [2022-07-14 05:53:03,937 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:53:03,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:53:04,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:04,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:05,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:05,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 108 [2022-07-14 05:53:05,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:05,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 87 [2022-07-14 05:53:05,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:05,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 104 [2022-07-14 05:53:05,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:05,364 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-07-14 05:53:05,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2022-07-14 05:53:06,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:06,841 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 05:53:06,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 92 [2022-07-14 05:53:06,853 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:53:06,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 52 [2022-07-14 05:53:07,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:07,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:07,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:07,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:07,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:07,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:07,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:07,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:07,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:07,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:07,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:07,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 60 treesize of output 34 [2022-07-14 05:53:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:53:07,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:53:07,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:07,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 135 [2022-07-14 05:53:07,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:07,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2022-07-14 05:53:07,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_203 (_ BitVec 32)) (v_ArrVal_4513 (Array (_ BitVec 32) (_ BitVec 8))) (v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_203 v_ArrVal_4513) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_203 v_arrayElimArr_65) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_203 v_arrayElimArr_66) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd .cse1 (_ bv3 32))) (select .cse0 (bvadd .cse1 (_ bv2 32)))) (select .cse0 (bvadd .cse1 (_ bv1 32)))) (select .cse0 .cse1)))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_203))))) (not (= (select v_arrayElimArr_65 (_ bv4 32)) c_~head~0.base)) (not (= c_~head~0.offset (select v_arrayElimArr_66 (_ bv4 32)))))) is different from false [2022-07-14 05:53:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [628502538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:53:07,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:53:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2022-07-14 05:53:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851699343] [2022-07-14 05:53:07,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:53:07,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 05:53:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:53:07,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 05:53:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2671, Unknown=56, NotChecked=210, Total=3080 [2022-07-14 05:53:07,893 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-14 05:53:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:53:13,501 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-14 05:53:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 05:53:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 66 [2022-07-14 05:53:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:53:13,502 INFO L225 Difference]: With dead ends: 98 [2022-07-14 05:53:13,502 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 05:53:13,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=332, Invalid=5137, Unknown=89, NotChecked=294, Total=5852 [2022-07-14 05:53:13,504 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 05:53:13,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1129 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 440 Invalid, 0 Unknown, 503 Unchecked, 0.9s Time] [2022-07-14 05:53:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 05:53:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-07-14 05:53:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 84 states have internal predecessors, (89), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:53:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-07-14 05:53:13,507 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 66 [2022-07-14 05:53:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:53:13,508 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-07-14 05:53:13,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-14 05:53:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-07-14 05:53:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 05:53:13,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:53:13,509 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:53:13,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-14 05:53:13,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-07-14 05:53:13,915 WARN L477 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 [2022-07-14 05:53:13,915 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:53:13,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:53:13,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1944601247, now seen corresponding path program 2 times [2022-07-14 05:53:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:53:13,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020124296] [2022-07-14 05:53:13,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:53:13,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:53:13,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:53:13,917 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:53:13,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-14 05:53:14,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:53:14,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:53:14,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-14 05:53:14,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:53:14,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:53:14,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:53:14,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:53:14,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:53:15,045 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:53:15,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:53:15,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:53:15,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:15,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:15,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:15,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-14 05:53:15,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:15,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 05:53:15,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:15,637 INFO L356 Elim1Store]: treesize reduction 45, result has 42.3 percent of original size [2022-07-14 05:53:15,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 61 [2022-07-14 05:53:15,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:15,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:53:16,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:16,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:16,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,253 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-14 05:53:16,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 100 [2022-07-14 05:53:16,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,288 INFO L356 Elim1Store]: treesize reduction 4, result has 85.7 percent of original size [2022-07-14 05:53:16,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 41 [2022-07-14 05:53:16,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2022-07-14 05:53:16,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:16,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2022-07-14 05:53:18,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:18,287 INFO L356 Elim1Store]: treesize reduction 47, result has 25.4 percent of original size [2022-07-14 05:53:18,288 INFO L390 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 101 [2022-07-14 05:53:18,305 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:53:18,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-07-14 05:53:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:53:18,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:53:21,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:21,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2022-07-14 05:53:21,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:21,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2022-07-14 05:53:21,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:21,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 80 [2022-07-14 05:53:21,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:21,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2022-07-14 05:53:21,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4690 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_209 (_ BitVec 32)) (v_ArrVal_4691 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (bvneg (bvneg (select |c_#valid| v_~head~0.base_209))) (_ bv0 1))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| v_~head~0.base_209 (store v_ArrVal_4690 (_ bv4 32) c_~head~0.offset))) (.cse2 (store |c_#memory_$Pointer$.base| v_~head~0.base_209 (store v_ArrVal_4691 (_ bv4 32) c_~head~0.base))) (.cse6 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse2 c_~head~0.base) .cse6)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 c_~head~0.base) .cse6)))) (let ((.cse0 (select (select .cse5 .cse3) .cse4))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (and (bvule (bvadd .cse0 (_ bv4 32)) .cse1) (bvule .cse1 (select (store |c_#length| v_~head~0.base_209 (_ bv8 32)) (select (select .cse2 .cse3) .cse4)))))))))) is different from false [2022-07-14 05:53:21,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:53:21,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020124296] [2022-07-14 05:53:21,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020124296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:53:21,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1958291920] [2022-07-14 05:53:21,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:53:21,217 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:53:21,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:53:21,218 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) [2022-07-14 05:53:21,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-07-14 05:53:22,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:53:22,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:53:22,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 128 conjunts are in the unsatisfiable core [2022-07-14 05:53:22,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:53:22,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:53:22,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-07-14 05:53:22,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:22,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-07-14 05:53:23,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:53:23,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:53:23,768 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-14 05:53:23,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-07-14 05:53:23,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2022-07-14 05:53:24,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:53:25,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:25,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:25,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:25,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 39 [2022-07-14 05:53:25,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:25,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 70 [2022-07-14 05:53:25,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:25,701 INFO L356 Elim1Store]: treesize reduction 45, result has 42.3 percent of original size [2022-07-14 05:53:25,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 61 [2022-07-14 05:53:25,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:25,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:53:26,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:26,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:53:27,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2022-07-14 05:53:27,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,563 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-14 05:53:27,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 105 [2022-07-14 05:53:27,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,612 INFO L356 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2022-07-14 05:53:27,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2022-07-14 05:53:27,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-07-14 05:53:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:27,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:53:32,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:32,168 INFO L356 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2022-07-14 05:53:32,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 316 treesize of output 158 [2022-07-14 05:53:32,225 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-14 05:53:32,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 43 [2022-07-14 05:53:33,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:33,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:33,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:33,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:33,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:33,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:33,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:33,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:33,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:53:33,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:33,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:33,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 60 treesize of output 34 [2022-07-14 05:53:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:53:33,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:53:43,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:43,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 564 treesize of output 513 [2022-07-14 05:53:43,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:53:43,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 537 treesize of output 474 [2022-07-14 05:53:44,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_215 (_ BitVec 32)) (v_arrayElimArr_80 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 8))) (v_arrayElimArr_79 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_~head~0.base_215 v_arrayElimArr_80)) (.cse11 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| v_~head~0.base_215 v_arrayElimArr_79)) (.cse4 (select (select .cse10 c_~head~0.base) .cse11))) (let ((.cse6 (bvadd (_ bv4 32) .cse4)) (.cse1 (store |c_#length| v_~head~0.base_215 (_ bv8 32))) (.cse9 (select (select .cse8 c_~head~0.base) .cse11))) (let ((.cse5 (select .cse1 .cse9)) (.cse3 (select (select .cse10 .cse9) .cse6)) (.cse2 (select (select .cse8 .cse9) .cse6))) (or (let ((.cse0 (bvadd (_ bv8 32) .cse3))) (and (bvule .cse0 (select .cse1 .cse2)) (bvule (bvadd (_ bv4 32) .cse3) .cse0))) (not (= (bvneg (bvneg (select |c_#valid| v_~head~0.base_215))) (_ bv0 1))) (not (= (select v_arrayElimArr_79 (_ bv4 32)) c_~head~0.base)) (not (bvule (bvadd (_ bv8 32) .cse4) .cse5)) (not (= c_~head~0.offset (select v_arrayElimArr_80 (_ bv4 32)))) (not (bvule .cse6 .cse5)) (= (_ bv2 32) (let ((.cse7 (select (store |c_#memory_int| v_~head~0.base_215 v_ArrVal_4887) .cse2))) (concat (concat (concat (select .cse7 (bvadd (_ bv3 32) .cse3)) (select .cse7 (bvadd (_ bv2 32) .cse3))) (select .cse7 (bvadd (_ bv1 32) .cse3))) (select .cse7 .cse3)))) (not (bvule .cse4 .cse6)) (not (bvule (bvadd c_~head~0.offset (_ bv8 32)) (select .cse1 c_~head~0.base))))))))) is different from false [2022-07-14 05:53:44,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1958291920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:53:44,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:53:44,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 34] total 59 [2022-07-14 05:53:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258251690] [2022-07-14 05:53:44,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:53:44,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-14 05:53:44,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:53:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-14 05:53:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5704, Unknown=47, NotChecked=306, Total=6320 [2022-07-14 05:53:44,887 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 59 states, 59 states have (on average 2.0) internal successors, (118), 52 states have internal predecessors, (118), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:54:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:54:00,990 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-07-14 05:54:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-14 05:54:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0) internal successors, (118), 52 states have internal predecessors, (118), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-07-14 05:54:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:54:00,992 INFO L225 Difference]: With dead ends: 146 [2022-07-14 05:54:00,992 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 05:54:00,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 113 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2897 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=687, Invalid=12548, Unknown=113, NotChecked=458, Total=13806 [2022-07-14 05:54:00,993 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1092 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:54:00,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1210 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 529 Invalid, 0 Unknown, 1092 Unchecked, 1.4s Time] [2022-07-14 05:54:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 05:54:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2022-07-14 05:54:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.1559633027522935) internal successors, (126), 119 states have internal predecessors, (126), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:54:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-07-14 05:54:00,996 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 68 [2022-07-14 05:54:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:54:00,997 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-07-14 05:54:00,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0) internal successors, (118), 52 states have internal predecessors, (118), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:54:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-07-14 05:54:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 05:54:00,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:54:00,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:54:01,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-07-14 05:54:01,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-14 05:54:01,407 WARN L477 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 [2022-07-14 05:54:01,408 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:54:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:54:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1950426188, now seen corresponding path program 3 times [2022-07-14 05:54:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:54:01,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124678595] [2022-07-14 05:54:01,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:54:01,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:54:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:54:01,410 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:54:01,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-14 05:54:02,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:54:02,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:54:02,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-14 05:54:02,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:54:02,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:54:02,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:54:02,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:54:03,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:03,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-07-14 05:54:03,032 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 05:54:03,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-14 05:54:03,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:54:03,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:54:03,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:03,632 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-14 05:54:03,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 73 [2022-07-14 05:54:03,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:03,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-07-14 05:54:03,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:03,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-07-14 05:54:03,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2022-07-14 05:54:04,844 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-14 05:54:04,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 91 [2022-07-14 05:54:05,414 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-14 05:54:05,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 39 [2022-07-14 05:54:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:54:06,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:54:07,213 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:54:07,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2022-07-14 05:54:08,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:54:08,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:54:08,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:54:08,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-14 05:54:08,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:54:08,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124678595] [2022-07-14 05:54:08,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124678595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:54:08,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1939436438] [2022-07-14 05:54:08,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:54:08,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:54:08,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:54:08,558 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) [2022-07-14 05:54:08,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-14 05:54:10,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:54:10,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:54:10,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-14 05:54:10,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:54:10,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:54:11,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:54:11,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:54:12,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:12,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:54:12,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:12,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-14 05:54:12,461 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 05:54:12,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-14 05:54:13,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:54:13,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-14 05:54:13,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:13,985 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-14 05:54:13,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 52 [2022-07-14 05:54:13,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:14,018 INFO L356 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-07-14 05:54:14,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 52 [2022-07-14 05:54:14,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:14,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-07-14 05:54:14,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:54:14,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:54:17,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:54:17,327 INFO L356 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2022-07-14 05:54:17,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 183 treesize of output 111 [2022-07-14 05:54:17,366 INFO L356 Elim1Store]: treesize reduction 9, result has 57.1 percent of original size [2022-07-14 05:54:17,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 38 [2022-07-14 05:54:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:54:19,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:54:25,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:54:25,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 142 [2022-07-14 05:54:25,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:54:25,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 151 [2022-07-14 05:54:26,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1939436438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:54:26,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:54:26,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29] total 63 [2022-07-14 05:54:26,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452004821] [2022-07-14 05:54:26,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:54:26,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-14 05:54:26,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:54:26,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-14 05:54:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=7151, Unknown=36, NotChecked=0, Total=7656 [2022-07-14 05:54:26,020 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 63 states, 63 states have (on average 1.873015873015873) internal successors, (118), 55 states have internal predecessors, (118), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:54:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:54:36,266 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-07-14 05:54:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-14 05:54:36,267 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.873015873015873) internal successors, (118), 55 states have internal predecessors, (118), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-07-14 05:54:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:54:36,268 INFO L225 Difference]: With dead ends: 136 [2022-07-14 05:54:36,268 INFO L226 Difference]: Without dead ends: 136 [2022-07-14 05:54:36,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=878, Invalid=11466, Unknown=88, NotChecked=0, Total=12432 [2022-07-14 05:54:36,269 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 05:54:36,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 871 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 353 Invalid, 0 Unknown, 403 Unchecked, 0.9s Time] [2022-07-14 05:54:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-14 05:54:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2022-07-14 05:54:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 119 states have internal predecessors, (124), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:54:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-14 05:54:36,272 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 68 [2022-07-14 05:54:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:54:36,272 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-14 05:54:36,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.873015873015873) internal successors, (118), 55 states have internal predecessors, (118), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:54:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-14 05:54:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 05:54:36,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:54:36,273 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:54:36,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-07-14 05:54:36,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-14 05:54:36,679 WARN L477 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 [2022-07-14 05:54:36,680 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-14 05:54:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:54:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash 242750108, now seen corresponding path program 3 times [2022-07-14 05:54:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:54:36,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38785155] [2022-07-14 05:54:36,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:54:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:54:36,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:54:36,682 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:54:36,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-14 05:54:37,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:54:37,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 05:54:37,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 05:54:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 05:54:38,535 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 05:54:38,536 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 05:54:38,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2022-07-14 05:54:38,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-07-14 05:54:38,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-07-14 05:54:38,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-07-14 05:54:38,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-07-14 05:54:38,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-07-14 05:54:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-07-14 05:54:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-07-14 05:54:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location insert_listErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-07-14 05:54:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-07-14 05:54:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-07-14 05:54:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-07-14 05:54:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-07-14 05:54:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-07-14 05:54:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-07-14 05:54:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2022-07-14 05:54:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2022-07-14 05:54:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-07-14 05:54:38,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-07-14 05:54:38,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-07-14 05:54:38,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-07-14 05:54:38,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-14 05:54:38,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:54:38,765 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:54:38,768 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 05:54:38,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 05:54:38 BoogieIcfgContainer [2022-07-14 05:54:38,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 05:54:38,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 05:54:38,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 05:54:38,833 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 05:54:38,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:41" (3/4) ... [2022-07-14 05:54:38,835 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 05:54:38,895 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 05:54:38,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 05:54:38,896 INFO L158 Benchmark]: Toolchain (without parser) took 238650.41ms. Allocated memory was 50.3MB in the beginning and 117.4MB in the end (delta: 67.1MB). Free memory was 25.2MB in the beginning and 69.5MB in the end (delta: -44.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2022-07-14 05:54:38,896 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 32.3MB in the beginning and 32.3MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:54:38,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.34ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.0MB in the beginning and 36.7MB in the end (delta: -11.7MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-07-14 05:54:38,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.07ms. Allocated memory is still 65.0MB. Free memory was 36.7MB in the beginning and 48.3MB in the end (delta: -11.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2022-07-14 05:54:38,897 INFO L158 Benchmark]: Boogie Preprocessor took 49.81ms. Allocated memory is still 65.0MB. Free memory was 48.3MB in the beginning and 46.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:54:38,897 INFO L158 Benchmark]: RCFGBuilder took 436.65ms. Allocated memory is still 65.0MB. Free memory was 46.6MB in the beginning and 31.2MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 05:54:38,897 INFO L158 Benchmark]: TraceAbstraction took 237572.65ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 30.6MB in the beginning and 74.8MB in the end (delta: -44.2MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2022-07-14 05:54:38,897 INFO L158 Benchmark]: Witness Printer took 64.37ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 69.5MB in the end (delta: 5.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:54:38,898 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 50.3MB. Free memory was 32.3MB in the beginning and 32.3MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.34ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.0MB in the beginning and 36.7MB in the end (delta: -11.7MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.07ms. Allocated memory is still 65.0MB. Free memory was 36.7MB in the beginning and 48.3MB in the end (delta: -11.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.81ms. Allocated memory is still 65.0MB. Free memory was 48.3MB in the beginning and 46.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.65ms. Allocated memory is still 65.0MB. Free memory was 46.6MB in the beginning and 31.2MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 237572.65ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 30.6MB in the beginning and 74.8MB in the end (delta: -44.2MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Witness Printer took 64.37ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 69.5MB in the end (delta: 5.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(head)=null, \old(head)=null, \old(k)=2, head={0:0}, l={6:9}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=2, head={0:0}, k=2, l={6:9}, l={-2147483646:0}] [L544] COND TRUE head==((void *)0) VAL [\old(head)=null, \old(head)=null, \old(k)=2, head={0:0}, k=2, l={-2147483646:0}, l={6:9}] [L545] l->next = ((void *)0) VAL [\old(head)=null, \old(head)=null, \old(k)=2, head={0:0}, k=2, l={6:9}, l={-2147483646:0}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=2, \result=0, head={-2147483646:0}, k=2, l={-2147483646:0}, l={6:9}] [L556] RET insert_list(mylist,2) VAL [head={-2147483646:0}, insert_list(mylist,2)=0, mylist={6:9}] [L557] CALL insert_list(mylist,5) VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-2147483646:0}, l={6:9}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-2147483646:0}, k=5, l={7:0}, l={6:9}] [L544] COND FALSE !(head==((void *)0)) VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-2147483646:0}, k=5, l={6:9}, l={7:0}] [L547] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-2147483646:0}, k=5, l={7:0}, l={6:9}] [L548] l->next = head VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-2147483646:0}, k=5, l={6:9}, l={7:0}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=5, \result=0, head={7:0}, k=5, l={6:9}, l={7:0}] [L557] RET insert_list(mylist,5) VAL [head={7:0}, insert_list(mylist,5)=0, mylist={6:9}] [L558] CALL insert_list(mylist,1) VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, l={6:9}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, k=1, l={-2147483648:0}, l={6:9}] [L544] COND FALSE !(head==((void *)0)) VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, k=1, l={6:9}, l={-2147483648:0}] [L547] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, k=1, l={6:9}, l={-2147483648:0}] [L548] l->next = head VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, k=1, l={6:9}, l={-2147483648:0}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=1, \result=0, head={-2147483648:0}, k=1, l={6:9}, l={-2147483648:0}] [L558] RET insert_list(mylist,1) VAL [head={-2147483648:0}, insert_list(mylist,1)=0, mylist={6:9}] [L559] CALL insert_list(mylist,3) VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-2147483648:0}, l={6:9}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-2147483648:0}, k=3, l={6:9}, l={3:0}] [L544] COND FALSE !(head==((void *)0)) VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-2147483648:0}, k=3, l={3:0}, l={6:9}] [L547] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-2147483648:0}, k=3, l={3:0}, l={6:9}] [L548] l->next = head VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-2147483648:0}, k=3, l={6:9}, l={3:0}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=3, \result=0, head={3:0}, k=3, l={3:0}, l={6:9}] [L559] RET insert_list(mylist,3) VAL [head={3:0}, insert_list(mylist,3)=0, mylist={6:9}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={3:0}] [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={3:0}, l!=((void *)0) && l->key!=k=1] [L536] EXPR l->key VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={3:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={3:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={3:0}, l->next={-2147483648:0}] [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={-2147483648:0}, l!=((void *)0) && l->key!=k=1] [L536] EXPR l->key VAL [\old(k)=2, head={3:0}, k=2, l={-2147483648:0}, l={3:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={-2147483648:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next VAL [\old(k)=2, head={3:0}, k=2, l={-2147483648:0}, l={3:0}, l->next={7:0}] [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={7:0}, l={3:0}, l!=((void *)0) && l->key!=k=1] [L536] EXPR l->key VAL [\old(k)=2, head={3:0}, k=2, l={7:0}, l={3:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={7:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={7:0}, l->next={-2147483646:0}] [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={-2147483646:0}, l={3:0}, l!=((void *)0) && l->key!=k=1] [L536] EXPR l->key VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={-2147483646:0}, l!=((void *)0) && l->key!=k=1, l->key=2] [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={-2147483646:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [\old(k)=2, \result={-2147483646:0}, head={3:0}, k=2, l={3:0}, l={-2147483646:0}] [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key VAL [head={3:0}, mylist={6:9}, temp={-2147483646:0}, temp->key=2] [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, head={3:0}] [L15] reach_error() VAL [\old(cond)=0, cond=0, head={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 237.5s, OverallIterations: 25, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 63.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2556 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2556 mSDsluCounter, 10855 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4346 IncrementalHoareTripleChecker+Unchecked, 9815 mSDsCounter, 472 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5921 IncrementalHoareTripleChecker+Invalid, 10739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 472 mSolverCounterUnsat, 1040 mSDtfsCounter, 5921 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2885 GetRequests, 1923 SyntacticMatches, 49 SemanticMatches, 913 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 15203 ImplicationChecksByTransitivity, 130.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=23, InterpolantAutomatonStates: 437, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 476 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 16.6s SatisfiabilityAnalysisTime, 143.3s InterpolantComputationTime, 1989 NumberOfCodeBlocks, 1989 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2079 ConstructedInterpolants, 543 QuantifiedInterpolants, 69462 SizeOfPredicates, 523 NumberOfNonLiveVariables, 13090 ConjunctsInSsa, 1708 ConjunctsInUnsatCore, 39 InterpolantComputations, 9 PerfectInterpolantSequences, 1166/2015 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-14 05:54:39,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)