./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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_test4-2.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 0775aa74e42740d69127a88680deb3bae2149559 ............................................................................................................................. 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 -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_test4-2.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 0775aa74e42740d69127a88680deb3bae2149559 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 14:40:56,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 14:40:56,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 14:40:56,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 14:40:56,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 14:40:56,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 14:40:56,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 14:40:56,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 14:40:56,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 14:40:56,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 14:40:56,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 14:40:56,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 14:40:56,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 14:40:56,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 14:40:56,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 14:40:56,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 14:40:56,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 14:40:56,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 14:40:56,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 14:40:56,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 14:40:56,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 14:40:56,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 14:40:56,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 14:40:56,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 14:40:56,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 14:40:56,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 14:40:56,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 14:40:56,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 14:40:56,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 14:40:56,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 14:40:56,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 14:40:56,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 14:40:56,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 14:40:56,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 14:40:56,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 14:40:56,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 14:40:56,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 14:40:56,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 14:40:56,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 14:40:56,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 14:40:56,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 14:40:56,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 14:40:56,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 14:40:56,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 14:40:56,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 14:40:56,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 14:40:56,434 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 14:40:56,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 14:40:56,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 14:40:56,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 14:40:56,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 14:40:56,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 14:40:56,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 14:40:56,436 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 14:40:56,436 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 14:40:56,436 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 14:40:56,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 14:40:56,437 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 14:40:56,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 14:40:56,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 14:40:56,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 14:40:56,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 14:40:56,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 14:40:56,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 14:40:56,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:40:56,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 14:40:56,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 14:40:56,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 14:40:56,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 14:40:56,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 14:40:56,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 -> 0775aa74e42740d69127a88680deb3bae2149559 [2019-11-28 14:40:56,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 14:40:56,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 14:40:56,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 14:40:56,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 14:40:56,769 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 14:40:56,771 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-11-28 14:40:56,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9446c23/8c6704b025694faa9bc8f6e531dba34d/FLAGee2459eb1 [2019-11-28 14:40:57,376 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 14:40:57,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-11-28 14:40:57,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9446c23/8c6704b025694faa9bc8f6e531dba34d/FLAGee2459eb1 [2019-11-28 14:40:57,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9446c23/8c6704b025694faa9bc8f6e531dba34d [2019-11-28 14:40:57,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 14:40:57,661 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 14:40:57,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 14:40:57,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 14:40:57,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 14:40:57,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:40:57" (1/1) ... [2019-11-28 14:40:57,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362d3ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:57, skipping insertion in model container [2019-11-28 14:40:57,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:40:57" (1/1) ... [2019-11-28 14:40:57,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 14:40:57,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:40:58,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:40:58,271 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) [2019-11-28 14:40:58,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@cdf90ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:58, skipping insertion in model container [2019-11-28 14:40:58,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 14:40:58,273 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 14:40:58,276 INFO L168 Benchmark]: Toolchain (without parser) took 613.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 14:40:58,277 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:40:58,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 14:40:58,282 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 610.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 15.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-f470102 [2019-11-28 14:40:59,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 14:40:59,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 14:40:59,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 14:40:59,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 14:40:59,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 14:40:59,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 14:40:59,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 14:40:59,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 14:40:59,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 14:40:59,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 14:40:59,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 14:40:59,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 14:40:59,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 14:40:59,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 14:40:59,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 14:40:59,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 14:40:59,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 14:40:59,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 14:40:59,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 14:40:59,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 14:40:59,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 14:40:59,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 14:40:59,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 14:40:59,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 14:40:59,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 14:40:59,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 14:40:59,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 14:40:59,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 14:40:59,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 14:40:59,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 14:40:59,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 14:40:59,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 14:40:59,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 14:40:59,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 14:40:59,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 14:40:59,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 14:40:59,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 14:40:59,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 14:40:59,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 14:40:59,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 14:40:59,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 14:41:00,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 14:41:00,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 14:41:00,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 14:41:00,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 14:41:00,025 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 14:41:00,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 14:41:00,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 14:41:00,026 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 14:41:00,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 14:41:00,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 14:41:00,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 14:41:00,027 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 14:41:00,027 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 14:41:00,027 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 14:41:00,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 14:41:00,027 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 14:41:00,028 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 14:41:00,028 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 14:41:00,028 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 14:41:00,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 14:41:00,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 14:41:00,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 14:41:00,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 14:41:00,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 14:41:00,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:41:00,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 14:41:00,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 14:41:00,030 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 14:41:00,031 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 14:41:00,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 14:41:00,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 14:41:00,031 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 -> 0775aa74e42740d69127a88680deb3bae2149559 [2019-11-28 14:41:00,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 14:41:00,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 14:41:00,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 14:41:00,377 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 14:41:00,378 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 14:41:00,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-11-28 14:41:00,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d0e1a1a/f8faf89d4dd744a08ce6f5d34925e727/FLAG0066a3482 [2019-11-28 14:41:00,998 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 14:41:00,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-11-28 14:41:01,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d0e1a1a/f8faf89d4dd744a08ce6f5d34925e727/FLAG0066a3482 [2019-11-28 14:41:01,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d0e1a1a/f8faf89d4dd744a08ce6f5d34925e727 [2019-11-28 14:41:01,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 14:41:01,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 14:41:01,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 14:41:01,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 14:41:01,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 14:41:01,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:41:01" (1/1) ... [2019-11-28 14:41:01,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe0bc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:01, skipping insertion in model container [2019-11-28 14:41:01,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:41:01" (1/1) ... [2019-11-28 14:41:01,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 14:41:01,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:41:01,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:41:01,936 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 14:41:01,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:41:02,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:41:02,075 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 14:41:02,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:41:02,239 INFO L208 MainTranslator]: Completed translation [2019-11-28 14:41:02,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02 WrapperNode [2019-11-28 14:41:02,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 14:41:02,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 14:41:02,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 14:41:02,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 14:41:02,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (1/1) ... [2019-11-28 14:41:02,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (1/1) ... [2019-11-28 14:41:02,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (1/1) ... [2019-11-28 14:41:02,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (1/1) ... [2019-11-28 14:41:02,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (1/1) ... [2019-11-28 14:41:02,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (1/1) ... [2019-11-28 14:41:02,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (1/1) ... [2019-11-28 14:41:02,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 14:41:02,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 14:41:02,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 14:41:02,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 14:41:02,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (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 [2019-11-28 14:41:02,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 14:41:02,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 14:41:02,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 14:41:02,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:41:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 14:41:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 14:41:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 14:41:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 14:41:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 14:41:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-28 14:41:02,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-28 14:41:02,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-28 14:41:02,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-28 14:41:02,394 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-28 14:41:02,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-28 14:41:02,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-28 14:41:02,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-28 14:41:02,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-28 14:41:02,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-28 14:41:02,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-28 14:41:02,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-28 14:41:02,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-28 14:41:02,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-28 14:41:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-28 14:41:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-28 14:41:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-28 14:41:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-28 14:41:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-28 14:41:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-28 14:41:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-28 14:41:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-28 14:41:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-28 14:41:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-28 14:41:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-28 14:41:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-28 14:41:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-28 14:41:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-28 14:41:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-28 14:41:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-28 14:41:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-28 14:41:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 14:41:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 14:41:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-28 14:41:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 14:41:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-28 14:41:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 14:41:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-28 14:41:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 14:41:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 14:41:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 14:41:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 14:41:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 14:41:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 14:41:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 14:41:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 14:41:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 14:41:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 14:41:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 14:41:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 14:41:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 14:41:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 14:41:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 14:41:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 14:41:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 14:41:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 14:41:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 14:41:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 14:41:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 14:41:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 14:41:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 14:41:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 14:41:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 14:41:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 14:41:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 14:41:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 14:41:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 14:41:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 14:41:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 14:41:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 14:41:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 14:41:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 14:41:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 14:41:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 14:41:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 14:41:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 14:41:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 14:41:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 14:41:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 14:41:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 14:41:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 14:41:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 14:41:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 14:41:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 14:41:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 14:41:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 14:41:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 14:41:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 14:41:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 14:41:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 14:41:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 14:41:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 14:41:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 14:41:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 14:41:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 14:41:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 14:41:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 14:41:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 14:41:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 14:41:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 14:41:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 14:41:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 14:41:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 14:41:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-28 14:41:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 14:41:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-28 14:41:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 14:41:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-28 14:41:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-28 14:41:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-28 14:41:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 14:41:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-28 14:41:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-28 14:41:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-28 14:41:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-28 14:41:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-28 14:41:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 14:41:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 14:41:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-28 14:41:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-28 14:41:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 14:41:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-28 14:41:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-28 14:41:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-28 14:41:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-28 14:41:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-28 14:41:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 14:41:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 14:41:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-28 14:41:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 14:41:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 14:41:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 14:41:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 14:41:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 14:41:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:41:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-28 14:41:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-28 14:41:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-28 14:41:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-28 14:41:03,084 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 14:41:03,564 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 14:41:03,954 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 14:41:03,954 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 14:41:03,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:41:03 BoogieIcfgContainer [2019-11-28 14:41:03,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 14:41:03,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 14:41:03,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 14:41:03,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 14:41:03,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:41:01" (1/3) ... [2019-11-28 14:41:03,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb47077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:41:03, skipping insertion in model container [2019-11-28 14:41:03,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:41:02" (2/3) ... [2019-11-28 14:41:03,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb47077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:41:03, skipping insertion in model container [2019-11-28 14:41:03,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:41:03" (3/3) ... [2019-11-28 14:41:03,966 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test4-2.i [2019-11-28 14:41:03,978 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 14:41:03,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 77 error locations. [2019-11-28 14:41:04,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2019-11-28 14:41:04,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 14:41:04,023 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 14:41:04,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 14:41:04,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 14:41:04,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 14:41:04,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 14:41:04,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 14:41:04,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 14:41:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-11-28 14:41:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 14:41:04,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:04,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:04,056 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2025190552, now seen corresponding path program 1 times [2019-11-28 14:41:04,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:04,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140890931] [2019-11-28 14:41:04,076 INFO L94 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 [2019-11-28 14:41:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:04,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:41:04,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:04,411 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:04,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140890931] [2019-11-28 14:41:04,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:41:04,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 14:41:04,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154323538] [2019-11-28 14:41:04,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:41:04,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:41:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:04,652 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 5 states. [2019-11-28 14:41:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:04,739 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-11-28 14:41:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:41:04,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 14:41:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:04,753 INFO L225 Difference]: With dead ends: 53 [2019-11-28 14:41:04,754 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 14:41:04,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 14:41:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-11-28 14:41:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 14:41:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-28 14:41:04,855 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 16 [2019-11-28 14:41:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:04,856 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-28 14:41:04,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:41:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-28 14:41:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 14:41:04,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:04,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:05,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 14:41:05,067 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash -282380217, now seen corresponding path program 1 times [2019-11-28 14:41:05,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:05,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978361179] [2019-11-28 14:41:05,069 INFO L94 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 [2019-11-28 14:41:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:05,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 14:41:05,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:05,246 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:05,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978361179] [2019-11-28 14:41:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:41:05,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 14:41:05,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669398105] [2019-11-28 14:41:05,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 14:41:05,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:05,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 14:41:05,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 14:41:05,318 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2019-11-28 14:41:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:05,385 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-11-28 14:41:05,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 14:41:05,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 14:41:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:05,389 INFO L225 Difference]: With dead ends: 46 [2019-11-28 14:41:05,389 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 14:41:05,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 14:41:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 14:41:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-28 14:41:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 14:41:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-11-28 14:41:05,402 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 16 [2019-11-28 14:41:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:05,403 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-11-28 14:41:05,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 14:41:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-11-28 14:41:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 14:41:05,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:05,406 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:05,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 14:41:05,628 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2034469669, now seen corresponding path program 1 times [2019-11-28 14:41:05,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:05,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503558721] [2019-11-28 14:41:05,631 INFO L94 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 [2019-11-28 14:41:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:05,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:41:05,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:05,898 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:05,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503558721] [2019-11-28 14:41:05,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:41:05,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 14:41:05,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685818890] [2019-11-28 14:41:05,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:41:05,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:41:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:05,940 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2019-11-28 14:41:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:05,956 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 14:41:05,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:41:05,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 14:41:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:05,958 INFO L225 Difference]: With dead ends: 30 [2019-11-28 14:41:05,958 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 14:41:05,958 INFO L630 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 [2019-11-28 14:41:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 14:41:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 14:41:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 14:41:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-28 14:41:05,968 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-11-28 14:41:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:05,969 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-28 14:41:05,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:41:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-28 14:41:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 14:41:05,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:05,971 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:06,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 14:41:06,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:06,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1355950095, now seen corresponding path program 1 times [2019-11-28 14:41:06,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:06,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827183399] [2019-11-28 14:41:06,185 INFO L94 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 [2019-11-28 14:41:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:06,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 14:41:06,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:06,500 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:06,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827183399] [2019-11-28 14:41:06,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:41:06,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-28 14:41:06,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358569281] [2019-11-28 14:41:06,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:41:06,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:06,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:41:06,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:41:06,646 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-11-28 14:41:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:06,941 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-28 14:41:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 14:41:06,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-28 14:41:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:06,943 INFO L225 Difference]: With dead ends: 50 [2019-11-28 14:41:06,943 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 14:41:06,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:41:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 14:41:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2019-11-28 14:41:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 14:41:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 14:41:06,949 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2019-11-28 14:41:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:06,949 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 14:41:06,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:41:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 14:41:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 14:41:06,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:06,950 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:07,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 14:41:07,161 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash -915219619, now seen corresponding path program 1 times [2019-11-28 14:41:07,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:07,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053812167] [2019-11-28 14:41:07,162 INFO L94 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 [2019-11-28 14:41:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:07,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:41:07,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:07,320 INFO L377 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 [2019-11-28 14:41:07,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:41:07,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:41:07,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:41:07,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:41:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:07,349 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:07,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053812167] [2019-11-28 14:41:07,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:41:07,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 14:41:07,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728514712] [2019-11-28 14:41:07,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:41:07,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:07,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:41:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:07,403 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2019-11-28 14:41:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:07,464 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-28 14:41:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:41:07,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 14:41:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:07,466 INFO L225 Difference]: With dead ends: 35 [2019-11-28 14:41:07,466 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 14:41:07,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 14:41:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 14:41:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 14:41:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-11-28 14:41:07,477 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 22 [2019-11-28 14:41:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:07,477 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-11-28 14:41:07,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:41:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-11-28 14:41:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 14:41:07,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:07,479 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:07,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 14:41:07,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -27715938, now seen corresponding path program 1 times [2019-11-28 14:41:07,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:07,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033150772] [2019-11-28 14:41:07,682 INFO L94 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 [2019-11-28 14:41:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:07,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 14:41:07,790 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:07,807 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:07,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033150772] [2019-11-28 14:41:07,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:41:07,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 14:41:07,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373775212] [2019-11-28 14:41:07,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:41:07,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:41:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:07,833 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2019-11-28 14:41:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:07,859 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-28 14:41:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:41:07,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 14:41:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:07,863 INFO L225 Difference]: With dead ends: 42 [2019-11-28 14:41:07,863 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 14:41:07,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 14:41:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-11-28 14:41:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 14:41:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-11-28 14:41:07,872 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2019-11-28 14:41:07,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:07,873 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-28 14:41:07,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:41:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-11-28 14:41:07,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 14:41:07,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:07,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:08,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 14:41:08,085 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1692963281, now seen corresponding path program 1 times [2019-11-28 14:41:08,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:08,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834732226] [2019-11-28 14:41:08,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 14:41:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:08,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:41:08,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:08,230 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:08,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834732226] [2019-11-28 14:41:08,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:41:08,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 14:41:08,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655278553] [2019-11-28 14:41:08,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:41:08,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:41:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:08,274 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 5 states. [2019-11-28 14:41:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:08,289 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 14:41:08,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:41:08,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 14:41:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:08,291 INFO L225 Difference]: With dead ends: 27 [2019-11-28 14:41:08,291 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 14:41:08,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 14:41:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 14:41:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 14:41:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 14:41:08,297 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2019-11-28 14:41:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:08,297 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 14:41:08,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:41:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 14:41:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 14:41:08,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:08,298 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:08,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 14:41:08,501 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 942254559, now seen corresponding path program 1 times [2019-11-28 14:41:08,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:08,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454624371] [2019-11-28 14:41:08,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 14:41:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:08,631 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 14:41:08,632 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:08,749 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:08,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454624371] [2019-11-28 14:41:08,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:41:08,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-11-28 14:41:08,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137394561] [2019-11-28 14:41:08,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:41:08,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:08,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:41:08,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:41:08,858 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2019-11-28 14:41:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:09,086 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-11-28 14:41:09,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 14:41:09,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-28 14:41:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:09,089 INFO L225 Difference]: With dead ends: 55 [2019-11-28 14:41:09,089 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 14:41:09,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 14:41:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 14:41:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-11-28 14:41:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 14:41:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-28 14:41:09,096 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2019-11-28 14:41:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:09,096 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-28 14:41:09,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:41:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-28 14:41:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 14:41:09,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:09,097 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:09,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 14:41:09,299 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:09,299 INFO L82 PathProgramCache]: Analyzing trace with hash -854879341, now seen corresponding path program 1 times [2019-11-28 14:41:09,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:09,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632275105] [2019-11-28 14:41:09,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 14:41:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:09,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 14:41:09,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:09,455 INFO L377 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 [2019-11-28 14:41:09,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:41:09,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:41:09,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:41:09,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:41:09,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:41:09,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-28 14:41:09,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:41:09,558 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-28 14:41:09,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:41:09,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-28 14:41:09,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-11-28 14:41:09,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:41:09,628 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-28 14:41:09,629 INFO L534 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. [2019-11-28 14:41:09,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-28 14:41:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:09,663 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:09,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632275105] [2019-11-28 14:41:09,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 14:41:09,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2019-11-28 14:41:09,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645296926] [2019-11-28 14:41:09,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:41:09,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:09,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:41:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-28 14:41:09,931 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 10 states. [2019-11-28 14:41:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:12,158 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-28 14:41:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 14:41:12,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-28 14:41:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:12,159 INFO L225 Difference]: With dead ends: 50 [2019-11-28 14:41:12,159 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 14:41:12,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-28 14:41:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 14:41:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-11-28 14:41:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 14:41:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 14:41:12,164 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2019-11-28 14:41:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:12,165 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 14:41:12,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:41:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 14:41:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 14:41:12,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:12,166 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:12,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 14:41:12,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:12,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1051392846, now seen corresponding path program 1 times [2019-11-28 14:41:12,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:12,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251014609] [2019-11-28 14:41:12,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 14:41:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:12,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 14:41:12,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:12,517 INFO L377 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:41:12,517 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:41:12,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:41:12,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:41:12,523 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-11-28 14:41:12,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-28 14:41:12,627 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:41:12,639 INFO L614 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-11-28 14:41:12,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:41:12,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:13 [2019-11-28 14:41:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:12,658 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:41:12,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251014609] [2019-11-28 14:41:12,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:41:12,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-28 14:41:12,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341863929] [2019-11-28 14:41:12,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 14:41:12,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 14:41:12,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-28 14:41:12,864 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 15 states. [2019-11-28 14:41:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:13,476 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-11-28 14:41:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 14:41:13,477 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-11-28 14:41:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:13,478 INFO L225 Difference]: With dead ends: 53 [2019-11-28 14:41:13,478 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 14:41:13,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-11-28 14:41:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 14:41:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2019-11-28 14:41:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 14:41:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 14:41:13,496 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2019-11-28 14:41:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:13,496 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 14:41:13,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 14:41:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 14:41:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 14:41:13,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:13,499 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:13,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 14:41:13,702 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash 498430356, now seen corresponding path program 2 times [2019-11-28 14:41:13,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:13,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638061469] [2019-11-28 14:41:13,703 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-28 14:41:13,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 14:41:13,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 14:41:13,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 14:41:13,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:13,844 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:41:13,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638061469] [2019-11-28 14:41:13,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:41:13,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 14:41:13,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621303245] [2019-11-28 14:41:13,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:41:13,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:41:13,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:13,868 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-11-28 14:41:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:41:13,890 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-28 14:41:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:41:13,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 14:41:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:41:13,892 INFO L225 Difference]: With dead ends: 43 [2019-11-28 14:41:13,892 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 14:41:13,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:41:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 14:41:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-11-28 14:41:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 14:41:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-28 14:41:13,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 25 [2019-11-28 14:41:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:41:13,898 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-28 14:41:13,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:41:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-28 14:41:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 14:41:13,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:41:13,899 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:41:14,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 14:41:14,102 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:41:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:41:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1446021946, now seen corresponding path program 1 times [2019-11-28 14:41:14,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:41:14,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251366317] [2019-11-28 14:41:14,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-28 14:41:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:41:14,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 14:41:14,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:41:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 14:41:18,403 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:41:18,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (select .cse0 v_entry_point_~q~0.base_17) (_ bv0 1))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_8|))) is different from false [2019-11-28 14:41:18,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| c_entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (select .cse0 v_entry_point_~q~0.base_17) (_ bv0 1))))))) is different from false [2019-11-28 14:41:27,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_9| (Array (_ BitVec 32) (_ BitVec 1))) (v_entry_point_~p~0.base_BEFORE_CALL_10 (_ BitVec 32))) (or (exists ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (and (forall ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17))) (not (= (select |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23) (_ bv0 1))) (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) (not (= (store (store |c_old(#valid)| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret39.base_45|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1))) (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_9| v_prenex_2 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_prenex_3)) (not (= v_prenex_1 (store (store .cse1 v_prenex_3 (_ bv0 1)) v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_9| v_prenex_2) (_ bv0 1))))))))) is different from false [2019-11-28 14:41:27,560 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_9| (Array (_ BitVec 32) (_ BitVec 1))) (v_entry_point_~p~0.base_BEFORE_CALL_10 (_ BitVec 32))) (or (exists ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (and (forall ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17))) (not (= (select |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23) (_ bv0 1))) (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) (not (= (store (store |c_old(#valid)| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret39.base_45|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1))) (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_9| v_prenex_2 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_prenex_3)) (not (= v_prenex_1 (store (store .cse1 v_prenex_3 (_ bv0 1)) v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_9| v_prenex_2) (_ bv0 1))))))))) is different from true [2019-11-28 14:41:27,614 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_9| (Array (_ BitVec 32) (_ BitVec 1))) (v_entry_point_~p~0.base_BEFORE_CALL_10 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_74| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_74|) (_ bv0 1))) (exists ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (and (forall ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17))) (not (= (select |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23) (_ bv0 1))) (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) (not (= (store (store |c_old(#valid)| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret39.base_45|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_74| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1))) (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_9| v_prenex_2 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_prenex_3)) (not (= v_prenex_1 (store (store .cse1 v_prenex_3 (_ bv0 1)) v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_9| v_prenex_2) (_ bv0 1))))))))) is different from false [2019-11-28 14:41:27,626 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_9| (Array (_ BitVec 32) (_ BitVec 1))) (v_entry_point_~p~0.base_BEFORE_CALL_10 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_74| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_74|) (_ bv0 1))) (exists ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (and (forall ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17))) (not (= (select |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23) (_ bv0 1))) (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) (not (= (store (store |c_old(#valid)| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret39.base_45|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_74| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1))) (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_9| v_prenex_2 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_prenex_3)) (not (= v_prenex_1 (store (store .cse1 v_prenex_3 (_ bv0 1)) v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_9| v_prenex_2) (_ bv0 1))))))))) is different from true [2019-11-28 14:41:27,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (select .cse0 v_entry_point_~q~0.base_17) (_ bv0 1))))) (= (store (store |c_#valid| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |c_entry_point_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))) is different from false [2019-11-28 14:41:33,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:41:33,240 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-11-28 14:41:33,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))))) (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret38.base_53| (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_entry_point_#t~ret38.base_53| (_ bv1 1)))) (and (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_10| v_prenex_6 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_prenex_6))) (not (= (_ bv0 1) (select .cse1 v_prenex_7))) (= v_prenex_4 (store (store .cse1 v_prenex_7 (_ bv0 1)) v_prenex_6 (_ bv0 1)))))) (not (= v_prenex_4 (store (store .cse2 v_prenex_5 (_ bv0 1)) |v_entry_point_#t~ret38.base_53| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_53|)) (= (_ bv0 1) (select .cse2 v_prenex_5))))) (= (store (store |c_#valid| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))) is different from false [2019-11-28 14:41:33,269 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))))) (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret38.base_53| (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_entry_point_#t~ret38.base_53| (_ bv1 1)))) (and (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_10| v_prenex_6 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_prenex_6))) (not (= (_ bv0 1) (select .cse1 v_prenex_7))) (= v_prenex_4 (store (store .cse1 v_prenex_7 (_ bv0 1)) v_prenex_6 (_ bv0 1)))))) (not (= v_prenex_4 (store (store .cse2 v_prenex_5 (_ bv0 1)) |v_entry_point_#t~ret38.base_53| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_53|)) (= (_ bv0 1) (select .cse2 v_prenex_5))))) (= (store (store |c_#valid| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))) is different from true [2019-11-28 14:41:33,273 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:41:33,279 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-11-28 14:41:33,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:41:33,292 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-11-28 14:41:33,301 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32)) (|v_ldv_malloc_#res.base_98| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ldv_malloc_#res.base_98| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_ldv_malloc_#res.base_98|) (_ bv0 1))) (not (= (select .cse0 |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_entry_point_~q~0.base_17)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23)) (not (= (store (store .cse1 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))))) (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret38.base_53| (_ BitVec 32))) (let ((.cse3 (store |c_old(#valid)| |v_entry_point_#t~ret38.base_53| (_ bv1 1)))) (and (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_10| v_prenex_6 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_prenex_6))) (not (= (_ bv0 1) (select .cse2 v_prenex_7))) (= v_prenex_4 (store (store .cse2 v_prenex_7 (_ bv0 1)) v_prenex_6 (_ bv0 1)))))) (not (= v_prenex_4 (store (store .cse3 v_prenex_5 (_ bv0 1)) |v_entry_point_#t~ret38.base_53| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_53|)) (= (_ bv0 1) (select .cse3 v_prenex_5))))) (= (store (store .cse0 |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |v_ldv_malloc_#res.base_98| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) is different from true [2019-11-28 14:41:33,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:41:33,315 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-11-28 14:41:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-11-28 14:41:33,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251366317] [2019-11-28 14:41:33,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 14:41:33,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2019-11-28 14:41:33,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633334156] [2019-11-28 14:41:33,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:41:33,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:41:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:41:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=132, Unknown=57, NotChecked=224, Total=462 [2019-11-28 14:41:33,340 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 10 states. [2019-11-28 14:42:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:42:19,733 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-28 14:42:19,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 14:42:19,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-28 14:42:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:42:19,735 INFO L225 Difference]: With dead ends: 52 [2019-11-28 14:42:19,736 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 14:42:19,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=49, Invalid=132, Unknown=57, NotChecked=224, Total=462 [2019-11-28 14:42:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 14:42:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-11-28 14:42:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 14:42:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-28 14:42:19,741 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2019-11-28 14:42:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:42:19,741 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-28 14:42:19,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:42:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-28 14:42:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 14:42:19,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:42:19,743 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:42:19,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 14:42:19,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:42:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:42:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1152618939, now seen corresponding path program 1 times [2019-11-28 14:42:19,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:42:19,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076356100] [2019-11-28 14:42:19,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-28 14:42:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:42:20,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 14:42:20,076 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:42:20,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 14:42:20,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:42:20,103 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-28 14:42:20,104 INFO L534 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. [2019-11-28 14:42:20,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-28 14:42:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:42:24,399 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:42:26,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_14|))) is different from false [2019-11-28 14:42:26,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_14| (store |c_#valid| c_entry_point_~p~0.base (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))))) is different from false [2019-11-28 14:42:27,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))) (= (store (store |c_#valid| c_entry_point_~q~0.base (_ bv0 1)) c_entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|))) is different from false [2019-11-28 14:42:29,835 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))) (= (store (store |c_#valid| c_entry_point_~q~0.base (_ bv0 1)) c_entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|))) is different from true [2019-11-28 14:42:29,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_entry_point_#t~ret39.base| (_ bv0 1)) c_entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))))) is different from false [2019-11-28 14:42:29,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) c_entry_point_~p~0.base (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))))) is different from false [2019-11-28 14:42:29,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 14:42:29,911 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-11-28 14:42:29,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from false [2019-11-28 14:42:29,929 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from true [2019-11-28 14:42:29,932 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 14:42:29,935 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-11-28 14:42:29,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 14:42:29,946 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-11-28 14:42:29,956 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from false [2019-11-28 14:42:29,965 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from true [2019-11-28 14:42:29,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 14:42:29,971 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-11-28 14:42:29,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))) (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_entry_point_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|))) is different from false [2019-11-28 14:42:30,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1))) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))))) is different from false [2019-11-28 14:42:30,073 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:42:30,079 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-11-28 14:42:30,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) is different from false [2019-11-28 14:42:30,093 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) is different from true [2019-11-28 14:42:30,095 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:42:30,105 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-11-28 14:42:30,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:42:30,123 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-11-28 14:42:30,137 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_86| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_86| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_86| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_86|) (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_86|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) is different from true [2019-11-28 14:42:30,140 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:42:30,145 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-11-28 14:42:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-11-28 14:42:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076356100] [2019-11-28 14:42:30,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:42:30,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-11-28 14:42:30,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068592858] [2019-11-28 14:42:30,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 14:42:30,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:42:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 14:42:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=198, Unknown=18, NotChecked=418, Total=702 [2019-11-28 14:42:30,266 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 27 states. [2019-11-28 14:42:40,476 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (_ bv1 1) (select |c_old(#valid)| |~#ldv_global_msg_list~0.base|))) (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_86| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_86| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_86| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_86|) (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_86|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) (= (select |c_old(#valid)| (_ bv0 32)) (_ bv0 1)) (= |c_#valid| |c_old(#valid)|)) is different from true [2019-11-28 14:42:40,645 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ldv_malloc_#res.base| (_ bv0 32))) (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) (= (select |c_old(#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 [2019-11-28 14:42:40,650 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c_ldv_malloc_#res.base| (_ bv0 32))) (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) (= (select |c_old(#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 [2019-11-28 14:42:46,789 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1)))))))))) is different from false [2019-11-28 14:42:50,840 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_ldv_malloc_#res.base| (_ bv0 32)) (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1)))))))))) is different from false [2019-11-28 14:42:50,846 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_ldv_malloc_#res.base| (_ bv0 32)) (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1)))))))))) is different from true [2019-11-28 14:43:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:09,220 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-28 14:43:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 14:43:09,220 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-11-28 14:43:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:09,221 INFO L225 Difference]: With dead ends: 56 [2019-11-28 14:43:09,222 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 14:43:09,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 15 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=102, Invalid=296, Unknown=42, NotChecked=750, Total=1190 [2019-11-28 14:43:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 14:43:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-11-28 14:43:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 14:43:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-11-28 14:43:09,226 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 28 [2019-11-28 14:43:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:09,227 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-11-28 14:43:09,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 14:43:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-11-28 14:43:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 14:43:09,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:09,228 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:09,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 14:43:09,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:43:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:09,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1037197721, now seen corresponding path program 2 times [2019-11-28 14:43:09,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:09,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087047800] [2019-11-28 14:43:09,440 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:09,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 14:43:09,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 14:43:09,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:43:09,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:43:09,578 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 14:43:09,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087047800] [2019-11-28 14:43:09,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:43:09,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 14:43:09,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848143859] [2019-11-28 14:43:09,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 14:43:09,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 14:43:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:43:09,638 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 6 states. [2019-11-28 14:43:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:09,663 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-28 14:43:09,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 14:43:09,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 14:43:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:09,664 INFO L225 Difference]: With dead ends: 25 [2019-11-28 14:43:09,665 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 14:43:09,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 14:43:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 14:43:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 14:43:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 14:43:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 14:43:09,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-11-28 14:43:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:09,669 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 14:43:09,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 14:43:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 14:43:09,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 14:43:09,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 14:43:09,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:43:09 BoogieIcfgContainer [2019-11-28 14:43:09,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 14:43:09,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 14:43:09,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 14:43:09,885 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 14:43:09,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:41:03" (3/4) ... [2019-11-28 14:43:09,895 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 14:43:09,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-28 14:43:09,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:43:09,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-28 14:43:09,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-28 14:43:09,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-28 14:43:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-28 14:43:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-28 14:43:09,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-28 14:43:09,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-28 14:43:09,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-28 14:43:09,913 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-11-28 14:43:09,914 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 14:43:09,914 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 14:43:09,914 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 14:43:09,915 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 14:43:09,989 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 14:43:09,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 14:43:09,991 INFO L168 Benchmark]: Toolchain (without parser) took 128677.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. [2019-11-28 14:43:09,991 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:43:09,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 925.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 14:43:09,992 INFO L168 Benchmark]: Boogie Preprocessor took 96.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:43:09,992 INFO L168 Benchmark]: RCFGBuilder took 1618.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.9 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. [2019-11-28 14:43:09,992 INFO L168 Benchmark]: TraceAbstraction took 125926.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 973.9 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-28 14:43:09,993 INFO L168 Benchmark]: Witness Printer took 104.96 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-28 14:43:09,995 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 925.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1618.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.9 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125926.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 973.9 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Witness Printer took 104.96 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 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: 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: 765]: 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: 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: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free 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 77 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 344 locations, 77 error locations. Result: SAFE, OverallTime: 125.8s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 89.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 410 SDtfs, 251 SDslu, 1134 SDs, 0 SdLazy, 1078 SolverSat, 101 SolverUnsat, 45 SolverUnknown, 0 SolverNotchecked, 79.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 520 SyntacticMatches, 10 SemanticMatches, 127 ConstructedPredicates, 22 IntricatePredicates, 1 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 37.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred 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, 14 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 31.5s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 618 ConstructedInterpolants, 87 QuantifiedInterpolants, 127306 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1187 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 64/96 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...