./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test8.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_test8.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 ea76204732189107ea57f186f34feef6f7f76c1e ............................................................................................................................... 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 -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_test8.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 ea76204732189107ea57f186f34feef6f7f76c1e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:06:30,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:06:30,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:06:30,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:06:30,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:06:30,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:06:30,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:06:30,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:06:30,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:06:30,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:06:30,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:06:30,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:06:30,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:06:30,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:06:30,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:06:30,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:06:30,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:06:30,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:06:30,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:06:30,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:06:30,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:06:30,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:06:30,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:06:30,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:06:30,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:06:30,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:06:30,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:06:30,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:06:30,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:06:30,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:06:30,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:06:30,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:06:30,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:06:30,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:06:30,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:06:30,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:06:30,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:06:30,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:06:30,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:06:30,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:06:30,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:06:30,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:06:30,426 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:06:30,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:06:30,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:06:30,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:06:30,431 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:06:30,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:06:30,432 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:06:30,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:06:30,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:06:30,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:06:30,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:06:30,435 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:06:30,435 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:06:30,436 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:06:30,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:06:30,436 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:06:30,437 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:06:30,437 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:06:30,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:06:30,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:06:30,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:06:30,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:06:30,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:06:30,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:06:30,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:06:30,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:06:30,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:06:30,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:06:30,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> ea76204732189107ea57f186f34feef6f7f76c1e [2020-07-29 01:06:30,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:06:30,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:06:30,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:06:30,771 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:06:30,771 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:06:30,772 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2020-07-29 01:06:30,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1ed1454/45c43cc05c14436db225b42e321e8793/FLAGe39d4c398 [2020-07-29 01:06:31,334 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:06:31,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2020-07-29 01:06:31,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1ed1454/45c43cc05c14436db225b42e321e8793/FLAGe39d4c398 [2020-07-29 01:06:31,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1ed1454/45c43cc05c14436db225b42e321e8793 [2020-07-29 01:06:31,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:06:31,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:06:31,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:06:31,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:06:31,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:06:31,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:06:31" (1/1) ... [2020-07-29 01:06:31,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e9c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:31, skipping insertion in model container [2020-07-29 01:06:31,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:06:31" (1/1) ... [2020-07-29 01:06:31,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:06:31,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:06:32,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:06:32,398 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) [2020-07-29 01:06:32,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@423e69b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:32, skipping insertion in model container [2020-07-29 01:06:32,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:06:32,400 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2020-07-29 01:06:32,405 INFO L168 Benchmark]: Toolchain (without parser) took 790.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:32,406 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:06:32,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:32,412 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 783.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 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.1.25-8bd4bc6 [2020-07-29 01:06:34,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:06:34,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:06:34,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:06:34,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:06:34,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:06:34,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:06:34,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:06:34,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:06:34,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:06:34,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:06:34,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:06:34,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:06:34,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:06:34,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:06:34,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:06:34,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:06:34,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:06:34,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:06:34,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:06:34,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:06:34,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:06:34,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:06:34,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:06:34,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:06:34,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:06:34,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:06:34,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:06:34,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:06:34,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:06:34,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:06:34,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:06:34,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:06:34,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:06:34,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:06:34,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:06:34,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:06:34,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:06:34,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:06:34,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:06:34,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:06:34,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-07-29 01:06:34,305 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:06:34,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:06:34,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:06:34,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:06:34,307 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:06:34,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:06:34,308 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:06:34,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:06:34,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:06:34,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:06:34,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:06:34,309 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:06:34,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:06:34,310 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:06:34,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:06:34,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:06:34,311 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:06:34,311 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:06:34,311 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:06:34,311 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:06:34,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:06:34,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:06:34,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:06:34,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:06:34,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:06:34,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:06:34,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:06:34,314 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:06:34,314 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:06:34,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:06:34,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:06:34,315 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> ea76204732189107ea57f186f34feef6f7f76c1e [2020-07-29 01:06:34,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:06:34,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:06:34,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:06:34,676 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:06:34,677 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:06:34,678 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2020-07-29 01:06:34,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4476c8d80/2efb1155d44347d3ac82aaf50f9232ea/FLAG749c541b6 [2020-07-29 01:06:35,301 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:06:35,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2020-07-29 01:06:35,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4476c8d80/2efb1155d44347d3ac82aaf50f9232ea/FLAG749c541b6 [2020-07-29 01:06:35,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4476c8d80/2efb1155d44347d3ac82aaf50f9232ea [2020-07-29 01:06:35,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:06:35,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:06:35,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:06:35,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:06:35,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:06:35,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:06:35" (1/1) ... [2020-07-29 01:06:35,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46506e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:35, skipping insertion in model container [2020-07-29 01:06:35,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:06:35" (1/1) ... [2020-07-29 01:06:35,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:06:35,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:06:36,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:06:36,241 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-07-29 01:06:36,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:06:36,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:06:36,340 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:06:36,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:06:36,518 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:06:36,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36 WrapperNode [2020-07-29 01:06:36,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:06:36,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:06:36,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:06:36,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:06:36,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... [2020-07-29 01:06:36,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... [2020-07-29 01:06:36,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... [2020-07-29 01:06:36,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... [2020-07-29 01:06:36,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... [2020-07-29 01:06:36,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... [2020-07-29 01:06:36,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... [2020-07-29 01:06:36,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:06:36,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:06:36,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:06:36,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:06:36,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:06:36,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:06:36,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:06:36,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:06:36,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:06:36,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:06:36,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:06:36,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:06:36,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:06:36,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:06:36,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2020-07-29 01:06:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2020-07-29 01:06:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-07-29 01:06:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2020-07-29 01:06:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:06:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-07-29 01:06:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-07-29 01:06:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-07-29 01:06:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-07-29 01:06:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-07-29 01:06:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2020-07-29 01:06:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2020-07-29 01:06:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2020-07-29 01:06:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2020-07-29 01:06:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2020-07-29 01:06:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2020-07-29 01:06:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2020-07-29 01:06:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2020-07-29 01:06:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2020-07-29 01:06:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2020-07-29 01:06:36,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2020-07-29 01:06:36,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2020-07-29 01:06:36,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2020-07-29 01:06:36,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2020-07-29 01:06:36,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2020-07-29 01:06:36,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2020-07-29 01:06:36,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2020-07-29 01:06:36,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2020-07-29 01:06:36,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2020-07-29 01:06:36,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2020-07-29 01:06:36,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2020-07-29 01:06:36,761 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-29 01:06:36,761 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-29 01:06:36,762 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_8 [2020-07-29 01:06:36,762 INFO L138 BoogieDeclarations]: Found implementation of procedure free_8 [2020-07-29 01:06:36,762 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2020-07-29 01:06:36,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:06:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2020-07-29 01:06:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-29 01:06:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-07-29 01:06:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:06:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:06:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:06:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:06:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:06:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:06:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:06:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:06:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:06:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:06:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:06:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:06:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:06:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:06:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:06:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:06:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:06:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:06:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:06:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:06:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:06:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:06:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:06:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:06:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:06:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:06:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:06:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:06:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:06:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:06:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:06:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:06:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:06:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:06:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:06:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:06:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:06:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:06:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:06:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:06:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:06:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:06:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:06:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:06:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:06:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:06:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:06:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:06:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:06:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:06:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:06:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:06:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:06:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:06:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:06:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:06:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:06:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:06:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:06:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:06:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:06:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:06:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:06:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:06:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:06:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:06:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:06:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:06:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:06:36,779 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:06:36,779 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:06:36,779 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:06:36,779 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:06:36,779 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:06:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:06:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:06:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:06:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:06:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:06:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:06:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:06:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:06:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:06:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:06:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:06:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:06:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:06:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:06:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:06:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:06:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:06:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:06:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:06:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:06:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:06:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:06:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:06:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:06:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:06:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:06:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:06:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:06:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-07-29 01:06:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:06:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2020-07-29 01:06:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2020-07-29 01:06:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-29 01:06:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-07-29 01:06:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-07-29 01:06:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:06:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2020-07-29 01:06:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-29 01:06:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:06:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:06:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-07-29 01:06:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-07-29 01:06:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-07-29 01:06:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:06:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-07-29 01:06:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-07-29 01:06:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2020-07-29 01:06:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2020-07-29 01:06:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-07-29 01:06:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2020-07-29 01:06:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:06:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2020-07-29 01:06:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2020-07-29 01:06:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2020-07-29 01:06:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2020-07-29 01:06:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2020-07-29 01:06:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:06:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:06:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2020-07-29 01:06:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2020-07-29 01:06:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:06:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2020-07-29 01:06:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2020-07-29 01:06:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2020-07-29 01:06:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2020-07-29 01:06:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2020-07-29 01:06:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2020-07-29 01:06:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2020-07-29 01:06:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2020-07-29 01:06:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2020-07-29 01:06:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2020-07-29 01:06:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2020-07-29 01:06:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2020-07-29 01:06:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-29 01:06:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-29 01:06:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_8 [2020-07-29 01:06:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure free_8 [2020-07-29 01:06:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2020-07-29 01:06:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:06:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:06:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:06:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 01:06:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:06:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:06:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-07-29 01:06:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-07-29 01:06:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2020-07-29 01:06:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2020-07-29 01:06:37,576 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:06:38,049 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:06:38,596 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:06:38,596 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:06:38,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:38 BoogieIcfgContainer [2020-07-29 01:06:38,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:06:38,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:06:38,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:06:38,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:06:38,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:06:35" (1/3) ... [2020-07-29 01:06:38,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f085b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:06:38, skipping insertion in model container [2020-07-29 01:06:38,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:36" (2/3) ... [2020-07-29 01:06:38,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f085b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:06:38, skipping insertion in model container [2020-07-29 01:06:38,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:38" (3/3) ... [2020-07-29 01:06:38,612 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test8.i [2020-07-29 01:06:38,627 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:06:38,638 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2020-07-29 01:06:38,662 INFO L251 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2020-07-29 01:06:38,693 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:06:38,694 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:06:38,694 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:06:38,694 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:06:38,694 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:06:38,694 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:06:38,695 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:06:38,695 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:06:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2020-07-29 01:06:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:06:38,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:38,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:38,732 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash 12717103, now seen corresponding path program 1 times [2020-07-29 01:06:38,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:38,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289655909] [2020-07-29 01:06:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:39,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:06:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:39,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:39,194 INFO L263 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2020-07-29 01:06:39,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {106#true} is VALID [2020-07-29 01:06:39,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#true} assume true; {106#true} is VALID [2020-07-29 01:06:39,196 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {106#true} {106#true} #457#return; {106#true} is VALID [2020-07-29 01:06:39,196 INFO L263 TraceCheckUtils]: 4: Hoare triple {106#true} call main(); {106#true} is VALID [2020-07-29 01:06:39,196 INFO L263 TraceCheckUtils]: 5: Hoare triple {106#true} call entry_point(); {106#true} is VALID [2020-07-29 01:06:39,197 INFO L263 TraceCheckUtils]: 6: Hoare triple {106#true} call alloc_8(); {106#true} is VALID [2020-07-29 01:06:39,197 INFO L263 TraceCheckUtils]: 7: Hoare triple {106#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {106#true} is VALID [2020-07-29 01:06:39,197 INFO L280 TraceCheckUtils]: 8: Hoare triple {106#true} ~size := #in~size; {106#true} is VALID [2020-07-29 01:06:39,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {106#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:39,208 INFO L280 TraceCheckUtils]: 10: Hoare triple {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:39,212 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {106#true} #401#return; {145#(= (_ bv0 32) |alloc_8_#t~ret38.offset|)} is VALID [2020-07-29 01:06:39,215 INFO L280 TraceCheckUtils]: 12: Hoare triple {145#(= (_ bv0 32) |alloc_8_#t~ret38.offset|)} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,216 INFO L280 TraceCheckUtils]: 13: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} assume true; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,217 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {149#(= ~a8~0.offset (_ bv0 32))} {106#true} #445#return; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,222 INFO L263 TraceCheckUtils]: 15: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} call free_8(); {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,223 INFO L280 TraceCheckUtils]: 16: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,225 INFO L280 TraceCheckUtils]: 17: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} assume !(0bv32 == ~a8~0.offset); {107#false} is VALID [2020-07-29 01:06:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:39,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:39,410 INFO L280 TraceCheckUtils]: 17: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} assume !(0bv32 == ~a8~0.offset); {107#false} is VALID [2020-07-29 01:06:39,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,412 INFO L263 TraceCheckUtils]: 15: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} call free_8(); {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,412 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {149#(= ~a8~0.offset (_ bv0 32))} {106#true} #445#return; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,413 INFO L280 TraceCheckUtils]: 13: Hoare triple {149#(= ~a8~0.offset (_ bv0 32))} assume true; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {145#(= (_ bv0 32) |alloc_8_#t~ret38.offset|)} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {149#(= ~a8~0.offset (_ bv0 32))} is VALID [2020-07-29 01:06:39,415 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {106#true} #401#return; {145#(= (_ bv0 32) |alloc_8_#t~ret38.offset|)} is VALID [2020-07-29 01:06:39,416 INFO L280 TraceCheckUtils]: 10: Hoare triple {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:39,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {106#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {138#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:06:39,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {106#true} ~size := #in~size; {106#true} is VALID [2020-07-29 01:06:39,418 INFO L263 TraceCheckUtils]: 7: Hoare triple {106#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {106#true} is VALID [2020-07-29 01:06:39,419 INFO L263 TraceCheckUtils]: 6: Hoare triple {106#true} call alloc_8(); {106#true} is VALID [2020-07-29 01:06:39,419 INFO L263 TraceCheckUtils]: 5: Hoare triple {106#true} call entry_point(); {106#true} is VALID [2020-07-29 01:06:39,419 INFO L263 TraceCheckUtils]: 4: Hoare triple {106#true} call main(); {106#true} is VALID [2020-07-29 01:06:39,420 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {106#true} {106#true} #457#return; {106#true} is VALID [2020-07-29 01:06:39,420 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#true} assume true; {106#true} is VALID [2020-07-29 01:06:39,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {106#true} is VALID [2020-07-29 01:06:39,420 INFO L263 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2020-07-29 01:06:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:39,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289655909] [2020-07-29 01:06:39,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:39,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:06:39,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305999385] [2020-07-29 01:06:39,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-29 01:06:39,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:39,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:06:39,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:39,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:06:39,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:06:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:39,495 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 5 states. [2020-07-29 01:06:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:39,750 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:06:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:06:39,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-29 01:06:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-29 01:06:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-29 01:06:39,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-29 01:06:39,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:39,846 INFO L225 Difference]: With dead ends: 32 [2020-07-29 01:06:39,846 INFO L226 Difference]: Without dead ends: 29 [2020-07-29 01:06:39,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:06:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-29 01:06:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-29 01:06:39,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:39,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:39,886 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:39,886 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:39,892 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:06:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:06:39,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:39,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:39,893 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:39,894 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:39,898 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:06:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:06:39,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:39,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:39,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:39,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:06:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-29 01:06:39,905 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2020-07-29 01:06:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:39,905 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-29 01:06:39,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:06:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:06:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:06:39,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:39,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:40,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:06:40,121 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash 394230500, now seen corresponding path program 1 times [2020-07-29 01:06:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:40,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808423408] [2020-07-29 01:06:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:40,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:06:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:40,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:40,409 INFO L263 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {341#true} is VALID [2020-07-29 01:06:40,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {341#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume true; {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,412 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} {341#true} #457#return; {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,413 INFO L263 TraceCheckUtils]: 4: Hoare triple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} call main(); {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,414 INFO L263 TraceCheckUtils]: 5: Hoare triple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point(); {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,415 INFO L263 TraceCheckUtils]: 6: Hoare triple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} call alloc_8(); {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,416 INFO L263 TraceCheckUtils]: 7: Hoare triple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,419 INFO L280 TraceCheckUtils]: 9: Hoare triple {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {374#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {374#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} assume true; {374#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,422 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {374#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} #401#return; {381#(and (not (= (_ bv0 32) |alloc_8_#t~ret38.base|)) (bvult |alloc_8_#t~ret38.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,423 INFO L280 TraceCheckUtils]: 12: Hoare triple {381#(and (not (= (_ bv0 32) |alloc_8_#t~ret38.base|)) (bvult |alloc_8_#t~ret38.base| |#StackHeapBarrier|))} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,424 INFO L280 TraceCheckUtils]: 13: Hoare triple {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} assume true; {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,425 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} {349#(bvult (_ bv0 32) |#StackHeapBarrier|)} #445#return; {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,427 INFO L263 TraceCheckUtils]: 15: Hoare triple {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} call free_8(); {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,429 INFO L280 TraceCheckUtils]: 16: Hoare triple {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} assume 0bv32 == ~a8~0.offset; {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} is VALID [2020-07-29 01:06:40,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {385#(and (not (= (_ bv0 32) ~a8~0.base)) (bvult ~a8~0.base |#StackHeapBarrier|))} assume !~bvult32(~a8~0.base, #StackHeapBarrier); {342#false} is VALID [2020-07-29 01:06:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:40,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:40,757 INFO L280 TraceCheckUtils]: 18: Hoare triple {404#(bvult ~a8~0.base |#StackHeapBarrier|)} assume !~bvult32(~a8~0.base, #StackHeapBarrier); {342#false} is VALID [2020-07-29 01:06:40,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {404#(bvult ~a8~0.base |#StackHeapBarrier|)} assume 0bv32 == ~a8~0.offset; {404#(bvult ~a8~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {404#(bvult ~a8~0.base |#StackHeapBarrier|)} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {404#(bvult ~a8~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,760 INFO L263 TraceCheckUtils]: 15: Hoare triple {404#(bvult ~a8~0.base |#StackHeapBarrier|)} call free_8(); {404#(bvult ~a8~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,761 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {404#(bvult ~a8~0.base |#StackHeapBarrier|)} {341#true} #445#return; {404#(bvult ~a8~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {404#(bvult ~a8~0.base |#StackHeapBarrier|)} assume true; {404#(bvult ~a8~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,763 INFO L280 TraceCheckUtils]: 12: Hoare triple {426#(bvult |alloc_8_#t~ret38.base| |#StackHeapBarrier|)} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {404#(bvult ~a8~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,764 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {433#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {341#true} #401#return; {426#(bvult |alloc_8_#t~ret38.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,765 INFO L280 TraceCheckUtils]: 10: Hoare triple {433#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {433#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,766 INFO L280 TraceCheckUtils]: 9: Hoare triple {341#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {433#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:06:40,766 INFO L280 TraceCheckUtils]: 8: Hoare triple {341#true} ~size := #in~size; {341#true} is VALID [2020-07-29 01:06:40,766 INFO L263 TraceCheckUtils]: 7: Hoare triple {341#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {341#true} is VALID [2020-07-29 01:06:40,767 INFO L263 TraceCheckUtils]: 6: Hoare triple {341#true} call alloc_8(); {341#true} is VALID [2020-07-29 01:06:40,767 INFO L263 TraceCheckUtils]: 5: Hoare triple {341#true} call entry_point(); {341#true} is VALID [2020-07-29 01:06:40,768 INFO L263 TraceCheckUtils]: 4: Hoare triple {341#true} call main(); {341#true} is VALID [2020-07-29 01:06:40,768 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {341#true} {341#true} #457#return; {341#true} is VALID [2020-07-29 01:06:40,768 INFO L280 TraceCheckUtils]: 2: Hoare triple {341#true} assume true; {341#true} is VALID [2020-07-29 01:06:40,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {341#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {341#true} is VALID [2020-07-29 01:06:40,769 INFO L263 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {341#true} is VALID [2020-07-29 01:06:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:40,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808423408] [2020-07-29 01:06:40,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:40,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2020-07-29 01:06:40,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442744720] [2020-07-29 01:06:40,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-07-29 01:06:40,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:40,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:06:40,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:40,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:06:40,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:06:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:06:40,838 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2020-07-29 01:06:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:41,322 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-29 01:06:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:06:41,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-07-29 01:06:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2020-07-29 01:06:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:06:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2020-07-29 01:06:41,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2020-07-29 01:06:41,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:41,422 INFO L225 Difference]: With dead ends: 41 [2020-07-29 01:06:41,423 INFO L226 Difference]: Without dead ends: 41 [2020-07-29 01:06:41,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:06:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-29 01:06:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-07-29 01:06:41,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:41,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2020-07-29 01:06:41,429 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2020-07-29 01:06:41,430 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2020-07-29 01:06:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:41,433 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-29 01:06:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-29 01:06:41,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:41,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:41,435 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2020-07-29 01:06:41,435 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2020-07-29 01:06:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:41,439 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-29 01:06:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-29 01:06:41,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:41,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:41,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:41,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:06:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-07-29 01:06:41,444 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 19 [2020-07-29 01:06:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:41,445 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-07-29 01:06:41,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:06:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-29 01:06:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:06:41,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:41,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:41,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:06:41,660 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash -663756079, now seen corresponding path program 1 times [2020-07-29 01:06:41,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:41,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128086276] [2020-07-29 01:06:41,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:41,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:06:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:41,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:41,855 INFO L384 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 [2020-07-29 01:06:41,856 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:06:41,861 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:06:41,861 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:06:41,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:06:41,866 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:06:41,866 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_144|]. (= |#valid| (store |v_#valid_144| |ldv_malloc_#res.base| (_ bv1 1))) [2020-07-29 01:06:41,867 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) [2020-07-29 01:06:41,916 INFO L263 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2020-07-29 01:06:41,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {634#true} is VALID [2020-07-29 01:06:41,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-29 01:06:41,917 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {634#true} {634#true} #457#return; {634#true} is VALID [2020-07-29 01:06:41,917 INFO L263 TraceCheckUtils]: 4: Hoare triple {634#true} call main(); {634#true} is VALID [2020-07-29 01:06:41,917 INFO L263 TraceCheckUtils]: 5: Hoare triple {634#true} call entry_point(); {634#true} is VALID [2020-07-29 01:06:41,917 INFO L263 TraceCheckUtils]: 6: Hoare triple {634#true} call alloc_8(); {634#true} is VALID [2020-07-29 01:06:41,917 INFO L263 TraceCheckUtils]: 7: Hoare triple {634#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {634#true} is VALID [2020-07-29 01:06:41,918 INFO L280 TraceCheckUtils]: 8: Hoare triple {634#true} ~size := #in~size; {634#true} is VALID [2020-07-29 01:06:41,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {634#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:41,925 INFO L280 TraceCheckUtils]: 10: Hoare triple {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:41,926 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {634#true} #401#return; {673#(= (bvadd (select |#valid| |alloc_8_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:41,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {673#(= (bvadd (select |#valid| |alloc_8_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:41,928 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume true; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:41,928 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} {634#true} #445#return; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:41,929 INFO L263 TraceCheckUtils]: 15: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} call free_8(); {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:41,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:41,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume 0bv32 == ~a8~0.offset; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:41,931 INFO L280 TraceCheckUtils]: 18: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:41,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume !(0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base]); {635#false} is VALID [2020-07-29 01:06:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:41,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:42,116 INFO L280 TraceCheckUtils]: 19: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume !(0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base]); {635#false} is VALID [2020-07-29 01:06:42,117 INFO L280 TraceCheckUtils]: 18: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:42,118 INFO L280 TraceCheckUtils]: 17: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume 0bv32 == ~a8~0.offset; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:42,118 INFO L280 TraceCheckUtils]: 16: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:42,119 INFO L263 TraceCheckUtils]: 15: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} call free_8(); {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:42,121 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} {634#true} #445#return; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:42,121 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} assume true; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:42,122 INFO L280 TraceCheckUtils]: 12: Hoare triple {673#(= (bvadd (select |#valid| |alloc_8_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {677#(= (_ bv1 1) (select |#valid| ~a8~0.base))} is VALID [2020-07-29 01:06:42,124 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {634#true} #401#return; {673#(= (bvadd (select |#valid| |alloc_8_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:42,128 INFO L280 TraceCheckUtils]: 10: Hoare triple {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:42,130 INFO L280 TraceCheckUtils]: 9: Hoare triple {634#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {666#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:42,130 INFO L280 TraceCheckUtils]: 8: Hoare triple {634#true} ~size := #in~size; {634#true} is VALID [2020-07-29 01:06:42,130 INFO L263 TraceCheckUtils]: 7: Hoare triple {634#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {634#true} is VALID [2020-07-29 01:06:42,130 INFO L263 TraceCheckUtils]: 6: Hoare triple {634#true} call alloc_8(); {634#true} is VALID [2020-07-29 01:06:42,131 INFO L263 TraceCheckUtils]: 5: Hoare triple {634#true} call entry_point(); {634#true} is VALID [2020-07-29 01:06:42,131 INFO L263 TraceCheckUtils]: 4: Hoare triple {634#true} call main(); {634#true} is VALID [2020-07-29 01:06:42,131 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {634#true} {634#true} #457#return; {634#true} is VALID [2020-07-29 01:06:42,131 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-29 01:06:42,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {634#true} is VALID [2020-07-29 01:06:42,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2020-07-29 01:06:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:42,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128086276] [2020-07-29 01:06:42,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:42,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:06:42,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185529113] [2020-07-29 01:06:42,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:06:42,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:42,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:06:42,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:42,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:06:42,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:06:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:42,171 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 5 states. [2020-07-29 01:06:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:42,384 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-29 01:06:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:06:42,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:06:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-29 01:06:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-29 01:06:42,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-29 01:06:42,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:42,464 INFO L225 Difference]: With dead ends: 40 [2020-07-29 01:06:42,464 INFO L226 Difference]: Without dead ends: 40 [2020-07-29 01:06:42,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-29 01:06:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-29 01:06:42,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:42,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-29 01:06:42,469 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-29 01:06:42,470 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-29 01:06:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:42,473 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-29 01:06:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-29 01:06:42,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:42,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:42,474 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-29 01:06:42,474 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-29 01:06:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:42,477 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-29 01:06:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-29 01:06:42,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:42,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:42,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:42,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:06:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-07-29 01:06:42,481 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 20 [2020-07-29 01:06:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:42,481 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-07-29 01:06:42,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:06:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-29 01:06:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:06:42,482 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:42,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:42,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:06:42,701 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1834259858, now seen corresponding path program 1 times [2020-07-29 01:06:42,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:42,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675078669] [2020-07-29 01:06:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:42,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:06:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:42,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:42,941 INFO L263 TraceCheckUtils]: 0: Hoare triple {918#true} call ULTIMATE.init(); {918#true} is VALID [2020-07-29 01:06:42,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {918#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {918#true} is VALID [2020-07-29 01:06:42,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {918#true} assume true; {918#true} is VALID [2020-07-29 01:06:42,943 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {918#true} {918#true} #457#return; {918#true} is VALID [2020-07-29 01:06:42,943 INFO L263 TraceCheckUtils]: 4: Hoare triple {918#true} call main(); {918#true} is VALID [2020-07-29 01:06:42,943 INFO L263 TraceCheckUtils]: 5: Hoare triple {918#true} call entry_point(); {918#true} is VALID [2020-07-29 01:06:42,943 INFO L263 TraceCheckUtils]: 6: Hoare triple {918#true} call alloc_8(); {918#true} is VALID [2020-07-29 01:06:42,944 INFO L263 TraceCheckUtils]: 7: Hoare triple {918#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {918#true} is VALID [2020-07-29 01:06:42,944 INFO L280 TraceCheckUtils]: 8: Hoare triple {918#true} ~size := #in~size; {918#true} is VALID [2020-07-29 01:06:42,946 INFO L280 TraceCheckUtils]: 9: Hoare triple {918#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:42,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:42,948 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {918#true} #401#return; {957#(and (= (_ bv0 32) |alloc_8_#t~ret38.base|) (= (_ bv0 32) |alloc_8_#t~ret38.offset|))} is VALID [2020-07-29 01:06:42,949 INFO L280 TraceCheckUtils]: 12: Hoare triple {957#(and (= (_ bv0 32) |alloc_8_#t~ret38.base|) (= (_ bv0 32) |alloc_8_#t~ret38.offset|))} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:42,950 INFO L280 TraceCheckUtils]: 13: Hoare triple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} assume true; {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:42,951 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} {918#true} #445#return; {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:42,952 INFO L263 TraceCheckUtils]: 15: Hoare triple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} call free_8(); {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:42,953 INFO L280 TraceCheckUtils]: 16: Hoare triple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {919#false} is VALID [2020-07-29 01:06:42,953 INFO L280 TraceCheckUtils]: 17: Hoare triple {919#false} assume 0bv32 == ~a8~0.offset; {919#false} is VALID [2020-07-29 01:06:42,954 INFO L280 TraceCheckUtils]: 18: Hoare triple {919#false} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {919#false} is VALID [2020-07-29 01:06:42,954 INFO L280 TraceCheckUtils]: 19: Hoare triple {919#false} assume !(0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base]); {919#false} is VALID [2020-07-29 01:06:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:42,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:43,131 INFO L280 TraceCheckUtils]: 19: Hoare triple {919#false} assume !(0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base]); {919#false} is VALID [2020-07-29 01:06:43,132 INFO L280 TraceCheckUtils]: 18: Hoare triple {919#false} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {919#false} is VALID [2020-07-29 01:06:43,132 INFO L280 TraceCheckUtils]: 17: Hoare triple {919#false} assume 0bv32 == ~a8~0.offset; {919#false} is VALID [2020-07-29 01:06:43,133 INFO L280 TraceCheckUtils]: 16: Hoare triple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {919#false} is VALID [2020-07-29 01:06:43,134 INFO L263 TraceCheckUtils]: 15: Hoare triple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} call free_8(); {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:43,135 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} {918#true} #445#return; {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:43,135 INFO L280 TraceCheckUtils]: 13: Hoare triple {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} assume true; {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:43,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {957#(and (= (_ bv0 32) |alloc_8_#t~ret38.base|) (= (_ bv0 32) |alloc_8_#t~ret38.offset|))} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {961#(and (= ~a8~0.offset (_ bv0 32)) (= (_ bv0 32) ~a8~0.base))} is VALID [2020-07-29 01:06:43,138 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {918#true} #401#return; {957#(and (= (_ bv0 32) |alloc_8_#t~ret38.base|) (= (_ bv0 32) |alloc_8_#t~ret38.offset|))} is VALID [2020-07-29 01:06:43,139 INFO L280 TraceCheckUtils]: 10: Hoare triple {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:43,174 INFO L280 TraceCheckUtils]: 9: Hoare triple {918#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {950#(and (= (_ bv0 32) |ldv_malloc_#res.offset|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:06:43,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {918#true} ~size := #in~size; {918#true} is VALID [2020-07-29 01:06:43,175 INFO L263 TraceCheckUtils]: 7: Hoare triple {918#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {918#true} is VALID [2020-07-29 01:06:43,175 INFO L263 TraceCheckUtils]: 6: Hoare triple {918#true} call alloc_8(); {918#true} is VALID [2020-07-29 01:06:43,176 INFO L263 TraceCheckUtils]: 5: Hoare triple {918#true} call entry_point(); {918#true} is VALID [2020-07-29 01:06:43,176 INFO L263 TraceCheckUtils]: 4: Hoare triple {918#true} call main(); {918#true} is VALID [2020-07-29 01:06:43,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {918#true} {918#true} #457#return; {918#true} is VALID [2020-07-29 01:06:43,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {918#true} assume true; {918#true} is VALID [2020-07-29 01:06:43,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {918#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {918#true} is VALID [2020-07-29 01:06:43,177 INFO L263 TraceCheckUtils]: 0: Hoare triple {918#true} call ULTIMATE.init(); {918#true} is VALID [2020-07-29 01:06:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:43,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675078669] [2020-07-29 01:06:43,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:43,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-29 01:06:43,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972234838] [2020-07-29 01:06:43,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:06:43,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:43,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:06:43,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:43,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:06:43,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:06:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:43,208 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 5 states. [2020-07-29 01:06:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:43,426 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-29 01:06:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:06:43,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:06:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-29 01:06:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-29 01:06:43,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-29 01:06:43,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:43,513 INFO L225 Difference]: With dead ends: 37 [2020-07-29 01:06:43,513 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 01:06:43,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:06:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 01:06:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-29 01:06:43,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:43,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-29 01:06:43,518 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-29 01:06:43,518 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-29 01:06:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:43,522 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-29 01:06:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-29 01:06:43,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:43,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:43,523 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-29 01:06:43,523 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-29 01:06:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:43,525 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-29 01:06:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-29 01:06:43,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:43,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:43,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:43,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:06:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-07-29 01:06:43,529 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 20 [2020-07-29 01:06:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:43,529 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-07-29 01:06:43,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:06:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-29 01:06:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:06:43,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:43,530 INFO L422 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] [2020-07-29 01:06:43,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:06:43,737 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1534178647, now seen corresponding path program 1 times [2020-07-29 01:06:43,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:43,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609427989] [2020-07-29 01:06:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:43,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:06:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:43,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:43,909 INFO L263 TraceCheckUtils]: 0: Hoare triple {1193#true} call ULTIMATE.init(); {1193#true} is VALID [2020-07-29 01:06:43,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {1193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1193#true} is VALID [2020-07-29 01:06:43,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {1193#true} assume true; {1193#true} is VALID [2020-07-29 01:06:43,909 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1193#true} {1193#true} #457#return; {1193#true} is VALID [2020-07-29 01:06:43,910 INFO L263 TraceCheckUtils]: 4: Hoare triple {1193#true} call main(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,912 INFO L263 TraceCheckUtils]: 5: Hoare triple {1210#(= |#valid| |old(#valid)|)} call entry_point(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,913 INFO L263 TraceCheckUtils]: 6: Hoare triple {1210#(= |#valid| |old(#valid)|)} call alloc_8(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,914 INFO L263 TraceCheckUtils]: 7: Hoare triple {1210#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {1210#(= |#valid| |old(#valid)|)} ~size := #in~size; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,916 INFO L280 TraceCheckUtils]: 9: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,916 INFO L280 TraceCheckUtils]: 10: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,918 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #401#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,919 INFO L280 TraceCheckUtils]: 12: Hoare triple {1210#(= |#valid| |old(#valid)|)} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,920 INFO L280 TraceCheckUtils]: 13: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,920 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #445#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,921 INFO L263 TraceCheckUtils]: 15: Hoare triple {1210#(= |#valid| |old(#valid)|)} call free_8(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,921 INFO L280 TraceCheckUtils]: 16: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume !(~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,923 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #447#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {1210#(= |#valid| |old(#valid)|)} ~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,924 INFO L280 TraceCheckUtils]: 20: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,925 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #419#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:43,925 INFO L280 TraceCheckUtils]: 22: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1194#false} is VALID [2020-07-29 01:06:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:43,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:44,112 INFO L280 TraceCheckUtils]: 22: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1194#false} is VALID [2020-07-29 01:06:44,113 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #419#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,114 INFO L280 TraceCheckUtils]: 20: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,115 INFO L280 TraceCheckUtils]: 19: Hoare triple {1210#(= |#valid| |old(#valid)|)} ~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,115 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #447#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,116 INFO L280 TraceCheckUtils]: 17: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,116 INFO L280 TraceCheckUtils]: 16: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume !(~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,117 INFO L263 TraceCheckUtils]: 15: Hoare triple {1210#(= |#valid| |old(#valid)|)} call free_8(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,118 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #445#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,118 INFO L280 TraceCheckUtils]: 13: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,119 INFO L280 TraceCheckUtils]: 12: Hoare triple {1210#(= |#valid| |old(#valid)|)} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,120 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1210#(= |#valid| |old(#valid)|)} {1210#(= |#valid| |old(#valid)|)} #401#return; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,121 INFO L280 TraceCheckUtils]: 10: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume true; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,121 INFO L280 TraceCheckUtils]: 9: Hoare triple {1210#(= |#valid| |old(#valid)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,122 INFO L280 TraceCheckUtils]: 8: Hoare triple {1210#(= |#valid| |old(#valid)|)} ~size := #in~size; {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,122 INFO L263 TraceCheckUtils]: 7: Hoare triple {1210#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,123 INFO L263 TraceCheckUtils]: 6: Hoare triple {1210#(= |#valid| |old(#valid)|)} call alloc_8(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,124 INFO L263 TraceCheckUtils]: 5: Hoare triple {1210#(= |#valid| |old(#valid)|)} call entry_point(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,125 INFO L263 TraceCheckUtils]: 4: Hoare triple {1193#true} call main(); {1210#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:44,125 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1193#true} {1193#true} #457#return; {1193#true} is VALID [2020-07-29 01:06:44,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {1193#true} assume true; {1193#true} is VALID [2020-07-29 01:06:44,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {1193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1193#true} is VALID [2020-07-29 01:06:44,126 INFO L263 TraceCheckUtils]: 0: Hoare triple {1193#true} call ULTIMATE.init(); {1193#true} is VALID [2020-07-29 01:06:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:44,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609427989] [2020-07-29 01:06:44,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:44,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-29 01:06:44,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333862648] [2020-07-29 01:06:44,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-29 01:06:44,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:44,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:06:44,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:44,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:06:44,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:06:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:06:44,158 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 3 states. [2020-07-29 01:06:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:44,239 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2020-07-29 01:06:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:06:44,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-29 01:06:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:06:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2020-07-29 01:06:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:06:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2020-07-29 01:06:44,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2020-07-29 01:06:44,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:44,298 INFO L225 Difference]: With dead ends: 40 [2020-07-29 01:06:44,298 INFO L226 Difference]: Without dead ends: 27 [2020-07-29 01:06:44,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:06:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-29 01:06:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-29 01:06:44,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:44,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-29 01:06:44,303 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-29 01:06:44,303 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-29 01:06:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:44,305 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-07-29 01:06:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-07-29 01:06:44,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:44,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:44,306 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-29 01:06:44,306 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-29 01:06:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:44,308 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-07-29 01:06:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-07-29 01:06:44,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:44,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:44,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:44,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:06:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2020-07-29 01:06:44,312 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 23 [2020-07-29 01:06:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:44,312 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2020-07-29 01:06:44,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:06:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-07-29 01:06:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-29 01:06:44,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:44,314 INFO L422 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] [2020-07-29 01:06:44,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:06:44,527 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash 714098001, now seen corresponding path program 1 times [2020-07-29 01:06:44,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:44,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397829399] [2020-07-29 01:06:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:44,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:06:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:44,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:44,689 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:06:44,690 INFO L384 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 25 [2020-07-29 01:06:44,690 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:06:44,709 INFO L624 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-07-29 01:06:44,713 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:06:44,716 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:06:44,717 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-07-29 01:06:44,721 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:06:44,721 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_223|, |~#ldv_global_msg_list~0.base|]. (= |#valid| (store (store |v_#valid_223| (_ bv0 32) (_ bv0 1)) |~#ldv_global_msg_list~0.base| (_ bv1 1))) [2020-07-29 01:06:44,721 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|~#ldv_global_msg_list~0.base|]. (and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1))) [2020-07-29 01:06:44,722 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:06:44,743 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:06:44,768 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:06:44,788 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:06:44,934 INFO L384 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 [2020-07-29 01:06:44,935 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:06:44,939 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:06:44,939 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:06:44,939 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2020-07-29 01:06:51,089 INFO L263 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2020-07-29 01:06:51,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1462#(exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} is VALID [2020-07-29 01:06:51,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#(exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} assume true; {1462#(exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} is VALID [2020-07-29 01:06:51,096 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#(exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} {1454#true} #457#return; {1462#(exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} is VALID [2020-07-29 01:06:51,097 INFO L263 TraceCheckUtils]: 4: Hoare triple {1462#(exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} call main(); {1472#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (= |#valid| |old(#valid)|))} is VALID [2020-07-29 01:06:51,098 INFO L263 TraceCheckUtils]: 5: Hoare triple {1472#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (= |#valid| |old(#valid)|))} call entry_point(); {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,099 INFO L263 TraceCheckUtils]: 6: Hoare triple {1476#(= |#valid| |old(#valid)|)} call alloc_8(); {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,100 INFO L263 TraceCheckUtils]: 7: Hoare triple {1476#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,100 INFO L280 TraceCheckUtils]: 8: Hoare triple {1476#(= |#valid| |old(#valid)|)} ~size := #in~size; {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,101 INFO L280 TraceCheckUtils]: 9: Hoare triple {1476#(= |#valid| |old(#valid)|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {1489#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:06:51,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {1489#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} assume true; {1489#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:06:51,107 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1489#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} {1476#(= |#valid| |old(#valid)|)} #401#return; {1496#(and (= |#valid| (store |old(#valid)| |alloc_8_#t~ret38.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_8_#t~ret38.base|) (_ bv0 1)))} is VALID [2020-07-29 01:06:51,111 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#(and (= |#valid| (store |old(#valid)| |alloc_8_#t~ret38.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_8_#t~ret38.base|) (_ bv0 1)))} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1500#(and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))} is VALID [2020-07-29 01:06:51,114 INFO L280 TraceCheckUtils]: 13: Hoare triple {1500#(and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))} assume true; {1500#(and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))} is VALID [2020-07-29 01:06:51,115 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1500#(and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))} {1476#(= |#valid| |old(#valid)|)} #445#return; {1500#(and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))} is VALID [2020-07-29 01:06:51,116 INFO L263 TraceCheckUtils]: 15: Hoare triple {1500#(and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))} call free_8(); {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,116 INFO L280 TraceCheckUtils]: 16: Hoare triple {1476#(= |#valid| |old(#valid)|)} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,117 INFO L280 TraceCheckUtils]: 17: Hoare triple {1476#(= |#valid| |old(#valid)|)} assume 0bv32 == ~a8~0.offset; {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,118 INFO L280 TraceCheckUtils]: 18: Hoare triple {1476#(= |#valid| |old(#valid)|)} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {1476#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:06:51,119 INFO L280 TraceCheckUtils]: 19: Hoare triple {1476#(= |#valid| |old(#valid)|)} assume 0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base];call ULTIMATE.dealloc(~a8~0.base, ~a8~0.offset); {1522#(= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1)))} is VALID [2020-07-29 01:06:51,119 INFO L280 TraceCheckUtils]: 20: Hoare triple {1522#(= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1)))} assume true; {1522#(= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1)))} is VALID [2020-07-29 01:06:51,121 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1522#(= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1)))} {1500#(and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))} #447#return; {1529#(exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base))))} is VALID [2020-07-29 01:06:51,122 INFO L280 TraceCheckUtils]: 22: Hoare triple {1529#(exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base))))} ~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1529#(exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base))))} is VALID [2020-07-29 01:06:51,123 INFO L280 TraceCheckUtils]: 23: Hoare triple {1529#(exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base))))} assume true; {1529#(exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base))))} is VALID [2020-07-29 01:06:51,124 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1529#(exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base))))} {1472#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (= |#valid| |old(#valid)|))} #419#return; {1539#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))))} is VALID [2020-07-29 01:06:51,125 INFO L280 TraceCheckUtils]: 25: Hoare triple {1539#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (exists ((~a8~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| ~a8~0.base (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| ~a8~0.base)))))} assume !(#valid == old(#valid)); {1455#false} is VALID [2020-07-29 01:06:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:06:51,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:07:03,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |c_old(#valid)| c_~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= |c_#valid| v_prenex_1))))) is different from false [2020-07-29 01:07:03,907 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_1], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:07:03,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |c_old(#valid)| c_~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |c_#valid| c_~a8~0.base (_ bv0 1))))) is different from false [2020-07-29 01:07:03,927 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |c_old(#valid)| c_~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |c_#valid| c_~a8~0.base (_ bv0 1))))) is different from true [2020-07-29 01:07:03,970 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_1], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:07:04,036 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_1], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:07:04,086 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_1], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2020-07-29 01:07:06,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~a8~0.base_85 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_77)) (not (= (store |c_old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= (store |c_#valid| v_~a8~0.base_85 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (not (= (select |c_#valid| v_~a8~0.base_85) (_ bv0 1))))) is different from false [2020-07-29 01:07:06,308 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:07:06,332 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:07:06,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| c_~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |c_old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))))) is different from false [2020-07-29 01:07:06,369 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| c_~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |c_old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))))) is different from true [2020-07-29 01:07:06,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:07:06,435 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:07:06,472 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:07:06,491 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:07:06,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_alloc_8_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |c_old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))))) is different from false [2020-07-29 01:07:06,623 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 01:07:06,662 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2020-07-29 01:07:06,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_alloc_8_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_alloc_8_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |c_old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= (store |c_#valid| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) is different from false [2020-07-29 01:07:06,690 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_alloc_8_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_alloc_8_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |c_old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= (store |c_#valid| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) is different from true [2020-07-29 01:07:06,778 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-07-29 01:07:06,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2020-07-29 01:07:06,858 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:07:06,896 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:07:07,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |c_old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |c_old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) is different from false [2020-07-29 01:07:07,057 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |c_old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |c_old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) is different from true [2020-07-29 01:07:07,122 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:07:07,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-07-29 01:07:07,183 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:07:07,222 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:07:09,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:07:09,419 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-07-29 01:07:09,452 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:07:09,488 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:07:09,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |c_old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |c_old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_55|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1))))) is different from false [2020-07-29 01:07:09,570 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |c_old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |c_old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_55|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1))))) is different from true [2020-07-29 01:07:09,639 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:07:09,678 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-07-29 01:07:09,710 INFO L440 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_6], 5=[v_prenex_5]} [2020-07-29 01:07:09,749 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_15|, |v_old(#valid)_BEFORE_CALL_16|]} [2020-07-29 01:07:09,798 INFO L280 TraceCheckUtils]: 25: Hoare triple {1476#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1455#false} is VALID [2020-07-29 01:07:09,803 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1550#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} {1546#(forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= (store |#valid| v_~a8~0.base_77 (_ bv0 1)) |old(#valid)|) (not (= (_ bv0 1) (select |#valid| v_~a8~0.base_77)))))} #419#return; {1476#(= |#valid| |old(#valid)|)} is UNKNOWN [2020-07-29 01:07:09,804 INFO L280 TraceCheckUtils]: 23: Hoare triple {1550#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} assume true; {1550#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} is VALID [2020-07-29 01:07:09,805 INFO L280 TraceCheckUtils]: 22: Hoare triple {1550#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} ~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1550#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} is VALID [2020-07-29 01:07:09,812 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1564#(forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= |#valid| v_prenex_1)))))} {1560#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| ~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} #447#return; {1550#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |#valid| |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} is UNKNOWN [2020-07-29 01:07:09,813 INFO L280 TraceCheckUtils]: 20: Hoare triple {1564#(forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= |#valid| v_prenex_1)))))} assume true; {1564#(forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= |#valid| v_prenex_1)))))} is VALID [2020-07-29 01:07:09,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} assume 0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base];call ULTIMATE.dealloc(~a8~0.base, ~a8~0.offset); {1564#(forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= |#valid| v_prenex_1)))))} is UNKNOWN [2020-07-29 01:07:09,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} is VALID [2020-07-29 01:07:09,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} assume 0bv32 == ~a8~0.offset; {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} is VALID [2020-07-29 01:07:09,823 INFO L280 TraceCheckUtils]: 16: Hoare triple {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} is VALID [2020-07-29 01:07:09,838 INFO L263 TraceCheckUtils]: 15: Hoare triple {1560#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| ~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} call free_8(); {1571#(forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |old(#valid)| ~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |#valid| ~a8~0.base (_ bv0 1)))))} is UNKNOWN [2020-07-29 01:07:09,850 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1588#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| ~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)))))))))} {1584#(forall ((v_~a8~0.base_85 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= (store |#valid| v_~a8~0.base_85 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (not (= (select |#valid| v_~a8~0.base_85) (_ bv0 1)))))} #445#return; {1560#(forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| ~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))))))} is UNKNOWN [2020-07-29 01:07:09,869 INFO L280 TraceCheckUtils]: 13: Hoare triple {1588#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| ~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)))))))))} assume true; {1588#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| ~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)))))))))} is VALID [2020-07-29 01:07:09,889 INFO L280 TraceCheckUtils]: 12: Hoare triple {1595#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |alloc_8_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)))))))))} ~a8~0.base, ~a8~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1588#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| ~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)))))))))} is UNKNOWN [2020-07-29 01:07:09,953 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1603#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} {1599#(forall ((|v_alloc_8_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |#valid| |v_alloc_8_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= (store |#valid| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))} #401#return; {1595#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |#valid| |alloc_8_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)))))))))} is UNKNOWN [2020-07-29 01:07:09,954 INFO L280 TraceCheckUtils]: 10: Hoare triple {1603#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} assume true; {1603#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} is VALID [2020-07-29 01:07:10,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {1610#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {1603#(forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))))} is UNKNOWN [2020-07-29 01:07:10,010 INFO L280 TraceCheckUtils]: 8: Hoare triple {1610#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} ~size := #in~size; {1610#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} is VALID [2020-07-29 01:07:10,054 INFO L263 TraceCheckUtils]: 7: Hoare triple {1599#(forall ((|v_alloc_8_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |#valid| |v_alloc_8_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= (store |#valid| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1610#(forall ((|v_ldv_malloc_#res.base_55| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_55|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |#valid| |v_ldv_malloc_#res.base_55| (_ bv0 1)))))} is UNKNOWN [2020-07-29 01:07:10,062 INFO L263 TraceCheckUtils]: 6: Hoare triple {1584#(forall ((v_~a8~0.base_85 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= (store |#valid| v_~a8~0.base_85 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (not (= (select |#valid| v_~a8~0.base_85) (_ bv0 1)))))} call alloc_8(); {1599#(forall ((|v_alloc_8_#t~ret38.base_66| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (not (= (_ bv0 1) (select |#valid| |v_alloc_8_#t~ret38.base_66|))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))) (= (store |#valid| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))} is UNKNOWN [2020-07-29 01:07:10,069 INFO L263 TraceCheckUtils]: 5: Hoare triple {1546#(forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= (store |#valid| v_~a8~0.base_77 (_ bv0 1)) |old(#valid)|) (not (= (_ bv0 1) (select |#valid| v_~a8~0.base_77)))))} call entry_point(); {1584#(forall ((v_~a8~0.base_85 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| v_~a8~0.base_77)) (not (= (store |old(#valid)| v_~a8~0.base_77 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= (store |#valid| v_~a8~0.base_85 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (not (= (select |#valid| v_~a8~0.base_85) (_ bv0 1)))))} is VALID [2020-07-29 01:07:10,070 INFO L263 TraceCheckUtils]: 4: Hoare triple {1454#true} call main(); {1546#(forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= (store |#valid| v_~a8~0.base_77 (_ bv0 1)) |old(#valid)|) (not (= (_ bv0 1) (select |#valid| v_~a8~0.base_77)))))} is VALID [2020-07-29 01:07:10,070 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #457#return; {1454#true} is VALID [2020-07-29 01:07:10,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2020-07-29 01:07:10,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {1454#true} is VALID [2020-07-29 01:07:10,071 INFO L263 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2020-07-29 01:07:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:07:10,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397829399] [2020-07-29 01:07:10,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:07:10,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 13] imperfect sequences [] total 21 [2020-07-29 01:07:10,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167648486] [2020-07-29 01:07:10,082 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-07-29 01:07:10,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:07:10,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-29 01:07:10,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 32 inductive. 0 not inductive. 19 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:10,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-29 01:07:10,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:07:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-29 01:07:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=125, Unknown=31, NotChecked=248, Total=462 [2020-07-29 01:07:10,461 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 22 states. [2020-07-29 01:07:52,677 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |c_old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |c_old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2020-07-29 01:07:52,684 WARN L860 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_8_#t~ret38.base_66| (_ BitVec 32))) (and (not (= v_prenex_6 (store |c_old(#valid)| |v_alloc_8_#t~ret38.base_66| (_ bv0 1)))) (= (select |c_old(#valid)| |v_alloc_8_#t~ret38.base_66|) (_ bv0 1)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_7) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_7 (_ bv0 1))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1))) (exists ((v_prenex_10 (_ BitVec 32))) (and (= (select v_prenex_5 v_prenex_10) (_ bv0 1)) (not (= v_prenex_8 (store v_prenex_5 v_prenex_10 (_ bv0 1)))))) (not (= (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9) (_ bv0 1))))))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85 (_ bv0 1)))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (select |v_old(#valid)_BEFORE_CALL_16| v_~a8~0.base_85) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2020-07-29 01:07:54,960 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_alloc_8_#t~ret38.base| (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_alloc_8_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |c_old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))))) (= (select |c_old(#valid)| |c_alloc_8_#t~ret38.base|) (_ bv0 1))) is different from false [2020-07-29 01:07:55,149 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| c_~a8~0.base (_ bv0 1))) (exists ((v_~a8~0.base_77 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_15| v_~a8~0.base_77 (_ bv0 1)))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_~a8~0.base_85 (_ BitVec 32))) (and (not (= v_prenex_3 (store |c_old(#valid)| v_~a8~0.base_85 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| v_~a8~0.base_85)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))))))) (= |c_#valid| (store |c_old(#valid)| c_~a8~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| c_~a8~0.base))) is different from false [2020-07-29 01:08:03,697 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |c_old(#valid)| c_~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |c_#valid| c_~a8~0.base (_ bv0 1))))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |c_old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (= |c_#valid| |c_old(#valid)|)) is different from false [2020-07-29 01:08:03,843 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |c_old(#valid)| c_~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= v_prenex_1 (store |c_#valid| c_~a8~0.base (_ bv0 1))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2020-07-29 01:08:04,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_13| (store |c_old(#valid)| c_~a8~0.base (_ bv0 1)))) (forall ((v_~a8~0.base_77 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_~a8~0.base_77) (_ bv0 1))))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1)))) (= |c_#valid| v_prenex_1))))) (= |c_#valid| (store |c_old(#valid)| c_~a8~0.base (_ bv0 1)))) is different from false [2020-07-29 01:08:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:08:04,748 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2020-07-29 01:08:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-29 01:08:04,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-07-29 01:08:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:08:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:08:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-07-29 01:08:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:08:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-07-29 01:08:04,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 26 transitions. [2020-07-29 01:08:05,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 12 inductive. 0 not inductive. 14 times theorem prover too weak to decide inductivity. [2020-07-29 01:08:05,360 INFO L225 Difference]: With dead ends: 26 [2020-07-29 01:08:05,360 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:08:05,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=92, Invalid=170, Unknown=66, NotChecked=602, Total=930 [2020-07-29 01:08:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:08:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:08:05,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:08:05,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:08:05,362 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:08:05,363 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:08:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:08:05,363 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:08:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:08:05,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:08:05,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:08:05,363 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:08:05,363 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:08:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:08:05,364 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:08:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:08:05,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:08:05,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:08:05,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:08:05,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:08:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:08:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:08:05,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-29 01:08:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:08:05,365 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:08:05,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-29 01:08:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:08:05,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:08:05,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-29 01:08:05,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:08:05 BoogieIcfgContainer [2020-07-29 01:08:05,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:08:05,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:08:05,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:08:05,576 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:08:05,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:38" (3/4) ... [2020-07-29 01:08:05,580 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:08:05,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2020-07-29 01:08:05,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:08:05,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2020-07-29 01:08:05,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_8 [2020-07-29 01:08:05,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-07-29 01:08:05,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2020-07-29 01:08:05,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:08:05,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:08:05,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2020-07-29 01:08:05,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2020-07-29 01:08:05,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2020-07-29 01:08:05,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2020-07-29 01:08:05,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2020-07-29 01:08:05,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_8 [2020-07-29 01:08:05,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2020-07-29 01:08:05,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2020-07-29 01:08:05,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2020-07-29 01:08:05,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-07-29 01:08:05,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2020-07-29 01:08:05,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2020-07-29 01:08:05,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2020-07-29 01:08:05,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2020-07-29 01:08:05,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2020-07-29 01:08:05,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2020-07-29 01:08:05,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2020-07-29 01:08:05,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2020-07-29 01:08:05,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2020-07-29 01:08:05,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-07-29 01:08:05,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2020-07-29 01:08:05,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2020-07-29 01:08:05,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2020-07-29 01:08:05,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-07-29 01:08:05,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2020-07-29 01:08:05,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2020-07-29 01:08:05,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2020-07-29 01:08:05,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-07-29 01:08:05,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2020-07-29 01:08:05,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2020-07-29 01:08:05,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2020-07-29 01:08:05,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2020-07-29 01:08:05,596 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2020-07-29 01:08:05,596 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2020-07-29 01:08:05,596 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2020-07-29 01:08:05,596 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:08:05,596 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2020-07-29 01:08:05,596 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2020-07-29 01:08:05,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2020-07-29 01:08:05,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2020-07-29 01:08:05,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2020-07-29 01:08:05,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-07-29 01:08:05,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:08:05,608 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:08:05,608 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:08:05,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:08:05,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:08:05,666 INFO L168 Benchmark]: Toolchain (without parser) took 90056.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 950.8 MB in the beginning and 1.0 GB in the end (delta: -60.6 MB). Peak memory consumption was 287.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:08:05,666 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:08:05,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:08:05,667 INFO L168 Benchmark]: Boogie Preprocessor took 157.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:08:05,667 INFO L168 Benchmark]: RCFGBuilder took 1922.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.8 MB in the end (delta: 170.6 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:08:05,668 INFO L168 Benchmark]: TraceAbstraction took 86972.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 921.8 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:08:05,668 INFO L168 Benchmark]: Witness Printer took 88.13 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:08:05,670 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 907.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1922.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.8 MB in the end (delta: 170.6 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86972.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 921.8 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. * Witness Printer took 88.13 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 74 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 343 locations, 74 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 86.8s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 56.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 152 SDtfs, 78 SDslu, 241 SDs, 0 SdLazy, 183 SolverSat, 28 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 27.2s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 240 ConstructedInterpolants, 28 QuantifiedInterpolants, 42706 SizeOfPredicates, 10 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 proved your program to be correct! Received shutdown request...