./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec 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/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:26:38,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:26:38,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:26:38,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:26:38,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:26:38,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:26:38,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:26:38,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:26:38,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:26:38,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:26:38,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:26:38,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:26:38,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:26:38,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:26:38,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:26:38,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:26:38,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:26:38,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:26:38,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:26:38,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:26:38,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:26:38,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:26:38,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:26:38,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:26:38,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:26:38,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:26:38,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:26:38,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:26:38,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:26:38,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:26:38,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:26:38,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:26:38,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:26:38,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:26:38,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:26:38,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:26:38,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:26:38,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:26:38,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:26:38,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:26:38,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:26:38,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:26:38,694 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:26:38,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:26:38,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:26:38,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:26:38,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:26:38,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:26:38,697 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:26:38,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:26:38,698 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:26:38,698 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:26:38,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:26:38,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:26:38,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:26:38,699 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:26:38,699 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:26:38,699 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:26:38,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:26:38,700 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:26:38,700 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:26:38,700 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:26:38,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:26:38,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:26:38,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:26:38,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:26:38,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:26:38,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:26:38,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:26:38,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:26:38,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:26:38,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 [2021-08-27 06:26:38,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:26:38,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:26:38,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:26:38,951 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:26:38,952 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:26:38,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-27 06:26:38,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5618036/40b5127e512b4670ba1dbf0c8d9958b3/FLAGb4f59e812 [2021-08-27 06:26:39,428 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:26:39,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-27 06:26:39,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5618036/40b5127e512b4670ba1dbf0c8d9958b3/FLAGb4f59e812 [2021-08-27 06:26:39,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5618036/40b5127e512b4670ba1dbf0c8d9958b3 [2021-08-27 06:26:39,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:26:39,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:26:39,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:26:39,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:26:39,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:26:39,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:26:39" (1/1) ... [2021-08-27 06:26:39,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c62b315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:39, skipping insertion in model container [2021-08-27 06:26:39,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:26:39" (1/1) ... [2021-08-27 06:26:39,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:26:39,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:26:40,190 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-27 06:26:40,206 WARN L549 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-08-27 06:26:40,207 WARN L549 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-08-27 06:26:40,207 WARN L549 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-08-27 06:26:40,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:26:40,242 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-08-27 06:26:40,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a5b9418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:40, skipping insertion in model container [2021-08-27 06:26:40,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:26:40,243 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2021-08-27 06:26:40,245 INFO L168 Benchmark]: Toolchain (without parser) took 413.27 ms. Allocated memory is still 65.0 MB. Free memory was 49.6 MB in the beginning and 44.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:26:40,246 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 48.2 MB. Free memory was 30.7 MB in the beginning and 30.7 MB in the end (delta: 51.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:26:40,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.27 ms. Allocated memory is still 65.0 MB. Free memory was 49.4 MB in the beginning and 44.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:26:40,248 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.13 ms. Allocated memory is still 48.2 MB. Free memory was 30.7 MB in the beginning and 30.7 MB in the end (delta: 51.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 410.27 ms. Allocated memory is still 65.0 MB. Free memory was 49.4 MB in the beginning and 44.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:26:41,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:26:41,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:26:41,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:26:41,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:26:41,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:26:41,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:26:41,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:26:41,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:26:41,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:26:41,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:26:41,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:26:41,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:26:41,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:26:41,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:26:41,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:26:41,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:26:41,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:26:41,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:26:41,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:26:41,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:26:41,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:26:41,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:26:41,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:26:41,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:26:41,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:26:41,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:26:41,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:26:41,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:26:41,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:26:41,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:26:41,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:26:41,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:26:41,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:26:41,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:26:41,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:26:41,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:26:41,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:26:41,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:26:41,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:26:41,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:26:41,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:26:41,856 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:26:41,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:26:41,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:26:41,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:26:41,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:26:41,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:26:41,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:26:41,858 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:26:41,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:26:41,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:26:41,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:26:41,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:26:41,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:26:41,860 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:26:41,860 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:26:41,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:26:41,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:26:41,860 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 [2021-08-27 06:26:42,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:26:42,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:26:42,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:26:42,200 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:26:42,201 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:26:42,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-27 06:26:42,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3141534e2/33110a50170c4b849c71a32e93adfcd9/FLAGfa5c02ab3 [2021-08-27 06:26:42,674 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:26:42,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-27 06:26:42,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3141534e2/33110a50170c4b849c71a32e93adfcd9/FLAGfa5c02ab3 [2021-08-27 06:26:42,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3141534e2/33110a50170c4b849c71a32e93adfcd9 [2021-08-27 06:26:43,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:26:43,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:26:43,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:26:43,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:26:43,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:26:43,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:26:42" (1/1) ... [2021-08-27 06:26:43,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5f95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43, skipping insertion in model container [2021-08-27 06:26:43,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:26:42" (1/1) ... [2021-08-27 06:26:43,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:26:43,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:26:43,307 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-27 06:26:43,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:26:43,364 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-08-27 06:26:43,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:26:43,382 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-27 06:26:43,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:26:43,398 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:26:43,420 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-27 06:26:43,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:26:43,474 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:26:43,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43 WrapperNode [2021-08-27 06:26:43,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:26:43,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:26:43,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:26:43,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:26:43,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:26:43,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:26:43,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:26:43,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:26:43,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (1/1) ... [2021-08-27 06:26:43,569 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:26:43,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:26:43,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:26:43,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:26:43,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:26:43,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:26:43,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:26:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:26:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 06:26:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 06:26:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-08-27 06:26:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2021-08-27 06:26:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-08-27 06:26:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2021-08-27 06:26:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2021-08-27 06:26:43,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:26:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:26:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:26:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:26:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:26:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:26:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:26:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 06:26:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 06:26:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:26:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:26:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:26:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:26:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:26:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:26:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:26:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:26:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:26:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:26:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:26:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:26:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:26:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:26:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:26:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:26:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:26:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:26:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:26:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:26:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:26:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:26:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:26:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:26:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:26:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:26:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:26:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:26:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:26:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:26:43,740 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:26:43,740 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:26:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:26:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:26:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:26:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:26:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:26:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:26:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:26:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:26:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:26:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:26:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:26:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:26:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:26:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:26:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:26:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:26:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:26:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:26:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:26:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:26:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:26:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:26:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:26:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:26:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:26:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:26:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:26:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:26:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:26:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:26:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:26:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:26:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:26:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:26:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:26:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:26:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:26:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:26:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:26:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:26:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:26:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:26:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:26:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:26:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2021-08-27 06:26:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2021-08-27 06:26:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2021-08-27 06:26:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2021-08-27 06:26:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2021-08-27 06:26:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2021-08-27 06:26:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2021-08-27 06:26:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2021-08-27 06:26:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2021-08-27 06:26:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2021-08-27 06:26:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2021-08-27 06:26:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2021-08-27 06:26:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2021-08-27 06:26:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:26:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:26:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:26:44,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:26:44,504 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2021-08-27 06:26:44,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:26:44 BoogieIcfgContainer [2021-08-27 06:26:44,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:26:44,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:26:44,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:26:44,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:26:44,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:26:42" (1/3) ... [2021-08-27 06:26:44,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2c66f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:26:44, skipping insertion in model container [2021-08-27 06:26:44,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:43" (2/3) ... [2021-08-27 06:26:44,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2c66f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:26:44, skipping insertion in model container [2021-08-27 06:26:44,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:26:44" (3/3) ... [2021-08-27 06:26:44,511 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2021-08-27 06:26:44,514 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:26:44,514 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-08-27 06:26:44,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:26:44,548 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:26:44,549 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-08-27 06:26:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 123 states have (on average 2.089430894308943) internal successors, (257), 213 states have internal predecessors, (257), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-08-27 06:26:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:26:44,570 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:44,570 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:44,570 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gl_insertErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:26:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash 963234318, now seen corresponding path program 1 times [2021-08-27 06:26:44,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:26:44,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586894122] [2021-08-27 06:26:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:44,581 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:26:44,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:26:44,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:26:44,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:26:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:44,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 06:26:44,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:44,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:26:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:44,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:26:44,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586894122] [2021-08-27 06:26:44,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586894122] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:44,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:44,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:26:44,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629911660] [2021-08-27 06:26:44,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 06:26:44,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:26:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 06:26:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 06:26:44,982 INFO L87 Difference]: Start difference. First operand has 240 states, 123 states have (on average 2.089430894308943) internal successors, (257), 213 states have internal predecessors, (257), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:26:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:45,052 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2021-08-27 06:26:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 06:26:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 06:26:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:45,060 INFO L225 Difference]: With dead ends: 236 [2021-08-27 06:26:45,067 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 06:26:45,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 06:26:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 06:26:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-08-27 06:26:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 206 states have internal predecessors, (209), 31 states have call successors, (31), 14 states have call predecessors, (31), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-08-27 06:26:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 255 transitions. [2021-08-27 06:26:45,171 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 255 transitions. Word has length 10 [2021-08-27 06:26:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:45,171 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 255 transitions. [2021-08-27 06:26:45,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:26:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 255 transitions. [2021-08-27 06:26:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:26:45,172 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:45,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:45,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:26:45,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:26:45,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gl_insertErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:26:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 963234380, now seen corresponding path program 1 times [2021-08-27 06:26:45,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:26:45,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700510790] [2021-08-27 06:26:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:45,381 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:26:45,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:26:45,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:26:45,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:26:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:45,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:26:45,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:45,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:26:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:45,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:26:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:45,828 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:26:45,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700510790] [2021-08-27 06:26:45,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700510790] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:45,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:45,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:26:45,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013276624] [2021-08-27 06:26:45,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:26:45,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:26:45,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:26:45,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:26:45,830 INFO L87 Difference]: Start difference. First operand 233 states and 255 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:26:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:45,987 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2021-08-27 06:26:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:26:45,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 06:26:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:45,989 INFO L225 Difference]: With dead ends: 230 [2021-08-27 06:26:45,989 INFO L226 Difference]: Without dead ends: 230 [2021-08-27 06:26:45,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:26:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-27 06:26:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-08-27 06:26:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 119 states have (on average 1.73109243697479) internal successors, (206), 203 states have internal predecessors, (206), 31 states have call successors, (31), 14 states have call predecessors, (31), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-08-27 06:26:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2021-08-27 06:26:45,999 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 10 [2021-08-27 06:26:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:46,000 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2021-08-27 06:26:46,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:26:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2021-08-27 06:26:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:26:46,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:46,000 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:46,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:26:46,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:26:46,231 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gl_insertErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:26:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash 963234381, now seen corresponding path program 1 times [2021-08-27 06:26:46,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:26:46,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949098918] [2021-08-27 06:26:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:46,232 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:26:46,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:26:46,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:26:46,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:26:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:46,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:26:46,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:46,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:26:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:46,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:26:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:46,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:26:46,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949098918] [2021-08-27 06:26:46,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949098918] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:46,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:46,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:26:46,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886932850] [2021-08-27 06:26:46,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:26:46,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:26:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:26:46,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:46,566 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:26:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:46,822 INFO L93 Difference]: Finished difference Result 227 states and 249 transitions. [2021-08-27 06:26:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:26:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 06:26:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:46,824 INFO L225 Difference]: With dead ends: 227 [2021-08-27 06:26:46,824 INFO L226 Difference]: Without dead ends: 227 [2021-08-27 06:26:46,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-08-27 06:26:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-08-27 06:26:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 119 states have (on average 1.7058823529411764) internal successors, (203), 200 states have internal predecessors, (203), 31 states have call successors, (31), 14 states have call predecessors, (31), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-08-27 06:26:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2021-08-27 06:26:46,832 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 10 [2021-08-27 06:26:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:46,832 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2021-08-27 06:26:46,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:26:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2021-08-27 06:26:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:26:46,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:46,833 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:46,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-27 06:26:47,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:26:47,042 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:26:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1039428672, now seen corresponding path program 1 times [2021-08-27 06:26:47,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:26:47,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867280967] [2021-08-27 06:26:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:47,042 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:26:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:26:47,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:26:47,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:26:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:47,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:26:47,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:47,298 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 06:26:47,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-27 06:26:47,453 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:26:47,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-08-27 06:26:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:47,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:27:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:27:01,113 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:27:01,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867280967] [2021-08-27 06:27:01,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867280967] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:01,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:01,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 06:27:01,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786244355] [2021-08-27 06:27:01,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:27:01,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:27:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:27:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2021-08-27 06:27:01,115 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:27:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:01,870 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2021-08-27 06:27:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:27:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-08-27 06:27:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:01,872 INFO L225 Difference]: With dead ends: 253 [2021-08-27 06:27:01,872 INFO L226 Difference]: Without dead ends: 253 [2021-08-27 06:27:01,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 13551.8ms TimeCoverageRelationStatistics Valid=45, Invalid=86, Unknown=1, NotChecked=0, Total=132 [2021-08-27 06:27:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-08-27 06:27:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 232. [2021-08-27 06:27:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 124 states have (on average 1.6774193548387097) internal successors, (208), 203 states have internal predecessors, (208), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-08-27 06:27:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2021-08-27 06:27:01,880 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 13 [2021-08-27 06:27:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:01,880 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2021-08-27 06:27:01,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:27:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2021-08-27 06:27:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:27:01,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:01,888 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:27:01,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:27:02,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:27:02,088 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:27:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1039428673, now seen corresponding path program 1 times [2021-08-27 06:27:02,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:27:02,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654281714] [2021-08-27 06:27:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:02,089 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:27:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:27:02,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:27:02,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:27:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:02,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 06:27:02,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:02,371 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-08-27 06:27:02,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-08-27 06:27:02,416 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 06:27:02,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 63 [2021-08-27 06:27:02,701 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-27 06:27:02,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2021-08-27 06:27:02,735 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-08-27 06:27:02,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 64 [2021-08-27 06:27:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:27:03,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:27:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:27:07,798 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:27:07,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654281714] [2021-08-27 06:27:07,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654281714] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:07,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:07,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-08-27 06:27:07,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99725622] [2021-08-27 06:27:07,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:27:07,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:27:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:27:07,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2021-08-27 06:27:07,799 INFO L87 Difference]: Start difference. First operand 232 states and 256 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:27:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:09,417 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2021-08-27 06:27:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:27:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-08-27 06:27:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:09,422 INFO L225 Difference]: With dead ends: 249 [2021-08-27 06:27:09,422 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 06:27:09,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4532.8ms TimeCoverageRelationStatistics Valid=59, Invalid=122, Unknown=1, NotChecked=0, Total=182 [2021-08-27 06:27:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 06:27:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2021-08-27 06:27:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 124 states have (on average 1.6370967741935485) internal successors, (203), 200 states have internal predecessors, (203), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-08-27 06:27:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2021-08-27 06:27:09,430 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 13 [2021-08-27 06:27:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:09,430 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2021-08-27 06:27:09,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:27:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2021-08-27 06:27:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:27:09,431 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:09,431 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:27:09,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:27:09,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:27:09,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __list_addErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:27:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1094064828, now seen corresponding path program 1 times [2021-08-27 06:27:09,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:27:09,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201299595] [2021-08-27 06:27:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:09,642 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:27:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:27:09,642 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:27:09,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:27:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:09,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:27:09,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:10,018 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 06:27:10,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-27 06:27:10,218 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:27:10,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-08-27 06:27:10,286 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-27 06:27:10,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 15 [2021-08-27 06:27:10,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-08-27 06:27:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:27:10,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:27:10,430 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-08-27 06:27:10,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-08-27 06:27:28,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_gl_insert_~node~1.base_19 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_19))))))) (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19) gl_insert_~node~1.offset v_DerPreprocessor_1) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_2) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_3) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_4)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) is different from false [2021-08-27 06:27:30,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_gl_insert_~node~1.base_19 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_19)))))))) (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19) gl_insert_~node~1.offset v_DerPreprocessor_1) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_2) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_3) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_4)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) is different from false [2021-08-27 06:27:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:27:31,075 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:27:31,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201299595] [2021-08-27 06:27:31,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201299595] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:31,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:31,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 11] imperfect sequences [] total 13 [2021-08-27 06:27:31,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81754449] [2021-08-27 06:27:31,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:27:31,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:27:31,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:27:31,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=100, Unknown=10, NotChecked=42, Total=182 [2021-08-27 06:27:31,076 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 6 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:27:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:34,068 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2021-08-27 06:27:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:27:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 6 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2021-08-27 06:27:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:34,069 INFO L225 Difference]: With dead ends: 252 [2021-08-27 06:27:34,070 INFO L226 Difference]: Without dead ends: 252 [2021-08-27 06:27:34,070 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 22616.0ms TimeCoverageRelationStatistics Valid=80, Invalid=259, Unknown=11, NotChecked=70, Total=420 [2021-08-27 06:27:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-08-27 06:27:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2021-08-27 06:27:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 135 states have (on average 1.637037037037037) internal successors, (221), 211 states have internal predecessors, (221), 35 states have call successors, (35), 18 states have call predecessors, (35), 14 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:27:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2021-08-27 06:27:34,085 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 16 [2021-08-27 06:27:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:34,086 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2021-08-27 06:27:34,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 6 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:27:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2021-08-27 06:27:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:27:34,087 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:34,087 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:27:34,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:27:34,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:27:34,298 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __list_addErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:27:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1094064827, now seen corresponding path program 1 times [2021-08-27 06:27:34,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:27:34,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543290794] [2021-08-27 06:27:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:34,299 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:27:34,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:27:34,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:27:34,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:27:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:34,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-27 06:27:34,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:34,653 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 06:27:34,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 49 [2021-08-27 06:27:34,700 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-08-27 06:27:34,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 63 [2021-08-27 06:27:35,162 INFO L354 Elim1Store]: treesize reduction -2, result has 108.0 percent of original size [2021-08-27 06:27:35,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2021-08-27 06:27:35,189 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-27 06:27:35,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 67 [2021-08-27 06:27:35,352 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-27 06:27:35,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 71 [2021-08-27 06:27:35,398 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-27 06:27:35,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 23 [2021-08-27 06:27:35,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-08-27 06:27:35,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-08-27 06:27:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:27:35,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:05,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse3 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse1 v_DerPreprocessor_10) .cse2 v_DerPreprocessor_11) .cse3 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| v_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))) is different from false [2021-08-27 06:28:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:19,555 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:19,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543290794] [2021-08-27 06:28:19,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543290794] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:19,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:19,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 10] imperfect sequences [] total 18 [2021-08-27 06:28:19,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156488544] [2021-08-27 06:28:19,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:28:19,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:28:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=256, Unknown=7, NotChecked=32, Total=342 [2021-08-27 06:28:19,556 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 8 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:28:24,082 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse5 (bvadd .cse4 (_ bv8 32)))) (and (exists ((gl_insert_~node~1.base (_ BitVec 32))) (= (select |c_#length| gl_insert_~node~1.base) (_ bv20 32))) (= (_ bv8 32) (select |c_#length| |c___list_add_#in~next.base|)) (= (_ bv0 32) |c___list_add_#in~next.offset|) (forall ((v_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse3 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse1 v_DerPreprocessor_10) .cse2 v_DerPreprocessor_11) .cse3 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| v_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20))))))) (= c___list_add_~next.offset (_ bv0 32)) (= (_ bv8 32) (select |c_#length| c___list_add_~next.base)) (bvule (bvadd (_ bv4 32) .cse4) .cse5) (bvule .cse5 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) is different from false [2021-08-27 06:28:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:31,534 INFO L93 Difference]: Finished difference Result 251 states and 275 transitions. [2021-08-27 06:28:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:28:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 8 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2021-08-27 06:28:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:31,538 INFO L225 Difference]: With dead ends: 251 [2021-08-27 06:28:31,538 INFO L226 Difference]: Without dead ends: 251 [2021-08-27 06:28:31,539 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 45787.1ms TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=8, NotChecked=90, Total=650 [2021-08-27 06:28:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-27 06:28:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2021-08-27 06:28:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 211 states have internal predecessors, (220), 35 states have call successors, (35), 18 states have call predecessors, (35), 14 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 274 transitions. [2021-08-27 06:28:31,544 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 274 transitions. Word has length 16 [2021-08-27 06:28:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:31,544 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 274 transitions. [2021-08-27 06:28:31,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 8 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:28:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 274 transitions. [2021-08-27 06:28:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:28:31,544 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:31,544 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:31,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:31,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:31,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __list_addErr2REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 443729184, now seen corresponding path program 1 times [2021-08-27 06:28:31,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:31,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965375663] [2021-08-27 06:28:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:31,753 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:31,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:31,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:28:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:32,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:28:32,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:32,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:28:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:32,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:32,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:32,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965375663] [2021-08-27 06:28:32,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965375663] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:32,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:32,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 06:28:32,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965215914] [2021-08-27 06:28:32,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:28:32,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:32,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:28:32,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:28:32,224 INFO L87 Difference]: Start difference. First operand 244 states and 274 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:32,996 INFO L93 Difference]: Finished difference Result 256 states and 283 transitions. [2021-08-27 06:28:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:28:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:28:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:32,998 INFO L225 Difference]: With dead ends: 256 [2021-08-27 06:28:32,998 INFO L226 Difference]: Without dead ends: 256 [2021-08-27 06:28:32,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 95.4ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-27 06:28:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2021-08-27 06:28:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 141 states have (on average 1.624113475177305) internal successors, (229), 216 states have internal predecessors, (229), 35 states have call successors, (35), 19 states have call predecessors, (35), 15 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2021-08-27 06:28:33,004 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 17 [2021-08-27 06:28:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:33,005 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2021-08-27 06:28:33,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2021-08-27 06:28:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:28:33,005 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:33,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:33,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:33,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:33,206 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __list_addErr3REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash 443729185, now seen corresponding path program 1 times [2021-08-27 06:28:33,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:33,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653196606] [2021-08-27 06:28:33,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:33,207 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:33,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:33,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:33,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:28:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:33,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:28:33,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:33,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:28:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:33,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:34,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:34,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653196606] [2021-08-27 06:28:34,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653196606] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:34,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:34,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-08-27 06:28:34,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278115112] [2021-08-27 06:28:34,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:28:34,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:28:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:28:34,082 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:35,943 INFO L93 Difference]: Finished difference Result 254 states and 279 transitions. [2021-08-27 06:28:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:28:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:28:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:35,946 INFO L225 Difference]: With dead ends: 254 [2021-08-27 06:28:35,946 INFO L226 Difference]: Without dead ends: 254 [2021-08-27 06:28:35,946 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 377.3ms TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:28:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-08-27 06:28:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2021-08-27 06:28:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 216 states have internal predecessors, (225), 35 states have call successors, (35), 19 states have call predecessors, (35), 15 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 279 transitions. [2021-08-27 06:28:35,951 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 279 transitions. Word has length 17 [2021-08-27 06:28:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:35,952 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 279 transitions. [2021-08-27 06:28:35,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 279 transitions. [2021-08-27 06:28:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:28:35,952 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:35,952 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:35,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:36,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:36,153 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __list_addErr6REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1221999107, now seen corresponding path program 1 times [2021-08-27 06:28:36,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:36,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893119028] [2021-08-27 06:28:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:36,153 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:36,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:36,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:36,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:28:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:36,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:28:36,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:36,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:36,607 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:36,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893119028] [2021-08-27 06:28:36,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893119028] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:36,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:36,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:28:36,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174213320] [2021-08-27 06:28:36,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:28:36,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:28:36,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:28:36,609 INFO L87 Difference]: Start difference. First operand 250 states and 279 transitions. Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:37,102 INFO L93 Difference]: Finished difference Result 249 states and 276 transitions. [2021-08-27 06:28:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:28:37,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:28:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:37,104 INFO L225 Difference]: With dead ends: 249 [2021-08-27 06:28:37,104 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 06:28:37,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:28:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 06:28:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-08-27 06:28:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 141 states have (on average 1.574468085106383) internal successors, (222), 215 states have internal predecessors, (222), 35 states have call successors, (35), 19 states have call predecessors, (35), 15 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 276 transitions. [2021-08-27 06:28:37,109 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 276 transitions. Word has length 19 [2021-08-27 06:28:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:37,109 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 276 transitions. [2021-08-27 06:28:37,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 276 transitions. [2021-08-27 06:28:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:28:37,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:37,110 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:37,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:37,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:37,311 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __list_addErr7REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:37,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1221999108, now seen corresponding path program 1 times [2021-08-27 06:28:37,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:37,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129711216] [2021-08-27 06:28:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:37,312 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:37,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:37,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:28:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:37,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:28:37,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:37,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:38,034 INFO L388 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 [2021-08-27 06:28:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:38,213 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:38,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129711216] [2021-08-27 06:28:38,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129711216] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:38,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:38,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-08-27 06:28:38,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964145279] [2021-08-27 06:28:38,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:28:38,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:28:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:28:38,214 INFO L87 Difference]: Start difference. First operand 249 states and 276 transitions. Second operand has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:28:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:39,341 INFO L93 Difference]: Finished difference Result 250 states and 273 transitions. [2021-08-27 06:28:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:28:39,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-08-27 06:28:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:39,343 INFO L225 Difference]: With dead ends: 250 [2021-08-27 06:28:39,343 INFO L226 Difference]: Without dead ends: 250 [2021-08-27 06:28:39,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 546.2ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:28:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-08-27 06:28:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2021-08-27 06:28:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 141 states have (on average 1.553191489361702) internal successors, (219), 214 states have internal predecessors, (219), 35 states have call successors, (35), 19 states have call predecessors, (35), 15 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 273 transitions. [2021-08-27 06:28:39,348 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 273 transitions. Word has length 19 [2021-08-27 06:28:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:39,348 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 273 transitions. [2021-08-27 06:28:39,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:28:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 273 transitions. [2021-08-27 06:28:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:28:39,349 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:39,349 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:39,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:39,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:39,557 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash 695927283, now seen corresponding path program 1 times [2021-08-27 06:28:39,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:39,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700031671] [2021-08-27 06:28:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:39,558 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:39,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:39,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:39,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:28:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:39,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:28:39,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:40,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:40,170 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:40,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700031671] [2021-08-27 06:28:40,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700031671] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:40,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:40,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:28:40,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403402357] [2021-08-27 06:28:40,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:28:40,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:28:40,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:28:40,171 INFO L87 Difference]: Start difference. First operand 248 states and 273 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 06:28:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:40,317 INFO L93 Difference]: Finished difference Result 247 states and 271 transitions. [2021-08-27 06:28:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:28:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 38 [2021-08-27 06:28:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:40,318 INFO L225 Difference]: With dead ends: 247 [2021-08-27 06:28:40,318 INFO L226 Difference]: Without dead ends: 247 [2021-08-27 06:28:40,319 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:28:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-27 06:28:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-08-27 06:28:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 141 states have (on average 1.5460992907801419) internal successors, (218), 213 states have internal predecessors, (218), 34 states have call successors, (34), 19 states have call predecessors, (34), 15 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2021-08-27 06:28:40,322 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 38 [2021-08-27 06:28:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:40,323 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2021-08-27 06:28:40,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 06:28:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2021-08-27 06:28:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:28:40,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:40,323 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:40,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:40,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:40,531 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting inspectErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash 695915251, now seen corresponding path program 1 times [2021-08-27 06:28:40,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:40,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247162206] [2021-08-27 06:28:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:40,532 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:40,533 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:40,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:28:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:40,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:28:40,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:41,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:41,369 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:28:41,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:28:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:41,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:41,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247162206] [2021-08-27 06:28:41,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247162206] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:41,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:41,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 7 [2021-08-27 06:28:41,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345466274] [2021-08-27 06:28:41,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:28:41,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:41,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:28:41,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:28:41,394 INFO L87 Difference]: Start difference. First operand 247 states and 271 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 06:28:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:42,059 INFO L93 Difference]: Finished difference Result 242 states and 266 transitions. [2021-08-27 06:28:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:28:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2021-08-27 06:28:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:42,061 INFO L225 Difference]: With dead ends: 242 [2021-08-27 06:28:42,061 INFO L226 Difference]: Without dead ends: 242 [2021-08-27 06:28:42,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 107.1ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-27 06:28:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-27 06:28:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 141 states have (on average 1.5106382978723405) internal successors, (213), 208 states have internal predecessors, (213), 34 states have call successors, (34), 19 states have call predecessors, (34), 15 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 266 transitions. [2021-08-27 06:28:42,068 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 266 transitions. Word has length 38 [2021-08-27 06:28:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:42,069 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 266 transitions. [2021-08-27 06:28:42,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 06:28:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2021-08-27 06:28:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:28:42,072 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:42,072 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:42,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-08-27 06:28:42,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:42,281 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting inspectErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 695915252, now seen corresponding path program 1 times [2021-08-27 06:28:42,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:42,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543722460] [2021-08-27 06:28:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:42,283 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:42,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:42,284 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:42,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 06:28:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:42,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:28:42,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:43,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:43,303 INFO L388 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 [2021-08-27 06:28:43,744 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:28:43,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2021-08-27 06:28:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:43,903 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:43,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543722460] [2021-08-27 06:28:43,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543722460] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:43,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:43,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2021-08-27 06:28:43,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468661331] [2021-08-27 06:28:43,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:28:43,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:28:43,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:28:43,906 INFO L87 Difference]: Start difference. First operand 242 states and 266 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-27 06:28:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:45,611 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2021-08-27 06:28:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:28:45,612 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2021-08-27 06:28:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:45,613 INFO L225 Difference]: With dead ends: 240 [2021-08-27 06:28:45,613 INFO L226 Difference]: Without dead ends: 240 [2021-08-27 06:28:45,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 551.5ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-08-27 06:28:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-08-27 06:28:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-08-27 06:28:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 141 states have (on average 1.49645390070922) internal successors, (211), 206 states have internal predecessors, (211), 34 states have call successors, (34), 19 states have call predecessors, (34), 15 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-27 06:28:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 264 transitions. [2021-08-27 06:28:45,617 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 264 transitions. Word has length 38 [2021-08-27 06:28:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:45,617 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 264 transitions. [2021-08-27 06:28:45,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-27 06:28:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 264 transitions. [2021-08-27 06:28:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 06:28:45,618 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:45,618 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:45,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:45,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:45,825 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __list_addErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:28:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1621786009, now seen corresponding path program 1 times [2021-08-27 06:28:45,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:45,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2466337] [2021-08-27 06:28:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:45,826 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:45,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:45,828 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:45,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:28:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:46,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-27 06:28:46,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:46,393 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 06:28:46,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-27 06:28:46,514 INFO L388 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 [2021-08-27 06:28:46,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2021-08-27 06:28:46,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:28:46,938 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:28:46,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:28:47,032 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:28:47,033 INFO L388 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 64 treesize of output 45 [2021-08-27 06:28:53,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:28:53,201 INFO L354 Elim1Store]: treesize reduction 18, result has 30.8 percent of original size [2021-08-27 06:28:53,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 33 [2021-08-27 06:28:59,553 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-08-27 06:28:59,554 INFO L388 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 40 treesize of output 61 [2021-08-27 06:28:59,940 INFO L354 Elim1Store]: treesize reduction 809, result has 3.1 percent of original size [2021-08-27 06:28:59,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 127 treesize of output 67 [2021-08-27 06:29:00,361 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-27 06:29:00,362 INFO L388 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 114 treesize of output 73 [2021-08-27 06:29:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:00,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:03,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_gl_insert_~node~1.base) gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:29:05,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_42 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_gl_insert_~node~1.base_42 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_42 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_42) gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| v_gl_insert_~node~1.base_42))))) is different from false [2021-08-27 06:29:05,806 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:05,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2466337] [2021-08-27 06:29:05,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-27 06:29:05,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1449654688] [2021-08-27 06:29:05,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:05,807 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:29:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:29:05,821 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) [2021-08-27 06:29:05,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-08-27 06:29:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:06,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-27 06:29:06,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:06,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-08-27 06:29:06,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:29:08,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:29:08,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:08,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:29:09,069 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:29:09,069 INFO L388 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 63 treesize of output 44 [2021-08-27 06:29:09,664 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-08-27 06:29:09,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 40 [2021-08-27 06:29:10,161 INFO L354 Elim1Store]: treesize reduction 809, result has 3.1 percent of original size [2021-08-27 06:29:10,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 69 [2021-08-27 06:29:10,821 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-27 06:29:10,821 INFO L388 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 98 treesize of output 57 [2021-08-27 06:29:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:11,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:36,229 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:29:36,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 7054 treesize of output 6892 [2021-08-27 06:29:36,414 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-27 06:29:36,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304138857] [2021-08-27 06:29:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:36,415 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:36,416 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:36,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 06:29:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:37,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-27 06:29:37,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:37,168 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 06:29:37,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-27 06:29:37,282 INFO L388 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 9 treesize of output 7 [2021-08-27 06:29:37,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2021-08-27 06:29:37,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:29:37,956 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:29:37,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:29:38,239 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:29:38,239 INFO L388 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 64 treesize of output 45 [2021-08-27 06:29:48,589 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-08-27 06:29:48,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2021-08-27 06:29:50,891 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-08-27 06:29:50,892 INFO L388 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 58 [2021-08-27 06:29:51,344 INFO L354 Elim1Store]: treesize reduction 809, result has 3.1 percent of original size [2021-08-27 06:29:51,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 127 treesize of output 67 [2021-08-27 06:29:51,598 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-27 06:29:51,599 INFO L388 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 114 treesize of output 73 [2021-08-27 06:29:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:51,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:30:05,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_52 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_gl_insert_~node~1.base_52)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_gl_insert_~node~1.base_52 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_52 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_52) gl_insert_~node~1.offset v_DerPreprocessor_17) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_18) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_19) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_20)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))) (_ bv1 1))))) is different from false [2021-08-27 06:30:06,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-27 06:30:06,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:30:06,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:30:06,112 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:30:06,112 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:30:06,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr2REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr3REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr2REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr3REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr4REQUIRES_VIOLATION [2021-08-27 06:30:06,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr5REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr2REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr3REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr2REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr3REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr4REQUIRES_VIOLATION [2021-08-27 06:30:06,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr5REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr6REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr7REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr8REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr9REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr10REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr11REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr12REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr13REQUIRES_VIOLATION [2021-08-27 06:30:06,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr14REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr15REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr16REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr17REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr18REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr19REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr20REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr21REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr22REQUIRES_VIOLATION [2021-08-27 06:30:06,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr23REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr24REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr25REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr26REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr27REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr28REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr29REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location val_from_nodeErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location val_from_nodeErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr2REQUIRES_VIOLATION [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr3REQUIRES_VIOLATION [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr4REQUIRES_VIOLATION [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr5REQUIRES_VIOLATION [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:30:06,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr2REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr3REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr4REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr5REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr6REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr7REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr0REQUIRES_VIOLATION [2021-08-27 06:30:06,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr1REQUIRES_VIOLATION [2021-08-27 06:30:06,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr2REQUIRES_VIOLATION [2021-08-27 06:30:06,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr3REQUIRES_VIOLATION [2021-08-27 06:30:06,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2021-08-27 06:30:06,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:06,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:06,749 WARN L452 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:30:06,755 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:30:06,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:30:06 BoogieIcfgContainer [2021-08-27 06:30:06,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:30:06,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:30:06,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:30:06,764 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:30:06,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:26:44" (3/4) ... [2021-08-27 06:30:06,766 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:30:06,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:30:06,767 INFO L168 Benchmark]: Toolchain (without parser) took 203764.16 ms. Allocated memory was 73.4 MB in the beginning and 195.0 MB in the end (delta: 121.6 MB). Free memory was 53.7 MB in the beginning and 106.4 MB in the end (delta: -52.7 MB). Peak memory consumption was 68.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:30:06,767 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 73.4 MB. Free memory was 54.2 MB in the beginning and 54.2 MB in the end (delta: 49.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:30:06,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.37 ms. Allocated memory is still 73.4 MB. Free memory was 53.6 MB in the beginning and 33.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-27 06:30:06,767 INFO L168 Benchmark]: Boogie Preprocessor took 72.54 ms. Allocated memory is still 73.4 MB. Free memory was 33.3 MB in the beginning and 52.1 MB in the end (delta: -18.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:30:06,768 INFO L168 Benchmark]: RCFGBuilder took 957.67 ms. Allocated memory was 73.4 MB in the beginning and 102.8 MB in the end (delta: 29.4 MB). Free memory was 52.1 MB in the beginning and 66.3 MB in the end (delta: -14.2 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. [2021-08-27 06:30:06,768 INFO L168 Benchmark]: TraceAbstraction took 202256.49 ms. Allocated memory was 102.8 MB in the beginning and 195.0 MB in the end (delta: 92.3 MB). Free memory was 65.6 MB in the beginning and 106.4 MB in the end (delta: -40.8 MB). Peak memory consumption was 110.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:30:06,768 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 195.0 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:30:06,794 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.15 ms. Allocated memory is still 73.4 MB. Free memory was 54.2 MB in the beginning and 54.2 MB in the end (delta: 49.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 471.37 ms. Allocated memory is still 73.4 MB. Free memory was 53.6 MB in the beginning and 33.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.54 ms. Allocated memory is still 73.4 MB. Free memory was 33.3 MB in the beginning and 52.1 MB in the end (delta: -18.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 957.67 ms. Allocated memory was 73.4 MB in the beginning and 102.8 MB in the end (delta: 29.4 MB). Free memory was 52.1 MB in the beginning and 66.3 MB in the end (delta: -14.2 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 202256.49 ms. Allocated memory was 102.8 MB in the beginning and 195.0 MB in the end (delta: 92.3 MB). Free memory was 65.6 MB in the beginning and 106.4 MB in the end (delta: -40.8 MB). Peak memory consumption was 110.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.55 ms. Allocated memory is still 195.0 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L903] CALL list_add(&node->linkage, &gl_list) [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->prev = (&node->nested) [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND TRUE __VERIFIER_nondet_int() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L903] CALL list_add(&node->linkage, &gl_list) [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 947]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 255 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 202209.5ms, OverallIterations: 15, TraceHistogramMax: 2, EmptinessCheckTime: 28.1ms, AutomataDifference: 24682.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2949 SDtfs, 3615 SDslu, 9159 SDs, 0 SdLazy, 5020 SolverSat, 591 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16480.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 405 SyntacticMatches, 33 SemanticMatches, 146 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 88264.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=8, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 181.6ms AutomataMinimizationTime, 14 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 173.0ms SsaConstructionTime, 512.6ms SatisfiabilityAnalysisTime, 89416.2ms InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 520 ConstructedInterpolants, 51 QuantifiedInterpolants, 5431 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:30:06,862 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...