./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e3c5ff68acf947cb006ebbabdce00a2ebd40498 .................................................................................................................................... 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/ldv-memsafety/memleaks_test6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e3c5ff68acf947cb006ebbabdce00a2ebd40498 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:23:59,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:23:59,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:23:59,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:23:59,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:23:59,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:23:59,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:23:59,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:23:59,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:23:59,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:23:59,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:23:59,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:23:59,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:23:59,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:23:59,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:23:59,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:23:59,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:23:59,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:23:59,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:23:59,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:23:59,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:23:59,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:23:59,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:23:59,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:23:59,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:23:59,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:23:59,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:23:59,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:23:59,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:23:59,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:23:59,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:23:59,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:23:59,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:23:59,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:23:59,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:23:59,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:23:59,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:23:59,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:23:59,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:23:59,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:23:59,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:23:59,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:23:59,772 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:23:59,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:23:59,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:23:59,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:23:59,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:23:59,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:23:59,775 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:23:59,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:23:59,775 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:23:59,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:23:59,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:23:59,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:23:59,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:23:59,777 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:23:59,777 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:23:59,777 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:23:59,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:23:59,778 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:23:59,778 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:23:59,778 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:23:59,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:23:59,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:23:59,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:23:59,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:23:59,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:23:59,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:23:59,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:23:59,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:23:59,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:23:59,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e3c5ff68acf947cb006ebbabdce00a2ebd40498 [2021-08-27 06:24:00,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:24:00,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:24:00,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:24:00,115 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:24:00,115 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:24:00,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6.i [2021-08-27 06:24:00,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6567737b0/9a5f721d517b46c896d853dae6d1a05c/FLAG11064de88 [2021-08-27 06:24:00,725 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:24:00,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6.i [2021-08-27 06:24:00,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6567737b0/9a5f721d517b46c896d853dae6d1a05c/FLAG11064de88 [2021-08-27 06:24:01,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6567737b0/9a5f721d517b46c896d853dae6d1a05c [2021-08-27 06:24:01,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:24:01,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:24:01,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:24:01,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:24:01,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:24:01,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:24:01" (1/1) ... [2021-08-27 06:24:01,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3adfc623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:01, skipping insertion in model container [2021-08-27 06:24:01,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:24:01" (1/1) ... [2021-08-27 06:24:01,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:24:01,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:24:01,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:24:01,718 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-08-27 06:24:01,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61feb849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:01, skipping insertion in model container [2021-08-27 06:24:01,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:24:01,720 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2021-08-27 06:24:01,722 INFO L168 Benchmark]: Toolchain (without parser) took 513.86 ms. Allocated memory is still 69.2 MB. Free memory was 49.2 MB in the beginning and 48.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:24:01,723 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 69.2 MB. Free memory was 50.8 MB in the beginning and 50.7 MB in the end (delta: 54.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:24:01,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.94 ms. Allocated memory is still 69.2 MB. Free memory was 49.0 MB in the beginning and 48.2 MB in the end (delta: 858.0 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:24:01,726 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.19 ms. Allocated memory is still 69.2 MB. Free memory was 50.8 MB in the beginning and 50.7 MB in the end (delta: 54.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 509.94 ms. Allocated memory is still 69.2 MB. Free memory was 49.0 MB in the beginning and 48.2 MB in the end (delta: 858.0 kB). 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: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:24:03,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:24:03,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:24:03,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:24:03,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:24:03,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:24:03,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:24:03,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:24:03,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:24:03,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:24:03,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:24:03,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:24:03,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:24:03,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:24:03,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:24:03,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:24:03,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:24:03,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:24:03,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:24:03,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:24:03,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:24:03,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:24:03,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:24:03,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:24:03,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:24:03,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:24:03,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:24:03,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:24:03,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:24:03,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:24:03,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:24:03,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:24:03,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:24:03,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:24:03,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:24:03,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:24:03,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:24:03,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:24:03,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:24:03,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:24:03,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:24:03,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:24:03,491 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:24:03,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:24:03,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:24:03,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:24:03,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:24:03,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:24:03,495 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:24:03,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:24:03,496 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:24:03,496 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:24:03,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:24:03,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:24:03,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:24:03,497 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:24:03,498 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:24:03,498 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:24:03,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:24:03,498 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:24:03,498 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:24:03,498 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:24:03,499 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:24:03,499 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:24:03,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:24:03,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:24:03,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:24:03,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:24:03,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:24:03,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:24:03,500 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:24:03,501 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:24:03,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:24:03,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:24:03,501 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e3c5ff68acf947cb006ebbabdce00a2ebd40498 [2021-08-27 06:24:03,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:24:03,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:24:03,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:24:03,801 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:24:03,801 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:24:03,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6.i [2021-08-27 06:24:03,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dce35ee2/a97a7e1bc5074975869066aebc318899/FLAG41a48a396 [2021-08-27 06:24:04,357 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:24:04,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6.i [2021-08-27 06:24:04,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dce35ee2/a97a7e1bc5074975869066aebc318899/FLAG41a48a396 [2021-08-27 06:24:04,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dce35ee2/a97a7e1bc5074975869066aebc318899 [2021-08-27 06:24:04,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:24:04,861 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:24:04,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:24:04,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:24:04,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:24:04,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:24:04" (1/1) ... [2021-08-27 06:24:04,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1e9733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:04, skipping insertion in model container [2021-08-27 06:24:04,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:24:04" (1/1) ... [2021-08-27 06:24:04,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:24:04,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:24:05,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:24:05,375 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-08-27 06:24:05,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:24:05,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:24:05,464 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:24:05,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:24:05,563 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:24:05,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05 WrapperNode [2021-08-27 06:24:05,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:24:05,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:24:05,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:24:05,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:24:05,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:24:05,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:24:05,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:24:05,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:24:05,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (1/1) ... [2021-08-27 06:24:05,677 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:24:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:24:05,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:24:05,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:24:05,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:24:05,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:24:05,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-08-27 06:24:05,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:24:05,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 06:24:05,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 06:24:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 06:24:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 06:24:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 06:24:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2021-08-27 06:24:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2021-08-27 06:24:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-08-27 06:24:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-08-27 06:24:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-08-27 06:24:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2021-08-27 06:24:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2021-08-27 06:24:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2021-08-27 06:24:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2021-08-27 06:24:05,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2021-08-27 06:24:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2021-08-27 06:24:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2021-08-27 06:24:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2021-08-27 06:24:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2021-08-27 06:24:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2021-08-27 06:24:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2021-08-27 06:24:05,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2021-08-27 06:24:05,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2021-08-27 06:24:05,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2021-08-27 06:24:05,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2021-08-27 06:24:05,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2021-08-27 06:24:05,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2021-08-27 06:24:05,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2021-08-27 06:24:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2021-08-27 06:24:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2021-08-27 06:24:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2021-08-27 06:24:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-08-27 06:24:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2021-08-27 06:24:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2021-08-27 06:24:05,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2021-08-27 06:24:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2021-08-27 06:24:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-08-27 06:24:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2021-08-27 06:24:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2021-08-27 06:24:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2021-08-27 06:24:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2021-08-27 06:24:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2021-08-27 06:24:05,748 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2021-08-27 06:24:05,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:24:05,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-08-27 06:24:05,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-08-27 06:24:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-08-27 06:24:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:24:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:24:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:24:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:24:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:24:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:24:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:24:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:24:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:24:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:24:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:24:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:24:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:24:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:24:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:24:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:24:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 06:24:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 06:24:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 06:24:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 06:24:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 06:24:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:24:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:24:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:24:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:24:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:24:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:24:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:24:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:24:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:24:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:24:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:24:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:24:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:24:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:24:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:24:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:24:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:24:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:24:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:24:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:24:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:24:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:24:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:24:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:24:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:24:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:24:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:24:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:24:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:24:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:24:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:24:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:24:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:24:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:24:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:24:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:24:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:24:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:24:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:24:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:24:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:24:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:24:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:24:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:24:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:24:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:24:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:24:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:24:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:24:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:24:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:24:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:24:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:24:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:24:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:24:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:24:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:24:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-08-27 06:24:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-08-27 06:24:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2021-08-27 06:24:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2021-08-27 06:24:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2021-08-27 06:24:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2021-08-27 06:24:05,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2021-08-27 06:24:05,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2021-08-27 06:24:05,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2021-08-27 06:24:05,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2021-08-27 06:24:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure g [2021-08-27 06:24:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 06:24:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:24:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:24:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-08-27 06:24:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-08-27 06:24:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-08-27 06:24:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-08-27 06:24:06,402 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 06:24:06,645 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 06:24:06,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:24:06,905 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 06:24:06,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:24:06 BoogieIcfgContainer [2021-08-27 06:24:06,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:24:06,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:24:06,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:24:06,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:24:06,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:24:04" (1/3) ... [2021-08-27 06:24:06,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd14d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:24:06, skipping insertion in model container [2021-08-27 06:24:06,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:24:05" (2/3) ... [2021-08-27 06:24:06,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd14d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:24:06, skipping insertion in model container [2021-08-27 06:24:06,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:24:06" (3/3) ... [2021-08-27 06:24:06,914 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test6.i [2021-08-27 06:24:06,918 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:24:06,918 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2021-08-27 06:24:06,952 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:24:06,961 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:24:06,961 INFO L340 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2021-08-27 06:24:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 105 states have internal predecessors, (114), 15 states have call successors, (15), 14 states have call predecessors, (15), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-08-27 06:24:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:24:06,980 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:06,980 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] [2021-08-27 06:24:06,981 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting entry_pointErr0REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1048832464, now seen corresponding path program 1 times [2021-08-27 06:24:06,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:06,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416595501] [2021-08-27 06:24:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:06,994 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:06,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:06,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:07,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:24:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:07,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:24:07,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:07,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:07,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:07,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416595501] [2021-08-27 06:24:07,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416595501] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:07,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:07,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:24:07,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927978040] [2021-08-27 06:24:07,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:24:07,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:24:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:24:07,494 INFO L87 Difference]: Start difference. First operand has 134 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 105 states have internal predecessors, (114), 15 states have call successors, (15), 14 states have call predecessors, (15), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 06:24:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:07,563 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-08-27 06:24:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:24:07,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2021-08-27 06:24:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:07,575 INFO L225 Difference]: With dead ends: 85 [2021-08-27 06:24:07,575 INFO L226 Difference]: Without dead ends: 82 [2021-08-27 06:24:07,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:24:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-08-27 06:24:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2021-08-27 06:24:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 49 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-27 06:24:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-08-27 06:24:07,620 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 20 [2021-08-27 06:24:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:07,620 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-08-27 06:24:07,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 06:24:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-08-27 06:24:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:24:07,622 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:07,622 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] [2021-08-27 06:24:07,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:07,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:07,831 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting entry_pointErr0REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash 852318959, now seen corresponding path program 1 times [2021-08-27 06:24:07,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:07,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542309754] [2021-08-27 06:24:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:07,837 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:07,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:07,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:07,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:24:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:08,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:24:08,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:08,114 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 06:24:08,115 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 2 case distinctions, treesize of input 12 treesize of output 26 [2021-08-27 06:24:08,237 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 7 treesize of output 5 [2021-08-27 06:24:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:08,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:08,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 10 treesize of output 8 [2021-08-27 06:24:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:08,576 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:08,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542309754] [2021-08-27 06:24:08,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542309754] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:08,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:08,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-27 06:24:08,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241225448] [2021-08-27 06:24:08,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:24:08,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:24:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:24:08,579 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 06:24:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:08,751 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2021-08-27 06:24:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:24:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 20 [2021-08-27 06:24:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:08,754 INFO L225 Difference]: With dead ends: 108 [2021-08-27 06:24:08,754 INFO L226 Difference]: Without dead ends: 105 [2021-08-27 06:24:08,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.6ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:24:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-27 06:24:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2021-08-27 06:24:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.48) internal successors, (74), 63 states have internal predecessors, (74), 10 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2021-08-27 06:24:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2021-08-27 06:24:08,764 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 20 [2021-08-27 06:24:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:08,764 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2021-08-27 06:24:08,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 06:24:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2021-08-27 06:24:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:24:08,766 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:08,766 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] [2021-08-27 06:24:08,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:08,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:08,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting entry_pointErr1REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash 852318960, now seen corresponding path program 1 times [2021-08-27 06:24:08,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:08,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401209884] [2021-08-27 06:24:08,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:08,977 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:08,979 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:08,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:24:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:09,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:24:09,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:09,233 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-27 06:24:09,234 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-27 06:24:09,314 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 5 treesize of output 3 [2021-08-27 06:24:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:09,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:09,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-08-27 06:24:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:09,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:09,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401209884] [2021-08-27 06:24:09,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401209884] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:09,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:09,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-08-27 06:24:09,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849249300] [2021-08-27 06:24:09,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:24:09,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:09,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:24:09,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:24:09,963 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-27 06:24:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:10,210 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2021-08-27 06:24:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:24:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 20 [2021-08-27 06:24:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:10,212 INFO L225 Difference]: With dead ends: 120 [2021-08-27 06:24:10,212 INFO L226 Difference]: Without dead ends: 119 [2021-08-27 06:24:10,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.0ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:24:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-27 06:24:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2021-08-27 06:24:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 66 states have (on average 1.5) internal successors, (99), 80 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 14 states have return successors, (14), 14 states have call predecessors, (14), 10 states have call successors, (14) [2021-08-27 06:24:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2021-08-27 06:24:10,222 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 20 [2021-08-27 06:24:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:10,222 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2021-08-27 06:24:10,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-27 06:24:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2021-08-27 06:24:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:24:10,223 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:10,223 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] [2021-08-27 06:24:10,232 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 06:24:10,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:10,429 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:10,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2010052609, now seen corresponding path program 1 times [2021-08-27 06:24:10,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:10,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399987498] [2021-08-27 06:24:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:10,430 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:10,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:10,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:24:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:10,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:24:10,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:10,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:10,848 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:10,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399987498] [2021-08-27 06:24:10,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399987498] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:10,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:10,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:24:10,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598894956] [2021-08-27 06:24:10,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:24:10,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:24:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:24:10,851 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:24:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:10,874 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2021-08-27 06:24:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:24:10,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-08-27 06:24:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:10,876 INFO L225 Difference]: With dead ends: 103 [2021-08-27 06:24:10,876 INFO L226 Difference]: Without dead ends: 103 [2021-08-27 06:24:10,877 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:24:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-27 06:24:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-08-27 06:24:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 79 states have internal predecessors, (97), 11 states have call successors, (11), 11 states have call predecessors, (11), 14 states have return successors, (14), 14 states have call predecessors, (14), 10 states have call successors, (14) [2021-08-27 06:24:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2021-08-27 06:24:10,883 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 22 [2021-08-27 06:24:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:10,883 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2021-08-27 06:24:10,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:24:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2021-08-27 06:24:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:24:10,884 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:10,884 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] [2021-08-27 06:24:10,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:11,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:11,093 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting disconnect_6Err0REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1260199192, now seen corresponding path program 1 times [2021-08-27 06:24:11,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:11,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303350334] [2021-08-27 06:24:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:11,094 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:11,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:11,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:11,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:24:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:11,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:24:11,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:11,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:11,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:11,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303350334] [2021-08-27 06:24:11,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303350334] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:11,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:11,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-27 06:24:11,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53327161] [2021-08-27 06:24:11,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:24:11,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:24:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:24:11,552 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 06:24:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:11,626 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2021-08-27 06:24:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:24:11,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 22 [2021-08-27 06:24:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:11,629 INFO L225 Difference]: With dead ends: 113 [2021-08-27 06:24:11,629 INFO L226 Difference]: Without dead ends: 109 [2021-08-27 06:24:11,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:24:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-27 06:24:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2021-08-27 06:24:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 79 states have internal predecessors, (94), 11 states have call successors, (11), 11 states have call predecessors, (11), 14 states have return successors, (14), 14 states have call predecessors, (14), 10 states have call successors, (14) [2021-08-27 06:24:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2021-08-27 06:24:11,654 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 22 [2021-08-27 06:24:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:11,655 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2021-08-27 06:24:11,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 06:24:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2021-08-27 06:24:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:24:11,657 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:11,657 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] [2021-08-27 06:24:11,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:11,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:11,866 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2112879025, now seen corresponding path program 1 times [2021-08-27 06:24:11,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:11,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796865697] [2021-08-27 06:24:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:11,867 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:11,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:11,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:11,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:24:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:12,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:24:12,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:12,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:12,500 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:12,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796865697] [2021-08-27 06:24:12,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796865697] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:12,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:12,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2021-08-27 06:24:12,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219387299] [2021-08-27 06:24:12,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:24:12,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:24:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:24:12,502 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 06:24:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:12,700 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-08-27 06:24:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:24:12,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2021-08-27 06:24:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:12,701 INFO L225 Difference]: With dead ends: 114 [2021-08-27 06:24:12,701 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 06:24:12,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 95.3ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:24:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 06:24:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2021-08-27 06:24:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.393939393939394) internal successors, (92), 78 states have internal predecessors, (92), 11 states have call successors, (11), 11 states have call predecessors, (11), 14 states have return successors, (14), 14 states have call predecessors, (14), 10 states have call successors, (14) [2021-08-27 06:24:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2021-08-27 06:24:12,706 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 23 [2021-08-27 06:24:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:12,707 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2021-08-27 06:24:12,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 06:24:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2021-08-27 06:24:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:24:12,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:12,712 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] [2021-08-27 06:24:12,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:12,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:12,921 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1074740801, now seen corresponding path program 1 times [2021-08-27 06:24:12,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:12,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112450866] [2021-08-27 06:24:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:12,922 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:12,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:12,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:12,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:24:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:13,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:24:13,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:13,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:24:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:13,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:13,408 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:13,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112450866] [2021-08-27 06:24:13,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112450866] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:13,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:13,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2021-08-27 06:24:13,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881720892] [2021-08-27 06:24:13,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:24:13,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:24:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:24:13,410 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 06:24:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:13,552 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-08-27 06:24:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:24:13,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2021-08-27 06:24:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:13,554 INFO L225 Difference]: With dead ends: 105 [2021-08-27 06:24:13,554 INFO L226 Difference]: Without dead ends: 105 [2021-08-27 06:24:13,554 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:24:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-27 06:24:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2021-08-27 06:24:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.378787878787879) internal successors, (91), 78 states have internal predecessors, (91), 11 states have call successors, (11), 11 states have call predecessors, (11), 14 states have return successors, (14), 14 states have call predecessors, (14), 10 states have call successors, (14) [2021-08-27 06:24:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2021-08-27 06:24:13,559 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 24 [2021-08-27 06:24:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:13,559 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2021-08-27 06:24:13,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 06:24:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2021-08-27 06:24:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:24:13,560 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:13,560 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] [2021-08-27 06:24:13,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:13,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:13,769 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash 569182176, now seen corresponding path program 1 times [2021-08-27 06:24:13,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:13,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615539744] [2021-08-27 06:24:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:13,770 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:13,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:13,771 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:13,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:24:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:14,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:24:14,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:14,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:14,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:14,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615539744] [2021-08-27 06:24:14,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615539744] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:14,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:14,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:24:14,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724687348] [2021-08-27 06:24:14,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:24:14,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:14,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:24:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:24:14,270 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 06:24:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:14,297 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-08-27 06:24:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:24:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2021-08-27 06:24:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:14,299 INFO L225 Difference]: With dead ends: 67 [2021-08-27 06:24:14,299 INFO L226 Difference]: Without dead ends: 63 [2021-08-27 06:24:14,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:24:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-27 06:24:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-08-27 06:24:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 47 states have internal predecessors, (50), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-27 06:24:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-08-27 06:24:14,302 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 24 [2021-08-27 06:24:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:14,302 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-08-27 06:24:14,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 06:24:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-08-27 06:24:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:24:14,303 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:14,303 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] [2021-08-27 06:24:14,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:14,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:14,512 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting probe1_6Err0REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1905668747, now seen corresponding path program 1 times [2021-08-27 06:24:14,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:14,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631151191] [2021-08-27 06:24:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:14,514 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:14,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:14,515 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:14,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:24:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:14,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 06:24:14,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:14,826 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 06:24:14,826 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 2 case distinctions, treesize of input 12 treesize of output 26 [2021-08-27 06:24:14,989 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:24:14,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-08-27 06:24:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:15,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:15,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:15,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631151191] [2021-08-27 06:24:15,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631151191] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:15,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:15,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 8 [2021-08-27 06:24:15,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253878832] [2021-08-27 06:24:15,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:24:15,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:15,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:24:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:24:15,362 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 06:24:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:15,655 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2021-08-27 06:24:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:24:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 28 [2021-08-27 06:24:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:15,657 INFO L225 Difference]: With dead ends: 67 [2021-08-27 06:24:15,657 INFO L226 Difference]: Without dead ends: 67 [2021-08-27 06:24:15,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 226.5ms TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:24:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-27 06:24:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2021-08-27 06:24:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 46 states have internal predecessors, (49), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-27 06:24:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2021-08-27 06:24:15,660 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 28 [2021-08-27 06:24:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:15,660 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2021-08-27 06:24:15,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 06:24:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2021-08-27 06:24:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:24:15,661 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:15,661 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] [2021-08-27 06:24:15,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:15,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:15,865 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting probe1_6Err1REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:15,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:15,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1905668746, now seen corresponding path program 1 times [2021-08-27 06:24:15,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:15,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56497633] [2021-08-27 06:24:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:15,866 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:15,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:15,866 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:15,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:24:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:16,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 06:24:16,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:16,173 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-27 06:24:16,174 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-27 06:24:20,400 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:24:20,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:24:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:20,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:22,518 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:22,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56497633] [2021-08-27 06:24:22,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56497633] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:22,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:22,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2021-08-27 06:24:22,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661456099] [2021-08-27 06:24:22,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:24:22,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:22,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:24:22,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=167, Unknown=2, NotChecked=0, Total=210 [2021-08-27 06:24:22,520 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 06:24:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:28,601 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2021-08-27 06:24:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:24:28,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 28 [2021-08-27 06:24:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:28,603 INFO L225 Difference]: With dead ends: 65 [2021-08-27 06:24:28,603 INFO L226 Difference]: Without dead ends: 65 [2021-08-27 06:24:28,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 6327.1ms TimeCoverageRelationStatistics Valid=135, Invalid=415, Unknown=2, NotChecked=0, Total=552 [2021-08-27 06:24:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-08-27 06:24:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2021-08-27 06:24:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 44 states have internal predecessors, (46), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-27 06:24:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-08-27 06:24:28,609 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 28 [2021-08-27 06:24:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:28,610 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-08-27 06:24:28,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 06:24:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-08-27 06:24:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:24:28,613 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:28,613 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] [2021-08-27 06:24:28,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:28,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:28,829 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting entry_pointErr0REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -950633798, now seen corresponding path program 1 times [2021-08-27 06:24:28,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:28,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111014935] [2021-08-27 06:24:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:28,833 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:28,834 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:28,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:24:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:29,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:24:29,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:29,215 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 06:24:29,215 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 2 case distinctions, treesize of input 12 treesize of output 26 [2021-08-27 06:24:29,302 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 7 treesize of output 5 [2021-08-27 06:24:29,417 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 17 treesize of output 14 [2021-08-27 06:24:29,614 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-27 06:24:29,615 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 25 treesize of output 28 [2021-08-27 06:24:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:29,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:30,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-08-27 06:24:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:30,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:30,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111014935] [2021-08-27 06:24:30,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111014935] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:30,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:30,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-08-27 06:24:30,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469166434] [2021-08-27 06:24:30,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:24:30,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:24:30,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:24:30,242 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 6 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-08-27 06:24:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:58,730 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2021-08-27 06:24:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:24:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 6 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 29 [2021-08-27 06:24:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:58,733 INFO L225 Difference]: With dead ends: 64 [2021-08-27 06:24:58,733 INFO L226 Difference]: Without dead ends: 53 [2021-08-27 06:24:58,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 368.5ms TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:24:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-08-27 06:24:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-08-27 06:24:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 37 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:24:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2021-08-27 06:24:58,735 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 29 [2021-08-27 06:24:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:58,735 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2021-08-27 06:24:58,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 6 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-08-27 06:24:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2021-08-27 06:24:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:24:58,736 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:58,736 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] [2021-08-27 06:24:58,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:24:58,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:24:58,937 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting disconnect_6Err0REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:24:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:24:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash 657399931, now seen corresponding path program 1 times [2021-08-27 06:24:58,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:24:58,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177998053] [2021-08-27 06:24:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:24:58,937 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:24:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:24:58,938 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:24:58,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:24:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:24:59,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:24:59,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:24:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:59,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:24:59,580 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:24:59,580 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 18 treesize of output 17 [2021-08-27 06:24:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:24:59,690 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:24:59,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177998053] [2021-08-27 06:24:59,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177998053] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:24:59,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:24:59,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 06:24:59,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112679459] [2021-08-27 06:24:59,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:24:59,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:24:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:24:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:24:59,691 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 06:24:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:24:59,909 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2021-08-27 06:24:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:24:59,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2021-08-27 06:24:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:24:59,911 INFO L225 Difference]: With dead ends: 52 [2021-08-27 06:24:59,911 INFO L226 Difference]: Without dead ends: 52 [2021-08-27 06:24:59,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 102.9ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:24:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-08-27 06:24:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-08-27 06:24:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 36 states have internal predecessors, (37), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:24:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2021-08-27 06:24:59,913 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 36 [2021-08-27 06:24:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:24:59,913 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2021-08-27 06:24:59,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 06:24:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2021-08-27 06:24:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:24:59,914 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:24:59,914 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] [2021-08-27 06:24:59,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:25:00,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:25:00,120 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting disconnect_6Err1REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:25:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:25:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 657399932, now seen corresponding path program 1 times [2021-08-27 06:25:00,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:25:00,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741128520] [2021-08-27 06:25:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:25:00,121 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:25:00,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:25:00,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:25:00,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:25:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:25:00,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:25:00,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:25:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:00,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:25:01,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-08-27 06:25:01,357 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:25:01,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2021-08-27 06:25:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:01,849 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:25:01,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741128520] [2021-08-27 06:25:01,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741128520] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:25:01,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:25:01,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-08-27 06:25:01,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362105246] [2021-08-27 06:25:01,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:25:01,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:25:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:25:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:25:01,851 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-27 06:25:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:25:02,271 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2021-08-27 06:25:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:25:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 36 [2021-08-27 06:25:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:25:02,272 INFO L225 Difference]: With dead ends: 51 [2021-08-27 06:25:02,272 INFO L226 Difference]: Without dead ends: 51 [2021-08-27 06:25:02,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 497.3ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:25:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-08-27 06:25:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-08-27 06:25:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:25:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2021-08-27 06:25:02,274 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 36 [2021-08-27 06:25:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:25:02,274 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2021-08-27 06:25:02,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-27 06:25:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2021-08-27 06:25:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:25:02,275 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:25:02,275 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] [2021-08-27 06:25:02,282 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 06:25:02,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:25:02,478 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:25:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:25:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1095438251, now seen corresponding path program 1 times [2021-08-27 06:25:02,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:25:02,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599132832] [2021-08-27 06:25:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:25:02,479 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:25:02,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:25:02,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:25:02,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 06:25:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:25:02,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 06:25:02,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:25:03,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:25:03,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 06:25:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:03,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:25:03,325 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 28 treesize of output 24 [2021-08-27 06:25:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:03,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:25:03,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599132832] [2021-08-27 06:25:03,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599132832] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:25:03,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:25:03,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2021-08-27 06:25:03,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455136370] [2021-08-27 06:25:03,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:25:03,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:25:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:25:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:25:03,529 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 06:25:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:25:03,900 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2021-08-27 06:25:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:25:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2021-08-27 06:25:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:25:03,901 INFO L225 Difference]: With dead ends: 50 [2021-08-27 06:25:03,901 INFO L226 Difference]: Without dead ends: 50 [2021-08-27 06:25:03,901 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 224.7ms TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:25:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-27 06:25:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-08-27 06:25:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:25:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2021-08-27 06:25:03,903 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 37 [2021-08-27 06:25:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:25:03,904 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2021-08-27 06:25:03,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 06:25:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2021-08-27 06:25:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:25:03,904 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:25:03,905 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:25:03,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:25:04,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:25:04,115 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:25:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:25:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 401153019, now seen corresponding path program 1 times [2021-08-27 06:25:04,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:25:04,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156718316] [2021-08-27 06:25:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:25:04,116 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:25:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:25:04,117 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:25:04,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:25:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:25:04,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:25:04,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:25:05,076 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 19 treesize of output 15 [2021-08-27 06:25:05,242 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 11 [2021-08-27 06:25:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:05,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:25:05,552 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 28 treesize of output 24 [2021-08-27 06:25:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:06,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:25:06,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156718316] [2021-08-27 06:25:06,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156718316] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:25:06,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:25:06,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 21 [2021-08-27 06:25:06,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550068463] [2021-08-27 06:25:06,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 06:25:06,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:25:06,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 06:25:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:25:06,091 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 22 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-27 06:25:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:25:07,053 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2021-08-27 06:25:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:25:07,054 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2021-08-27 06:25:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:25:07,054 INFO L225 Difference]: With dead ends: 49 [2021-08-27 06:25:07,054 INFO L226 Difference]: Without dead ends: 49 [2021-08-27 06:25:07,055 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 958.2ms TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2021-08-27 06:25:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-08-27 06:25:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-08-27 06:25:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.096774193548387) internal successors, (34), 33 states have internal predecessors, (34), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:25:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2021-08-27 06:25:07,057 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 38 [2021-08-27 06:25:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:25:07,057 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2021-08-27 06:25:07,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-27 06:25:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2021-08-27 06:25:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:25:07,058 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:25:07,058 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] [2021-08-27 06:25:07,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 06:25:07,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:25:07,258 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:25:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:25:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1096175518, now seen corresponding path program 1 times [2021-08-27 06:25:07,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:25:07,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706415220] [2021-08-27 06:25:07,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:25:07,259 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:25:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:25:07,260 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:25:07,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 06:25:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:25:07,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:25:07,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:25:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:07,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:25:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:08,038 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:25:08,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706415220] [2021-08-27 06:25:08,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706415220] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:25:08,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:25:08,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:25:08,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606124506] [2021-08-27 06:25:08,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:25:08,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:25:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:25:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:25:08,039 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 06:25:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:25:08,049 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2021-08-27 06:25:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:25:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2021-08-27 06:25:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:25:08,050 INFO L225 Difference]: With dead ends: 48 [2021-08-27 06:25:08,050 INFO L226 Difference]: Without dead ends: 48 [2021-08-27 06:25:08,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:25:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-08-27 06:25:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-08-27 06:25:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:25:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2021-08-27 06:25:08,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 37 [2021-08-27 06:25:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:25:08,052 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2021-08-27 06:25:08,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 06:25:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2021-08-27 06:25:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 06:25:08,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:25:08,053 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, 1] [2021-08-27 06:25:08,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:25:08,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:25:08,263 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:25:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:25:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -449157865, now seen corresponding path program 1 times [2021-08-27 06:25:08,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:25:08,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596225887] [2021-08-27 06:25:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:25:08,264 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:25:08,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:25:08,265 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:25:08,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 06:25:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:25:08,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:25:08,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:25:08,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:25:09,086 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 19 treesize of output 15 [2021-08-27 06:25:09,188 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 26 treesize of output 18 [2021-08-27 06:25:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:09,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:25:09,409 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 44 treesize of output 40 [2021-08-27 06:25:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:09,777 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:25:09,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596225887] [2021-08-27 06:25:09,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596225887] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:25:09,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:25:09,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 13 [2021-08-27 06:25:09,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325197297] [2021-08-27 06:25:09,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:25:09,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:25:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:25:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:25:09,779 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 06:25:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:25:10,199 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2021-08-27 06:25:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:25:10,199 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 39 [2021-08-27 06:25:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:25:10,200 INFO L225 Difference]: With dead ends: 47 [2021-08-27 06:25:10,200 INFO L226 Difference]: Without dead ends: 47 [2021-08-27 06:25:10,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 413.1ms TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:25:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-08-27 06:25:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-08-27 06:25:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:25:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2021-08-27 06:25:10,202 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 39 [2021-08-27 06:25:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:25:10,202 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2021-08-27 06:25:10,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 06:25:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2021-08-27 06:25:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 06:25:10,203 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:25:10,203 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, 1, 1, 1, 1] [2021-08-27 06:25:10,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 06:25:10,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:25:10,403 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting entry_pointErr0REQUIRES_VIOLATION === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:25:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:25:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2038394776, now seen corresponding path program 1 times [2021-08-27 06:25:10,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:25:10,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953160602] [2021-08-27 06:25:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:25:10,404 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:25:10,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:25:10,405 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:25:10,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 06:25:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:25:10,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-27 06:25:10,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:25:11,025 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 06:25:11,025 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 2 case distinctions, treesize of input 12 treesize of output 26 [2021-08-27 06:25:11,092 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 7 treesize of output 5 [2021-08-27 06:25:11,280 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 17 treesize of output 14 [2021-08-27 06:25:11,401 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 18 treesize of output 15 [2021-08-27 06:25:11,498 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 28 treesize of output 24 [2021-08-27 06:25:11,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:25:11,569 INFO L354 Elim1Store]: treesize reduction 18, result has 30.8 percent of original size [2021-08-27 06:25:11,569 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 36 treesize of output 35 [2021-08-27 06:25:11,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-08-27 06:25:11,824 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 41 treesize of output 29 [2021-08-27 06:25:11,836 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-27 06:25:11,836 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 32 [2021-08-27 06:25:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:11,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:25:14,508 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 44 treesize of output 40 [2021-08-27 06:25:16,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-08-27 06:25:25,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_114| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ldv_malloc_#res.base_114| (_ bv1 1)) v_probe1_6_~a.base_BEFORE_CALL_48))))) (_ bv1 1)))) (exists ((|v_probe1_6_#t~ret40.base_129| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_129|)))))) (or (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_129| (_ bv0 1)) |c_~#a6~0.base|)))))))))) (_ bv1 1)))) (not (= |c_~#a6~0.base| v_probe1_6_~a.base_BEFORE_CALL_48)) (not (= |v_probe1_6_#in~a.offset_BEFORE_CALL_30| v_probe1_6_~a.offset_BEFORE_CALL_36))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_129| (_ bv1 1)) v_probe1_6_~a.base_BEFORE_CALL_48))) (_ bv1 1))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_114|)))) (and (= |c_~#a6~0.base| v_probe1_6_~a.base_BEFORE_CALL_48) (= |v_probe1_6_#in~a.offset_BEFORE_CALL_30| v_probe1_6_~a.offset_BEFORE_CALL_36) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ldv_malloc_#res.base_114| (_ bv0 1)) |c_~#a6~0.base|))))))) (_ bv1 1)))))) is different from false [2021-08-27 06:25:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:25:28,511 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:25:28,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953160602] [2021-08-27 06:25:28,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953160602] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:25:28,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:25:28,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [] total 26 [2021-08-27 06:25:28,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787223779] [2021-08-27 06:25:28,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-27 06:25:28,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:25:28,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-27 06:25:28,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=542, Unknown=3, NotChecked=48, Total=702 [2021-08-27 06:25:28,513 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand has 27 states, 24 states have (on average 2.25) internal successors, (54), 22 states have internal predecessors, (54), 8 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2021-08-27 06:25:30,787 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_~#a6~0.base|))) (let ((.cse9 (select .cse10 |c_~#a6~0.offset|))) (let ((.cse5 (= |c_~#a6~0.base| c_probe1_6_~a.base)) (.cse6 (= c_probe1_6_~a.offset |c_probe1_6_#in~a.offset|)) (.cse8 (not (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| c_probe1_6_~a.base)) (_ bv1 1))))) (.cse4 (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_old(#valid)| |c_~#a6~0.base|)))))) (.cse7 (not (= |c_~#a6~0.base| |c_probe1_6_#in~a.base|))) (.cse0 (not (= |c_~#a6~0.offset| |c_disconnect_6_#in~a.offset|))) (.cse1 (not (= (_ bv0 1) (bvadd (select (store |c_old(#valid)| .cse9 (_ bv0 1)) |c_~#a6~0.base|) (_ bv1 1))))) (.cse2 (not (= |c_~#a6~0.base| |c_disconnect_6_#in~a.base|)))) (and (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_~#a6~0.base|)))) .cse0 .cse1 .cse2) (exists ((v_arrayElimCell_32 (_ BitVec 1))) (let ((.cse3 (bvneg v_arrayElimCell_32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse3)) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse3 (select |c_#valid| |c_~#a6~0.base|)))))) (forall ((|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32))) (or (exists ((|v_probe1_6_#t~ret40.base_129| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_129|)))))) (or (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_129| (_ bv0 1)) |c_~#a6~0.base|)))))))))) (_ bv1 1)))) (not (= |c_~#a6~0.base| v_probe1_6_~a.base_BEFORE_CALL_48)) (not (= |v_probe1_6_#in~a.offset_BEFORE_CALL_30| v_probe1_6_~a.offset_BEFORE_CALL_36))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_129| (_ bv1 1)) v_probe1_6_~a.base_BEFORE_CALL_48))) (_ bv1 1))))) (and (= |c_~#a6~0.base| v_probe1_6_~a.base_BEFORE_CALL_48) (= |v_probe1_6_#in~a.offset_BEFORE_CALL_30| v_probe1_6_~a.offset_BEFORE_CALL_36) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |c_~#a6~0.base|)))))))))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_probe1_6_~a.base_BEFORE_CALL_48))) (_ bv1 1)))))) (or .cse4 (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |c_~#a6~0.base|)))))) (_ bv1 1))) .cse5 .cse6) .cse7 .cse8) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| .cse9 (_ bv0 1)) |c_~#a6~0.base|))) (exists ((v_arrayElimCell_30 (_ BitVec 32))) (and (not (= |c_~#a6~0.base| v_arrayElimCell_30)) (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_30)))) (or .cse4 (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| (select .cse10 |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_~#a6~0.base|))) .cse7) (or (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |c_~#a6~0.base|)))))) (_ bv1 1))) .cse5 .cse6) .cse4 .cse7 .cse8) (or .cse4 (forall ((|v_probe1_6_#t~ret40.base_129| (_ BitVec 32))) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_probe1_6_#t~ret40.base_129| (_ bv0 1)) |c_~#a6~0.base|))))))))))) (= |c_~#a6~0.base| c_probe1_6_~a.base) (= c_probe1_6_~a.offset |c_probe1_6_#in~a.offset|)) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| |v_probe1_6_#t~ret40.base_129| (_ bv1 1)) c_probe1_6_~a.base))) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_probe1_6_#t~ret40.base_129|)))))))) .cse7) (or (= (_ bv0 1) (bvadd (bvneg (select (store |c_#valid| (select (select |c_#memory_$Pointer$.base| c_disconnect_6_~a.base) c_disconnect_6_~a.offset) (_ bv0 1)) |c_~#a6~0.base|)) (_ bv1 1))) .cse0 .cse1 .cse2))))) is different from false [2021-08-27 06:26:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:34,463 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2021-08-27 06:26:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:26:34,463 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.25) internal successors, (54), 22 states have internal predecessors, (54), 8 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 42 [2021-08-27 06:26:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:34,464 INFO L225 Difference]: With dead ends: 46 [2021-08-27 06:26:34,464 INFO L226 Difference]: Without dead ends: 46 [2021-08-27 06:26:34,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 54374.7ms TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=8, NotChecked=138, Total=1406 [2021-08-27 06:26:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-27 06:26:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-08-27 06:26:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 06:26:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2021-08-27 06:26:34,467 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 42 [2021-08-27 06:26:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:34,467 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2021-08-27 06:26:34,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.25) internal successors, (54), 22 states have internal predecessors, (54), 8 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2021-08-27 06:26:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2021-08-27 06:26:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 06:26:34,468 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:34,468 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:34,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-27 06:26:34,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:26:34,673 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION (and 79 more)] === [2021-08-27 06:26:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash 724166524, now seen corresponding path program 1 times [2021-08-27 06:26:34,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:26:34,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578463353] [2021-08-27 06:26:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:34,674 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:26:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:26:34,675 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:26:34,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 06:26:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:35,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:26:35,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:35,411 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 06:26:35,411 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 2 case distinctions, treesize of input 12 treesize of output 26 [2021-08-27 06:26:35,488 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 11 treesize of output 9 [2021-08-27 06:26:35,677 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 17 treesize of output 14 [2021-08-27 06:26:35,803 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 18 treesize of output 15 [2021-08-27 06:26:35,914 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 28 treesize of output 24 [2021-08-27 06:26:36,016 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 18 treesize of output 12 [2021-08-27 06:26:36,151 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 27 treesize of output 19 [2021-08-27 06:26:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:40,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:26:44,731 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:26:44,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578463353] [2021-08-27 06:26:44,732 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:26:44,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712822094] [2021-08-27 06:26:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:44,732 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:26:44,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:26:44,733 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:26:44,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-08-27 06:26:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:45,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 06:26:45,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:45,695 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 06:26:45,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 38 [2021-08-27 06:26:49,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-08-27 06:26:50,235 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 18 treesize of output 15 [2021-08-27 06:26:50,424 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 20 treesize of output 17 [2021-08-27 06:26:50,616 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 28 treesize of output 24 [2021-08-27 06:26:50,840 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 17 treesize of output 11 [2021-08-27 06:26:51,113 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 27 treesize of output 19 [2021-08-27 06:26:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:26:55,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:27:01,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:27:01,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996175190] [2021-08-27 06:27:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:01,625 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:27:01,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:27:01,626 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:27:01,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 06:27:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:02,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 06:27:02,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:02,592 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 18 treesize of output 15 [2021-08-27 06:27:02,702 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 18 treesize of output 15 [2021-08-27 06:27:02,799 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 28 treesize of output 24 [2021-08-27 06:27:02,851 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 16 treesize of output 10 [2021-08-27 06:27:02,912 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 27 treesize of output 19 [2021-08-27 06:27:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:27:04,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:27:09,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:27:09,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:09,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:27:09,350 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:27:09,350 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:27:09,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_allocErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_allocErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kref_initErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kref_initErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_add_returnErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_add_returnErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_add_returnErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_add_returnErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_dev_set_drvdataErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_dev_set_drvdataErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_delErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_delErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_delErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_delErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_sub_returnErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_sub_returnErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_sub_returnErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_atomic_sub_returnErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_destroy_msgsErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_destroy_msgsErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_destroy_msgsErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_destroy_msgsErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_destroy_msgsErr4REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_destroy_msgsErr5REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_dev_get_drvdataErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_dev_get_drvdataErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_fillErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_fillErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_fillErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_fillErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_fillErr4REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_msg_fillErr5REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_createErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_createErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr2REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr3REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_add_tailErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_add_tailErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location entry_pointErr0REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location entry_pointErr1REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location disconnect_6Err0REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location disconnect_6Err1REQUIRES_VIOLATION [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location probe1_6Err0REQUIRES_VIOLATION [2021-08-27 06:27:09,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location probe1_6Err1REQUIRES_VIOLATION [2021-08-27 06:27:09,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:27:09,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 06:27:09,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-08-27 06:27:09,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2021-08-27 06:27:09,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-08-27 06:27:09,964 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:27:09,967 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 06:27:09,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:27:09 BoogieIcfgContainer [2021-08-27 06:27:09,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:27:09,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:27:09,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:27:09,984 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:27:09,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:24:06" (3/4) ... [2021-08-27 06:27:09,987 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:27:09,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:27:09,987 INFO L168 Benchmark]: Toolchain (without parser) took 185125.92 ms. Allocated memory was 48.2 MB in the beginning and 195.0 MB in the end (delta: 146.8 MB). Free memory was 22.8 MB in the beginning and 153.8 MB in the end (delta: -131.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-27 06:27:09,988 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 48.2 MB. Free memory was 31.2 MB in the beginning and 31.2 MB in the end (delta: 60.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:27:09,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.34 ms. Allocated memory is still 60.8 MB. Free memory was 46.0 MB in the beginning and 38.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2021-08-27 06:27:09,988 INFO L168 Benchmark]: Boogie Preprocessor took 84.65 ms. Allocated memory is still 60.8 MB. Free memory was 38.2 MB in the beginning and 33.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:27:09,989 INFO L168 Benchmark]: RCFGBuilder took 1257.02 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 33.2 MB in the beginning and 48.4 MB in the end (delta: -15.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:27:09,989 INFO L168 Benchmark]: TraceAbstraction took 183073.51 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 48.4 MB in the beginning and 153.8 MB in the end (delta: -105.4 MB). Peak memory consumption was 121.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:27:09,989 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 195.0 MB. Free memory is still 153.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:27:09,991 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 31.2 MB in the beginning and 31.2 MB in the end (delta: 60.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 686.34 ms. Allocated memory is still 60.8 MB. Free memory was 46.0 MB in the beginning and 38.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.65 ms. Allocated memory is still 60.8 MB. Free memory was 38.2 MB in the beginning and 33.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1257.02 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 33.2 MB in the beginning and 48.4 MB in the end (delta: -15.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 183073.51 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 48.4 MB in the beginning and 153.8 MB in the end (delta: -105.4 MB). Peak memory consumption was 121.2 MB. Max. memory is 16.1 GB. * Witness Printer took 2.61 ms. Allocated memory is still 195.0 MB. Free memory is still 153.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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: 791]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: unable to decide satisfiability of path constraint, overapproximation of memtrack at line 791. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L783] struct A a6; [L792] CALL entry_point() [L785] CALL, EXPR probe1_6(&a6) [L764] int ret = - -3; [L765] CALL, EXPR ldv_malloc(sizeof(int)) [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L765] RET, EXPR ldv_malloc(sizeof(int)) [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) [L768] CALL, EXPR f6() [L758] return __VERIFIER_nondet_int(); [L768] RET, EXPR f6() [L768] ret = f6() [L769] COND FALSE !(ret<0) [L771] CALL, EXPR g6() [L761] return __VERIFIER_nondet_int(); [L771] RET, EXPR g6() [L771] ret = g6() [L772] COND FALSE !(ret<0) [L774] a->p = p [L775] return 0; [L785] RET, EXPR probe1_6(&a6) [L785] int ret = probe1_6(&a6); [L786] COND TRUE ret==0 [L787] CALL disconnect_6(&a6) [L781] EXPR a->p [L781] free(a->p) [L781] free(a->p) [L781] free(a->p) [L787] RET disconnect_6(&a6) [L789] a6.p = 0 [L792] RET entry_point() - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 666]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 666]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 51 procedures, 374 locations, 83 error locations. Started 1 CEGAR loops. OverallTime: 183012.7ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 26.4ms, AutomataDifference: 104241.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 882 SDtfs, 1315 SDslu, 2932 SDs, 0 SdLazy, 2300 SolverSat, 366 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 57583.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 822 SyntacticMatches, 61 SemanticMatches, 219 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 63892.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=0, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 111.9ms AutomataMinimizationTime, 18 MinimizatonAttempts, 85 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 193.4ms SsaConstructionTime, 482.1ms SatisfiabilityAnalysisTime, 33521.4ms InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1014 ConstructedInterpolants, 82 QuantifiedInterpolants, 8008 SizeOfPredicates, 97 NumberOfNonLiveVariables, 2177 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:27:10,077 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...