./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea70fe63854da4e5982713e252f1eed95e7b26c9 .................................................................................................................................... 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea70fe63854da4e5982713e252f1eed95e7b26c9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:26:11,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:11,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:11,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:11,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:11,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:11,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:11,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:11,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:11,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:11,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:11,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:11,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:11,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:11,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:11,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:11,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:11,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:11,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:11,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:11,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:11,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:11,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:11,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:11,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:11,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:11,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:11,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:11,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:11,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:11,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:11,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:11,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:11,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:11,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:11,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:11,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:11,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:11,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:11,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:11,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:11,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:11,283 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:11,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:11,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:11,284 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:11,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:11,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:11,286 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:11,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:11,287 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:11,287 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:11,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:11,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:11,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:11,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:11,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:11,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:11,289 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:11,289 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:11,290 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:11,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:11,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:11,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:11,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:11,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:11,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:11,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:11,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:11,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:11,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea70fe63854da4e5982713e252f1eed95e7b26c9 [2021-08-27 04:26:11,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:11,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:11,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:11,674 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:11,675 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:11,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-08-27 04:26:11,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2c14351/997b4230396a47948b09158205386dc0/FLAG6f38c51b2 [2021-08-27 04:26:12,296 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:12,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-08-27 04:26:12,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2c14351/997b4230396a47948b09158205386dc0/FLAG6f38c51b2 [2021-08-27 04:26:12,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2c14351/997b4230396a47948b09158205386dc0 [2021-08-27 04:26:12,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:12,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:12,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:12,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:12,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ebdeb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12, skipping insertion in model container [2021-08-27 04:26:12,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:12,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:13,030 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-2.i[33822,33835] [2021-08-27 04:26:13,049 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 04:26:13,051 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 04:26:13,052 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 04:26:13,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:13,108 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 04:26:13,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3bee4793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:13,109 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2021-08-27 04:26:13,111 INFO L168 Benchmark]: Toolchain (without parser) took 496.74 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 32.7 MB in the beginning and 38.2 MB in the end (delta: -5.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:13,113 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 48.2 MB. Free memory was 30.6 MB in the beginning and 30.5 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:26:13,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.63 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 32.5 MB in the beginning and 38.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:13,115 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.20 ms. Allocated memory is still 48.2 MB. Free memory was 30.6 MB in the beginning and 30.5 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 494.63 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 32.5 MB in the beginning and 38.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 10.5 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 04:26:14,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:14,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:14,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:14,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:14,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:14,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:14,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:14,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:14,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:14,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:14,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:14,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:14,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:14,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:14,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:14,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:14,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:14,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:14,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:14,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:14,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:14,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:14,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:14,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:14,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:14,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:14,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:14,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:14,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:14,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:14,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:14,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:14,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:14,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:14,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:14,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:14,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:14,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:14,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:14,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:14,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2021-08-27 04:26:14,961 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:14,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:14,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:14,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:14,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:14,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:14,966 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:14,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:14,966 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:14,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:14,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:14,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:14,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:14,968 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:14,968 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:14,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:14,969 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:14,969 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 04:26:14,969 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 04:26:14,969 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:14,969 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:14,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:14,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:14,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:14,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:14,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:14,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:14,971 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 04:26:14,971 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 04:26:14,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:14,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 04:26:14,972 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea70fe63854da4e5982713e252f1eed95e7b26c9 [2021-08-27 04:26:15,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:15,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:15,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:15,335 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:15,335 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:15,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-08-27 04:26:15,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d61b2bc/82f1bf63c1184625802aa6f5416febb0/FLAG1beb230e9 [2021-08-27 04:26:15,947 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:15,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-08-27 04:26:15,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d61b2bc/82f1bf63c1184625802aa6f5416febb0/FLAG1beb230e9 [2021-08-27 04:26:16,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d61b2bc/82f1bf63c1184625802aa6f5416febb0 [2021-08-27 04:26:16,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:16,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:16,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:16,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:16,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:16,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:16,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8a9321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16, skipping insertion in model container [2021-08-27 04:26:16,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:16,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:16,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:16,636 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-2.i[33822,33835] [2021-08-27 04:26:16,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:16,708 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-08-27 04:26:16,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:16,746 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-2.i[33822,33835] [2021-08-27 04:26:16,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:16,788 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:16,840 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-2.i[33822,33835] [2021-08-27 04:26:16,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:16,908 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:16,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16 WrapperNode [2021-08-27 04:26:16,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:16,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:16,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:16,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:16,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:16,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:16,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:16,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:16,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:16,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:17,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:17,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:17,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:17,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:17,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:17,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (1/1) ... [2021-08-27 04:26:17,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:17,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:17,058 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 04:26:17,090 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 04:26:17,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:17,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:17,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 04:26:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 04:26:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 04:26:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2021-08-27 04:26:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2021-08-27 04:26:17,116 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2021-08-27 04:26:17,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 04:26:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:17,125 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:17,125 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:17,125 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:17,125 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:17,125 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:17,125 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:17,132 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:17,133 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:17,133 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:17,133 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2021-08-27 04:26:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2021-08-27 04:26:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2021-08-27 04:26:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2021-08-27 04:26:17,135 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2021-08-27 04:26:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2021-08-27 04:26:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2021-08-27 04:26:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2021-08-27 04:26:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2021-08-27 04:26:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2021-08-27 04:26:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2021-08-27 04:26:17,144 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2021-08-27 04:26:17,145 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2021-08-27 04:26:17,146 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2021-08-27 04:26:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2021-08-27 04:26:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2021-08-27 04:26:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:17,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 04:26:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 04:26:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 04:26:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 04:26:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 04:26:18,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:18,477 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2021-08-27 04:26:18,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:18 BoogieIcfgContainer [2021-08-27 04:26:18,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:18,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:18,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:18,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:18,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:16" (1/3) ... [2021-08-27 04:26:18,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d13ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:18, skipping insertion in model container [2021-08-27 04:26:18,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:16" (2/3) ... [2021-08-27 04:26:18,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d13ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:18, skipping insertion in model container [2021-08-27 04:26:18,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:18" (3/3) ... [2021-08-27 04:26:18,488 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2021-08-27 04:26:18,492 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:18,493 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-08-27 04:26:18,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:18,531 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 04:26:18,532 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-08-27 04:26:18,548 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 04:26:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 04:26:18,555 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:18,555 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:18,556 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 04:26:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 963234318, now seen corresponding path program 1 times [2021-08-27 04:26:18,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:18,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243504354] [2021-08-27 04:26:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:18,571 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:18,577 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 04:26:18,584 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 04:26:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 04:26:18,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:18,901 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 04:26:18,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:18,940 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 04:26:18,941 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:18,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243504354] [2021-08-27 04:26:18,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243504354] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 04:26:18,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17116607] [2021-08-27 04:26:18,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 04:26:18,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 04:26:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 04:26:18,961 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 04:26:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,011 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2021-08-27 04:26:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 04:26:19,013 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 04:26:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,021 INFO L225 Difference]: With dead ends: 236 [2021-08-27 04:26:19,036 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 04:26:19,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 04:26:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 04:26:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-08-27 04:26:19,108 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 04:26:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 255 transitions. [2021-08-27 04:26:19,116 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 255 transitions. Word has length 10 [2021-08-27 04:26:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,116 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 255 transitions. [2021-08-27 04:26:19,117 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 04:26:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 255 transitions. [2021-08-27 04:26:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 04:26:19,117 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,117 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:19,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-27 04:26:19,318 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 04:26:19,318 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 04:26:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash 963234380, now seen corresponding path program 1 times [2021-08-27 04:26:19,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:19,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28152034] [2021-08-27 04:26:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,320 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:19,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:19,321 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 04:26:19,323 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 04:26:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 04:26:19,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:19,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, 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 04:26:19,670 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 04:26:19,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:19,719 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 04:26:19,719 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:19,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28152034] [2021-08-27 04:26:19,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28152034] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 04:26:19,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489266259] [2021-08-27 04:26:19,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 04:26:19,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 04:26:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:19,726 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 04:26:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,973 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2021-08-27 04:26:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 04:26:19,974 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 04:26:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,976 INFO L225 Difference]: With dead ends: 230 [2021-08-27 04:26:19,976 INFO L226 Difference]: Without dead ends: 230 [2021-08-27 04:26:19,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-27 04:26:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-08-27 04:26:19,991 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 04:26:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2021-08-27 04:26:19,995 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 10 [2021-08-27 04:26:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,997 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2021-08-27 04:26:19,997 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 04:26:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2021-08-27 04:26:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 04:26:19,998 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,998 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:20,010 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 04:26:20,198 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 04:26:20,199 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 04:26:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash 963234381, now seen corresponding path program 1 times [2021-08-27 04:26:20,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:20,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247211926] [2021-08-27 04:26:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,200 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:20,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:20,201 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 04:26:20,203 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 04:26:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 04:26:20,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:20,498 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 04:26:20,535 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 04:26:20,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:20,627 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 04:26:20,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:20,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247211926] [2021-08-27 04:26:20,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247211926] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 04:26:20,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901364792] [2021-08-27 04:26:20,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:20,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:20,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:20,636 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 04:26:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,029 INFO L93 Difference]: Finished difference Result 227 states and 249 transitions. [2021-08-27 04:26:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 04:26:21,030 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 04:26:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,031 INFO L225 Difference]: With dead ends: 227 [2021-08-27 04:26:21,031 INFO L226 Difference]: Without dead ends: 227 [2021-08-27 04:26:21,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-08-27 04:26:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-08-27 04:26:21,042 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 04:26:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2021-08-27 04:26:21,044 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 10 [2021-08-27 04:26:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,044 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2021-08-27 04:26:21,045 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 04:26:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2021-08-27 04:26:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 04:26:21,045 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,045 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:21,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:21,260 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 04:26:21,260 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 04:26:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1039428672, now seen corresponding path program 1 times [2021-08-27 04:26:21,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:21,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602233085] [2021-08-27 04:26:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,261 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:21,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:21,262 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 04:26:21,270 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 04:26:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 04:26:21,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:21,625 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 04:26:21,626 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 04:26:21,982 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 04:26:21,983 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 04:26:22,236 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 04:26:22,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:42,874 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:42,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602233085] [2021-08-27 04:26:42,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602233085] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:42,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:42,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 04:26:42,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303816413] [2021-08-27 04:26:42,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:42,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2021-08-27 04:26:42,876 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 04:26:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:43,955 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2021-08-27 04:26:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:43,955 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 04:26:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:43,957 INFO L225 Difference]: With dead ends: 253 [2021-08-27 04:26:43,957 INFO L226 Difference]: Without dead ends: 253 [2021-08-27 04:26:43,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 20599.9ms TimeCoverageRelationStatistics Valid=45, Invalid=85, Unknown=2, NotChecked=0, Total=132 [2021-08-27 04:26:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-08-27 04:26:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 232. [2021-08-27 04:26:43,966 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 04:26:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2021-08-27 04:26:43,967 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 13 [2021-08-27 04:26:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:43,967 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2021-08-27 04:26:43,968 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 04:26:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2021-08-27 04:26:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 04:26:43,968 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:43,968 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:43,992 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 04:26:44,177 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 04:26:44,177 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 04:26:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1039428673, now seen corresponding path program 1 times [2021-08-27 04:26:44,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:44,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059044798] [2021-08-27 04:26:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:44,179 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:44,179 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 04:26:44,180 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 04:26:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:44,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 04:26:44,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:44,490 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-08-27 04:26:44,491 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 04:26:44,556 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 04:26:44,556 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 04:26:44,947 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-27 04:26:44,947 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 04:26:44,976 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-08-27 04:26:44,976 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 04:26:45,564 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 04:26:45,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:50,449 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 04:26:50,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:50,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059044798] [2021-08-27 04:26:50,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059044798] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:50,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:50,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-08-27 04:26:50,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025488228] [2021-08-27 04:26:50,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:50,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:50,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:50,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2021-08-27 04:26:50,451 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 04:26:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:52,929 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2021-08-27 04:26:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:52,929 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 04:26:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:52,931 INFO L225 Difference]: With dead ends: 249 [2021-08-27 04:26:52,931 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 04:26:52,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4757.1ms TimeCoverageRelationStatistics Valid=59, Invalid=122, Unknown=1, NotChecked=0, Total=182 [2021-08-27 04:26:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 04:26:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2021-08-27 04:26:52,939 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 04:26:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2021-08-27 04:26:52,941 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 13 [2021-08-27 04:26:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:52,941 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2021-08-27 04:26:52,941 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 04:26:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2021-08-27 04:26:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:52,942 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:52,942 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:52,954 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 04:26:53,157 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 04:26:53,157 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 04:26:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1094064828, now seen corresponding path program 1 times [2021-08-27 04:26:53,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:53,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069615200] [2021-08-27 04:26:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,158 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:53,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:53,164 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 04:26:53,166 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 04:26:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 04:26:53,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:53,526 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 04:26:53,526 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 04:26:53,804 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:53,804 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 04:26:53,903 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-27 04:26:53,904 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 04:26:53,960 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 04:26:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:54,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:54,099 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-08-27 04:26:54,100 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 04:27:03,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_19 (_ BitVec 32))) (or (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))) (= |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|))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_19)))))))) is different from false [2021-08-27 04:27:05,711 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 04:27:07,753 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 04:27:07,950 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 04:27:07,951 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:07,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069615200] [2021-08-27 04:27:07,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069615200] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:27:07,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:27:07,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 11] imperfect sequences [] total 13 [2021-08-27 04:27:07,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879575470] [2021-08-27 04:27:07,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 04:27:07,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 04:27:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=88, Unknown=5, NotChecked=60, Total=182 [2021-08-27 04:27:07,952 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 04:27:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:09,031 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2021-08-27 04:27:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:27:09,032 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 04:27:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:09,033 INFO L225 Difference]: With dead ends: 252 [2021-08-27 04:27:09,033 INFO L226 Difference]: Without dead ends: 252 [2021-08-27 04:27:09,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 13795.5ms TimeCoverageRelationStatistics Valid=73, Invalid=240, Unknown=5, NotChecked=102, Total=420 [2021-08-27 04:27:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-08-27 04:27:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2021-08-27 04:27:09,040 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 04:27:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2021-08-27 04:27:09,042 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 16 [2021-08-27 04:27:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:09,042 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2021-08-27 04:27:09,042 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 04:27:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2021-08-27 04:27:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:27:09,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:09,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:27:09,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-27 04:27:09,248 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 04:27:09,249 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 04:27:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1094064827, now seen corresponding path program 1 times [2021-08-27 04:27:09,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:27:09,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557714028] [2021-08-27 04:27:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:09,250 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:27:09,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:27:09,251 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 04:27:09,252 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 04:27:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:09,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-27 04:27:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:09,682 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 04:27:09,683 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 04:27:09,733 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-08-27 04:27:09,733 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 04:27:10,319 INFO L354 Elim1Store]: treesize reduction -2, result has 108.0 percent of original size [2021-08-27 04:27:10,320 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 04:27:10,377 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-27 04:27:10,378 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 04:27:10,708 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-27 04:27:10,709 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 04:27:10,787 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-27 04:27:10,788 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 04:27:10,962 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 04:27:10,971 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 04:27:11,124 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 04:27:11,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:14,109 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse1 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse2 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| c_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_gl_insert_~node~1.base) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse0 v_DerPreprocessor_10) .cse1 v_DerPreprocessor_11) .cse2 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (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_5) .cse0 v_DerPreprocessor_6) .cse1 v_DerPreprocessor_7) .cse2 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) (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 ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| c_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_gl_insert_~node~1.base) 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 (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2021-08-27 04:27:16,313 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 (select |c_#valid| v_gl_insert_~node~1.base_20))))))) is different from false [2021-08-27 04:27:33,474 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 (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))))) is different from false [2021-08-27 04:27:35,667 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 (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))))))) is different from false [2021-08-27 04:27:36,063 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 04:27:36,063 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:36,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557714028] [2021-08-27 04:27:36,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557714028] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:27:36,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:27:36,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 12] imperfect sequences [] total 20 [2021-08-27 04:27:36,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77076811] [2021-08-27 04:27:36,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 04:27:36,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 04:27:36,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=230, Unknown=9, NotChecked=132, Total=420 [2021-08-27 04:27:36,065 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 9 states have call successors, (11), 9 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 04:27:38,120 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (let ((.cse0 (select |c_#length| (_ bv0 32)))) (or (= (_ bv22 32) .cse0) (= |c_~#gl_list~0.base| (_ bv0 32)) (= (_ bv2 32) .cse0) (= (_ bv0 1) (select |c_#valid| (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.offset|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_~#gl_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_~#gl_list~0.base|)))) (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 ((.cse1 (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 .cse1 (_ bv4 32)) (bvadd .cse1 (_ 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 ((.cse2 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse3 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse4 (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) .cse2 v_DerPreprocessor_10) .cse3 v_DerPreprocessor_11) .cse4 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) .cse2 v_DerPreprocessor_6) .cse3 v_DerPreprocessor_7) .cse4 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20))))))))))))) is different from false [2021-08-27 04:27:40,245 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.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 (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))))) (let ((.cse4 (select |c_#length| (_ bv0 32)))) (or (= (_ bv22 32) .cse4) (= |c_~#gl_list~0.base| (_ bv0 32)) (= (_ bv2 32) .cse4) (= (_ bv0 1) (select |c_#valid| (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.offset|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_~#gl_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_~#gl_list~0.base|))))) is different from false [2021-08-27 04:27:42,322 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (let ((.cse0 (select |c_#length| (_ bv0 32)))) (or (= (_ bv22 32) .cse0) (= |c_~#gl_list~0.base| (_ bv0 32)) (= (_ bv2 32) .cse0) (= (_ bv0 1) (select |c_#valid| (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.offset|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_~#gl_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_~#gl_list~0.base|)))) (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 ((.cse1 (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 .cse1 (_ bv4 32)) (bvadd .cse1 (_ 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 ((.cse2 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse3 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse4 (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) .cse2 v_DerPreprocessor_10) .cse3 v_DerPreprocessor_11) .cse4 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) .cse2 v_DerPreprocessor_6) .cse3 v_DerPreprocessor_7) .cse4 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)))))))) is different from false [2021-08-27 04:27:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:51,250 INFO L93 Difference]: Finished difference Result 251 states and 275 transitions. [2021-08-27 04:27:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 04:27:51,251 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 9 states have call successors, (11), 9 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 04:27:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:51,253 INFO L225 Difference]: With dead ends: 251 [2021-08-27 04:27:51,253 INFO L226 Difference]: Without dead ends: 251 [2021-08-27 04:27:51,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 30925.2ms TimeCoverageRelationStatistics Valid=113, Invalid=455, Unknown=12, NotChecked=350, Total=930 [2021-08-27 04:27:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-27 04:27:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2021-08-27 04:27:51,259 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 04:27:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 274 transitions. [2021-08-27 04:27:51,260 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 274 transitions. Word has length 16 [2021-08-27 04:27:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:51,261 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 274 transitions. [2021-08-27 04:27:51,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 9 states have call successors, (11), 9 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 04:27:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 274 transitions. [2021-08-27 04:27:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 04:27:51,262 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:51,262 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 04:27:51,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-08-27 04:27:51,472 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 04:27:51,473 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 04:27:51,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:51,473 INFO L82 PathProgramCache]: Analyzing trace with hash 443729184, now seen corresponding path program 1 times [2021-08-27 04:27:51,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:27:51,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663151274] [2021-08-27 04:27:51,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:51,474 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:27:51,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:27:51,475 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 04:27:51,475 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 04:27:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:51,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 04:27:51,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:51,817 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 04:27:51,909 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 04:27:51,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:52,002 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 04:27:52,003 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:52,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663151274] [2021-08-27 04:27:52,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663151274] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:27:52,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:27:52,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 04:27:52,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762130823] [2021-08-27 04:27:52,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:27:52,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:52,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:27:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:27:52,004 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 04:27:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:52,940 INFO L93 Difference]: Finished difference Result 256 states and 283 transitions. [2021-08-27 04:27:52,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:27:52,941 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 04:27:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:52,942 INFO L225 Difference]: With dead ends: 256 [2021-08-27 04:27:52,942 INFO L226 Difference]: Without dead ends: 256 [2021-08-27 04:27:52,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 105.7ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:27:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-27 04:27:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2021-08-27 04:27:52,948 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 04:27:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2021-08-27 04:27:52,951 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 17 [2021-08-27 04:27:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:52,952 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2021-08-27 04:27:52,952 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 04:27:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2021-08-27 04:27:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 04:27:52,953 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:52,953 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 04:27:52,965 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 04:27:53,154 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 04:27:53,154 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 04:27:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 443729185, now seen corresponding path program 1 times [2021-08-27 04:27:53,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:27:53,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67128437] [2021-08-27 04:27:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:53,155 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:27:53,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:27:53,156 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 04:27:53,183 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 04:27:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:53,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 04:27:53,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:53,544 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 04:27:53,752 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 04:27:53,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:54,173 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 04:27:54,173 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:54,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67128437] [2021-08-27 04:27:54,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67128437] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:27:54,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:27:54,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-08-27 04:27:54,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677616823] [2021-08-27 04:27:54,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 04:27:54,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:54,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 04:27:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:27:54,175 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 04:27:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:56,189 INFO L93 Difference]: Finished difference Result 254 states and 279 transitions. [2021-08-27 04:27:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:27:56,198 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 04:27:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:56,200 INFO L225 Difference]: With dead ends: 254 [2021-08-27 04:27:56,200 INFO L226 Difference]: Without dead ends: 254 [2021-08-27 04:27:56,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 428.6ms TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:27:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-08-27 04:27:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2021-08-27 04:27:56,208 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 04:27:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 279 transitions. [2021-08-27 04:27:56,210 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 279 transitions. Word has length 17 [2021-08-27 04:27:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:56,210 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 279 transitions. [2021-08-27 04:27:56,211 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 04:27:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 279 transitions. [2021-08-27 04:27:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 04:27:56,211 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:56,211 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 04:27:56,224 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 04:27:56,417 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 04:27:56,417 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 04:27:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:56,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1221999107, now seen corresponding path program 1 times [2021-08-27 04:27:56,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:27:56,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954612931] [2021-08-27 04:27:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:56,418 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:27:56,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:27:56,419 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 04:27:56,422 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 04:27:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:56,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 04:27:56,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:56,843 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 04:27:56,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:56,919 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 04:27:56,919 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:56,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954612931] [2021-08-27 04:27:56,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954612931] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:27:56,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:27:56,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 04:27:56,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329075774] [2021-08-27 04:27:56,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:27:56,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:27:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:27:56,921 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 04:27:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:57,334 INFO L93 Difference]: Finished difference Result 249 states and 276 transitions. [2021-08-27 04:27:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:27:57,335 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 04:27:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:57,336 INFO L225 Difference]: With dead ends: 249 [2021-08-27 04:27:57,336 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 04:27:57,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:27:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 04:27:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-08-27 04:27:57,344 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 04:27:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 276 transitions. [2021-08-27 04:27:57,352 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 276 transitions. Word has length 19 [2021-08-27 04:27:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:57,353 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 276 transitions. [2021-08-27 04:27:57,353 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 04:27:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 276 transitions. [2021-08-27 04:27:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 04:27:57,353 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:57,353 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 04:27:57,364 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 04:27:57,563 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 04:27:57,564 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 04:27:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:57,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1221999108, now seen corresponding path program 1 times [2021-08-27 04:27:57,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:27:57,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327487388] [2021-08-27 04:27:57,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:57,565 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:27:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:27:57,565 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 04:27:57,566 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 04:27:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:57,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 04:27:57,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:58,189 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 04:27:58,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:58,477 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 04:27:58,764 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 04:27:58,764 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:58,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327487388] [2021-08-27 04:27:58,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327487388] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:27:58,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:27:58,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-08-27 04:27:58,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361533188] [2021-08-27 04:27:58,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 04:27:58,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 04:27:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:27:58,766 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 04:28:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:00,546 INFO L93 Difference]: Finished difference Result 250 states and 273 transitions. [2021-08-27 04:28:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:28:00,548 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 04:28:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:00,549 INFO L225 Difference]: With dead ends: 250 [2021-08-27 04:28:00,549 INFO L226 Difference]: Without dead ends: 250 [2021-08-27 04:28:00,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 783.0ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-08-27 04:28:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-08-27 04:28:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2021-08-27 04:28:00,555 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 04:28:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 273 transitions. [2021-08-27 04:28:00,557 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 273 transitions. Word has length 19 [2021-08-27 04:28:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:00,557 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 273 transitions. [2021-08-27 04:28:00,557 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 04:28:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 273 transitions. [2021-08-27 04:28:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 04:28:00,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:00,558 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 04:28:00,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-08-27 04:28:00,768 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 04:28:00,769 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 04:28:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 695927283, now seen corresponding path program 1 times [2021-08-27 04:28:00,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:28:00,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021477838] [2021-08-27 04:28:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:00,770 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:28:00,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:28:00,770 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 04:28:00,771 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 04:28:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:01,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 04:28:01,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:01,339 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 04:28:01,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:28:01,471 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 04:28:01,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:28:01,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021477838] [2021-08-27 04:28:01,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021477838] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:28:01,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:28:01,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 04:28:01,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784224569] [2021-08-27 04:28:01,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:28:01,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:28:01,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:28:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:28:01,473 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 04:28:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:01,715 INFO L93 Difference]: Finished difference Result 247 states and 271 transitions. [2021-08-27 04:28:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:28:01,716 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 04:28:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:01,718 INFO L225 Difference]: With dead ends: 247 [2021-08-27 04:28:01,718 INFO L226 Difference]: Without dead ends: 247 [2021-08-27 04:28:01,718 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:28:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-27 04:28:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-08-27 04:28:01,723 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 04:28:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2021-08-27 04:28:01,725 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 38 [2021-08-27 04:28:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:01,725 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2021-08-27 04:28:01,726 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 04:28:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2021-08-27 04:28:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 04:28:01,726 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:01,727 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 04:28:01,739 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 04:28:01,927 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 04:28:01,927 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 04:28:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash 695915251, now seen corresponding path program 1 times [2021-08-27 04:28:01,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:28:01,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132648032] [2021-08-27 04:28:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:01,928 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:28:01,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:28:01,930 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 04:28:01,957 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 04:28:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:02,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 04:28:02,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:02,608 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 04:28:02,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:28:02,954 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 04:28:02,955 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 04:28:02,981 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 04:28:02,981 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:28:02,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132648032] [2021-08-27 04:28:02,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132648032] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:28:02,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:28:02,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 7 [2021-08-27 04:28:02,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685938017] [2021-08-27 04:28:02,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:28:02,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:28:02,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:28:02,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:28:02,983 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 04:28:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:04,094 INFO L93 Difference]: Finished difference Result 242 states and 266 transitions. [2021-08-27 04:28:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:28:04,094 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 04:28:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:04,096 INFO L225 Difference]: With dead ends: 242 [2021-08-27 04:28:04,096 INFO L226 Difference]: Without dead ends: 242 [2021-08-27 04:28:04,096 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 183.4ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:28:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-27 04:28:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-27 04:28:04,100 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 04:28:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 266 transitions. [2021-08-27 04:28:04,102 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 266 transitions. Word has length 38 [2021-08-27 04:28:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:04,102 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 266 transitions. [2021-08-27 04:28:04,102 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 04:28:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2021-08-27 04:28:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 04:28:04,103 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:04,103 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 04:28:04,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 04:28:04,313 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 04:28:04,313 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 04:28:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 695915252, now seen corresponding path program 1 times [2021-08-27 04:28:04,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:28:04,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35014734] [2021-08-27 04:28:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:04,314 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:28:04,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:28:04,327 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 04:28:04,328 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 04:28:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:04,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 04:28:04,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:05,217 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 04:28:05,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:28:05,597 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 04:28:06,251 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 04:28:06,251 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 04:28:06,450 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 04:28:06,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:28:06,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35014734] [2021-08-27 04:28:06,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35014734] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:28:06,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:28:06,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2021-08-27 04:28:06,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529945886] [2021-08-27 04:28:06,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 04:28:06,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:28:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 04:28:06,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:28:06,452 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 04:28:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:09,178 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2021-08-27 04:28:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:28:09,179 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 04:28:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:09,181 INFO L225 Difference]: With dead ends: 240 [2021-08-27 04:28:09,181 INFO L226 Difference]: Without dead ends: 240 [2021-08-27 04:28:09,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 839.0ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-08-27 04:28:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-08-27 04:28:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-08-27 04:28:09,186 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 04:28:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 264 transitions. [2021-08-27 04:28:09,188 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 264 transitions. Word has length 38 [2021-08-27 04:28:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:09,188 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 264 transitions. [2021-08-27 04:28:09,188 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 04:28:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 264 transitions. [2021-08-27 04:28:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 04:28:09,189 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:09,190 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 04:28:09,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-08-27 04:28:09,400 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 04:28:09,401 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 04:28:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1621786009, now seen corresponding path program 1 times [2021-08-27 04:28:09,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:28:09,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522819622] [2021-08-27 04:28:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:09,402 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:28:09,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:28:09,403 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 04:28:09,418 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 04:28:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:10,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-27 04:28:10,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:10,098 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 04:28:10,099 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 04:28:10,317 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 04:28:10,384 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 04:28:10,722 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 04:28:11,021 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:28:11,021 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 04:28:11,150 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-08-27 04:28:11,151 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 2 case distinctions, treesize of input 64 treesize of output 36 [2021-08-27 04:28:15,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 04:28:15,318 INFO L354 Elim1Store]: treesize reduction 18, result has 30.8 percent of original size [2021-08-27 04:28:15,318 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 04:28:17,619 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-08-27 04:28:17,619 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 04:28:18,045 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-08-27 04:28:18,046 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 6 case distinctions, treesize of input 110 treesize of output 55 [2021-08-27 04:28:18,570 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 04:28:18,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 70 [2021-08-27 04:28:19,082 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 04:28:19,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:28:29,563 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 04:28:30,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:28:30,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522819622] [2021-08-27 04:28:30,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-27 04:28:30,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2144881217] [2021-08-27 04:28:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:30,158 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 04:28:30,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 04:28:30,192 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 04:28:30,193 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 04:28:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:32,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-27 04:28:32,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:32,295 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 04:28:32,408 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 04:28:33,336 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 04:28:33,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:28:33,870 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 04:28:34,081 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-08-27 04:28:34,082 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 2 case distinctions, treesize of input 63 treesize of output 35 [2021-08-27 04:28:34,732 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-08-27 04:28:34,733 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 04:28:35,290 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-08-27 04:28:35,290 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 6 case distinctions, treesize of input 112 treesize of output 57 [2021-08-27 04:28:36,203 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 04:28:36,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 54 [2021-08-27 04:28:37,037 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 04:28:37,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:28:44,859 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 04:28:44,859 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 14942 treesize of output 14540 [2021-08-27 04:28:45,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-27 04:28:45,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090061320] [2021-08-27 04:28:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:45,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:28:45,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:28:45,264 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 04:28:45,266 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 04:28:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:45,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-27 04:28:45,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:46,048 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-27 04:28:46,048 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 04:28:46,231 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 04:28:46,266 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 04:28:46,497 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 04:28:46,649 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:28:46,649 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 04:28:46,737 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-08-27 04:28:46,738 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 2 case distinctions, treesize of input 64 treesize of output 36 [2021-08-27 04:28:46,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 04:28:46,858 INFO L354 Elim1Store]: treesize reduction 18, result has 30.8 percent of original size [2021-08-27 04:28:46,859 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 04:28:47,073 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-08-27 04:28:47,073 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 04:28:47,366 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-08-27 04:28:47,366 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 6 case distinctions, treesize of input 110 treesize of output 55 [2021-08-27 04:28:47,584 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 04:28:47,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 70 [2021-08-27 04:28:47,819 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 04:28:47,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:29:00,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_52 (_ 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 (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 (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_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 04:29:00,998 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-27 04:29:00,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:29:00,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 04:29:00,999 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 04:29:00,999 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 04:29:01,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr2REQUIRES_VIOLATION [2021-08-27 04:29:01,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr3REQUIRES_VIOLATION [2021-08-27 04:29:01,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr2REQUIRES_VIOLATION [2021-08-27 04:29:01,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr3REQUIRES_VIOLATION [2021-08-27 04:29:01,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr4REQUIRES_VIOLATION [2021-08-27 04:29:01,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr5REQUIRES_VIOLATION [2021-08-27 04:29:01,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr2REQUIRES_VIOLATION [2021-08-27 04:29:01,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr3REQUIRES_VIOLATION [2021-08-27 04:29:01,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr2REQUIRES_VIOLATION [2021-08-27 04:29:01,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr3REQUIRES_VIOLATION [2021-08-27 04:29:01,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr4REQUIRES_VIOLATION [2021-08-27 04:29:01,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr5REQUIRES_VIOLATION [2021-08-27 04:29:01,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr6REQUIRES_VIOLATION [2021-08-27 04:29:01,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr7REQUIRES_VIOLATION [2021-08-27 04:29:01,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr8REQUIRES_VIOLATION [2021-08-27 04:29:01,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr9REQUIRES_VIOLATION [2021-08-27 04:29:01,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr10REQUIRES_VIOLATION [2021-08-27 04:29:01,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr11REQUIRES_VIOLATION [2021-08-27 04:29:01,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr12REQUIRES_VIOLATION [2021-08-27 04:29:01,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr13REQUIRES_VIOLATION [2021-08-27 04:29:01,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr14REQUIRES_VIOLATION [2021-08-27 04:29:01,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr15REQUIRES_VIOLATION [2021-08-27 04:29:01,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr16REQUIRES_VIOLATION [2021-08-27 04:29:01,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr17REQUIRES_VIOLATION [2021-08-27 04:29:01,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr18REQUIRES_VIOLATION [2021-08-27 04:29:01,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr19REQUIRES_VIOLATION [2021-08-27 04:29:01,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr20REQUIRES_VIOLATION [2021-08-27 04:29:01,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr21REQUIRES_VIOLATION [2021-08-27 04:29:01,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr22REQUIRES_VIOLATION [2021-08-27 04:29:01,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr23REQUIRES_VIOLATION [2021-08-27 04:29:01,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr24REQUIRES_VIOLATION [2021-08-27 04:29:01,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr25REQUIRES_VIOLATION [2021-08-27 04:29:01,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr26REQUIRES_VIOLATION [2021-08-27 04:29:01,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr27REQUIRES_VIOLATION [2021-08-27 04:29:01,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr28REQUIRES_VIOLATION [2021-08-27 04:29:01,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr29REQUIRES_VIOLATION [2021-08-27 04:29:01,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location val_from_nodeErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location val_from_nodeErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:29:01,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr2REQUIRES_VIOLATION [2021-08-27 04:29:01,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr3REQUIRES_VIOLATION [2021-08-27 04:29:01,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr4REQUIRES_VIOLATION [2021-08-27 04:29:01,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr5REQUIRES_VIOLATION [2021-08-27 04:29:01,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:01,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:01,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:01,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr2REQUIRES_VIOLATION [2021-08-27 04:29:01,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr3REQUIRES_VIOLATION [2021-08-27 04:29:01,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr4REQUIRES_VIOLATION [2021-08-27 04:29:01,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr5REQUIRES_VIOLATION [2021-08-27 04:29:01,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr6REQUIRES_VIOLATION [2021-08-27 04:29:01,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr7REQUIRES_VIOLATION [2021-08-27 04:29:01,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:29:01,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr0REQUIRES_VIOLATION [2021-08-27 04:29:01,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr1REQUIRES_VIOLATION [2021-08-27 04:29:01,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr2REQUIRES_VIOLATION [2021-08-27 04:29:01,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr3REQUIRES_VIOLATION [2021-08-27 04:29:01,035 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 04:29:01,237 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 04:29:01,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-08-27 04:29:01,634 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 04:29:01,640 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:29:01,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:29:01 BoogieIcfgContainer [2021-08-27 04:29:01,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:29:01,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:29:01,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:29:01,653 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:29:01,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:18" (3/4) ... [2021-08-27 04:29:01,658 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 04:29:01,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:29:01,659 INFO L168 Benchmark]: Toolchain (without parser) took 165430.04 ms. Allocated memory was 54.5 MB in the beginning and 180.4 MB in the end (delta: 125.8 MB). Free memory was 29.7 MB in the beginning and 52.5 MB in the end (delta: -22.8 MB). Peak memory consumption was 101.9 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:01,659 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:29:01,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.45 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.6 MB in the beginning and 36.8 MB in the end (delta: -7.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:01,660 INFO L168 Benchmark]: Boogie Preprocessor took 110.13 ms. Allocated memory is still 67.1 MB. Free memory was 36.8 MB in the beginning and 31.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:01,660 INFO L168 Benchmark]: RCFGBuilder took 1458.88 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 31.6 MB in the beginning and 45.4 MB in the end (delta: -13.8 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:01,661 INFO L168 Benchmark]: TraceAbstraction took 163170.56 ms. Allocated memory was 81.8 MB in the beginning and 180.4 MB in the end (delta: 98.6 MB). Free memory was 44.8 MB in the beginning and 53.6 MB in the end (delta: -8.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:01,661 INFO L168 Benchmark]: Witness Printer took 4.76 ms. Allocated memory is still 180.4 MB. Free memory was 53.6 MB in the beginning and 52.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:29:01,664 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.21 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 678.45 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.6 MB in the beginning and 36.8 MB in the end (delta: -7.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 110.13 ms. Allocated memory is still 67.1 MB. Free memory was 36.8 MB in the beginning and 31.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1458.88 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 31.6 MB in the beginning and 45.4 MB in the end (delta: -13.8 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 163170.56 ms. Allocated memory was 81.8 MB in the beginning and 180.4 MB in the end (delta: 98.6 MB). Free memory was 44.8 MB in the beginning and 53.6 MB in the end (delta: -8.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.76 ms. Allocated memory is still 180.4 MB. Free memory was 53.6 MB in the beginning and 52.5 MB in the end (delta: 1.0 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)->next = (&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: 163113.8ms, OverallIterations: 15, TraceHistogramMax: 2, EmptinessCheckTime: 18.6ms, AutomataDifference: 29835.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2941 SDtfs, 3646 SDslu, 10420 SDs, 0 SdLazy, 5292 SolverSat, 561 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18235.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 405 SyntacticMatches, 34 SemanticMatches, 151 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 72530.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=8, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 188.3ms AutomataMinimizationTime, 14 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 170.7ms SsaConstructionTime, 618.3ms SatisfiabilityAnalysisTime, 73381.1ms InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 520 ConstructedInterpolants, 51 QuantifiedInterpolants, 5449 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 04:29:01,739 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...