./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test16.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_test16.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 fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a ............................................................................................................................. 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_test16.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 fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:27:05,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 14:27:05,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 14:27:05,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 14:27:05,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 14:27:05,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 14:27:05,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 14:27:05,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 14:27:05,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 14:27:05,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 14:27:05,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 14:27:05,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 14:27:05,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 14:27:05,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 14:27:05,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 14:27:05,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 14:27:05,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 14:27:05,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 14:27:05,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 14:27:05,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 14:27:05,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 14:27:05,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 14:27:05,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 14:27:05,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 14:27:05,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 14:27:05,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 14:27:05,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 14:27:05,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 14:27:05,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 14:27:05,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 14:27:05,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 14:27:05,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 14:27:05,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 14:27:05,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 14:27:05,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 14:27:05,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 14:27:05,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 14:27:05,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 14:27:05,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 14:27:05,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 14:27:05,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 14:27:05,238 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:27:05,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 14:27:05,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 14:27:05,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 14:27:05,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 14:27:05,278 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 14:27:05,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 14:27:05,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 14:27:05,279 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 14:27:05,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 14:27:05,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 14:27:05,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 14:27:05,281 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 14:27:05,282 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 14:27:05,282 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 14:27:05,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 14:27:05,283 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 14:27:05,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 14:27:05,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 14:27:05,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 14:27:05,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 14:27:05,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 14:27:05,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 14:27:05,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:27:05,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 14:27:05,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 14:27:05,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 14:27:05,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 14:27:05,287 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 14:27:05,287 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 -> fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a [2019-11-28 14:27:05,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 14:27:05,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 14:27:05,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 14:27:05,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 14:27:05,635 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 14:27:05,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-11-28 14:27:05,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6b5cb67/1a88ae21e0db4926a033b4a53ede229b/FLAG447ce0bd6 [2019-11-28 14:27:06,334 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 14:27:06,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-11-28 14:27:06,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6b5cb67/1a88ae21e0db4926a033b4a53ede229b/FLAG447ce0bd6 [2019-11-28 14:27:06,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6b5cb67/1a88ae21e0db4926a033b4a53ede229b [2019-11-28 14:27:06,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 14:27:06,568 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 14:27:06,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 14:27:06,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 14:27:06,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 14:27:06,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:27:06" (1/1) ... [2019-11-28 14:27:06,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc447bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:06, skipping insertion in model container [2019-11-28 14:27:06,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:27:06" (1/1) ... [2019-11-28 14:27:06,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 14:27:06,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:27:07,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:27:07,233 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:27:07,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3bf45789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:07, skipping insertion in model container [2019-11-28 14:27:07,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 14:27:07,235 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 14:27:07,238 INFO L168 Benchmark]: Toolchain (without parser) took 668.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-28 14:27:07,240 INFO L168 Benchmark]: CDTParser took 0.41 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:27:07,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 665.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-28 14:27:07,246 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.41 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 665.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 27.3 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:27:09,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 14:27:09,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 14:27:09,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 14:27:09,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 14:27:09,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 14:27:09,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 14:27:09,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 14:27:09,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 14:27:09,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 14:27:09,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 14:27:09,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 14:27:09,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 14:27:09,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 14:27:09,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 14:27:09,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 14:27:09,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 14:27:09,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 14:27:09,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 14:27:09,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 14:27:09,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 14:27:09,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 14:27:09,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 14:27:09,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 14:27:09,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 14:27:09,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 14:27:09,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 14:27:09,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 14:27:09,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 14:27:09,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 14:27:09,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 14:27:09,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 14:27:09,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 14:27:09,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 14:27:09,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 14:27:09,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 14:27:09,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 14:27:09,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 14:27:09,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 14:27:09,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 14:27:09,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 14:27:09,222 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:27:09,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 14:27:09,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 14:27:09,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 14:27:09,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 14:27:09,239 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 14:27:09,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 14:27:09,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 14:27:09,239 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 14:27:09,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 14:27:09,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 14:27:09,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 14:27:09,240 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 14:27:09,240 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 14:27:09,241 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 14:27:09,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 14:27:09,241 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 14:27:09,241 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 14:27:09,242 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 14:27:09,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 14:27:09,242 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 14:27:09,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 14:27:09,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 14:27:09,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 14:27:09,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 14:27:09,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:27:09,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 14:27:09,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 14:27:09,244 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 14:27:09,244 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 14:27:09,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 14:27:09,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 14:27:09,245 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 -> fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a [2019-11-28 14:27:09,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 14:27:09,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 14:27:09,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 14:27:09,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 14:27:09,593 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 14:27:09,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-11-28 14:27:09,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56662dd9a/978a9a92706747d6ac74d24fdc6dabf0/FLAGc51c356ff [2019-11-28 14:27:10,241 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 14:27:10,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-11-28 14:27:10,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56662dd9a/978a9a92706747d6ac74d24fdc6dabf0/FLAGc51c356ff [2019-11-28 14:27:10,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56662dd9a/978a9a92706747d6ac74d24fdc6dabf0 [2019-11-28 14:27:10,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 14:27:10,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 14:27:10,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 14:27:10,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 14:27:10,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 14:27:10,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:27:10" (1/1) ... [2019-11-28 14:27:10,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40be7b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:10, skipping insertion in model container [2019-11-28 14:27:10,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:27:10" (1/1) ... [2019-11-28 14:27:10,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 14:27:10,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:27:11,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:27:11,184 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 14:27:11,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:27:11,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:27:11,272 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 14:27:11,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:27:11,422 INFO L208 MainTranslator]: Completed translation [2019-11-28 14:27:11,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11 WrapperNode [2019-11-28 14:27:11,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 14:27:11,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 14:27:11,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 14:27:11,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 14:27:11,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (1/1) ... [2019-11-28 14:27:11,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (1/1) ... [2019-11-28 14:27:11,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (1/1) ... [2019-11-28 14:27:11,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (1/1) ... [2019-11-28 14:27:11,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (1/1) ... [2019-11-28 14:27:11,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (1/1) ... [2019-11-28 14:27:11,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (1/1) ... [2019-11-28 14:27:11,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 14:27:11,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 14:27:11,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 14:27:11,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 14:27:11,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (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:27:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 14:27:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 14:27:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 14:27:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:27:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 14:27:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 14:27:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 14:27:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 14:27:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 14:27:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-28 14:27:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-28 14:27:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-28 14:27:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-28 14:27:11,593 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-28 14:27:11,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-28 14:27:11,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-28 14:27:11,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-28 14:27:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-28 14:27:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-28 14:27:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-28 14:27:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-28 14:27:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-28 14:27:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-28 14:27:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-28 14:27:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-28 14:27:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-28 14:27:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-28 14:27:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-28 14:27:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-28 14:27:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-28 14:27:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-28 14:27:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-28 14:27:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-28 14:27:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-28 14:27:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-28 14:27:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-28 14:27:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-28 14:27:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-28 14:27:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-28 14:27:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-28 14:27:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 14:27:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 14:27:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_16 [2019-11-28 14:27:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure free_16 [2019-11-28 14:27:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-28 14:27:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 14:27:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-28 14:27:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 14:27:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-28 14:27:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 14:27:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 14:27:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 14:27:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 14:27:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 14:27:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 14:27:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 14:27:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 14:27:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 14:27:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 14:27:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 14:27:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 14:27:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 14:27:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 14:27:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 14:27:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 14:27:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 14:27:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 14:27:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 14:27:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 14:27:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 14:27:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 14:27:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 14:27:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 14:27:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 14:27:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 14:27:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 14:27:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 14:27:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 14:27:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 14:27:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 14:27:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 14:27:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 14:27:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 14:27:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 14:27:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 14:27:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 14:27:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 14:27:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 14:27:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 14:27:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 14:27:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 14:27:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 14:27:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 14:27:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 14:27:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 14:27:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 14:27:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 14:27:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 14:27:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 14:27:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 14:27:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 14:27:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 14:27:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 14:27:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 14:27:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 14:27:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 14:27:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 14:27:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 14:27:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 14:27:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 14:27:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 14:27:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 14:27:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 14:27:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 14:27:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 14:27:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 14:27:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 14:27:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 14:27:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 14:27:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 14:27:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 14:27:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 14:27:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 14:27:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 14:27:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 14:27:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 14:27:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 14:27:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 14:27:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 14:27:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 14:27:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 14:27:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 14:27:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 14:27:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 14:27:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 14:27:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-28 14:27:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 14:27:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 14:27:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-28 14:27:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-28 14:27:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-28 14:27:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-28 14:27:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_16 [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure free_16 [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-28 14:27:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-28 14:27:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-28 14:27:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-28 14:27:12,350 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 14:27:12,789 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 14:27:13,182 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 14:27:13,182 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 14:27:13,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:27:13 BoogieIcfgContainer [2019-11-28 14:27:13,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 14:27:13,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 14:27:13,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 14:27:13,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 14:27:13,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:27:10" (1/3) ... [2019-11-28 14:27:13,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3140a31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:27:13, skipping insertion in model container [2019-11-28 14:27:13,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:27:11" (2/3) ... [2019-11-28 14:27:13,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3140a31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:27:13, skipping insertion in model container [2019-11-28 14:27:13,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:27:13" (3/3) ... [2019-11-28 14:27:13,196 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test16.i [2019-11-28 14:27:13,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 14:27:13,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2019-11-28 14:27:13,235 INFO L249 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2019-11-28 14:27:13,266 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 14:27:13,266 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 14:27:13,266 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 14:27:13,267 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 14:27:13,267 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 14:27:13,267 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 14:27:13,267 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 14:27:13,267 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 14:27:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-28 14:27:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 14:27:13,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:13,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:27:13,309 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash 997159282, now seen corresponding path program 1 times [2019-11-28 14:27:13,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:13,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663552331] [2019-11-28 14:27:13,332 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:27:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:13,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 14:27:13,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:13,672 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:27:13,674 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:13,760 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:27:13,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663552331] [2019-11-28 14:27:13,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:13,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-28 14:27:13,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114736132] [2019-11-28 14:27:13,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 14:27:13,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 14:27:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 14:27:13,790 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 8 states. [2019-11-28 14:27:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:27:13,910 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-11-28 14:27:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 14:27:13,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-28 14:27:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:27:13,927 INFO L225 Difference]: With dead ends: 49 [2019-11-28 14:27:13,927 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 14:27:13,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:27:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 14:27:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-11-28 14:27:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 14:27:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-28 14:27:13,979 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 17 [2019-11-28 14:27:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:27:13,980 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-28 14:27:13,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 14:27:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-28 14:27:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 14:27:13,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:13,981 INFO L410 BasicCegarLoop]: trace histogram [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:27:14,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 14:27:14,196 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 965683329, now seen corresponding path program 1 times [2019-11-28 14:27:14,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:14,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595203416] [2019-11-28 14:27:14,197 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:27:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:14,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 14:27:14,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:14,379 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:27:14,380 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:14,483 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:27:14,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595203416] [2019-11-28 14:27:14,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:14,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 14:27:14,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267742807] [2019-11-28 14:27:14,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 14:27:14,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 14:27:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 14:27:14,497 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 3 states. [2019-11-28 14:27:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:27:14,576 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-11-28 14:27:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 14:27:14,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 14:27:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:27:14,580 INFO L225 Difference]: With dead ends: 54 [2019-11-28 14:27:14,580 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 14:27:14,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:27:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 14:27:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 14:27:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 14:27:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-11-28 14:27:14,613 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 21 [2019-11-28 14:27:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:27:14,614 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-11-28 14:27:14,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 14:27:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-11-28 14:27:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 14:27:14,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:14,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:27:14,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 14:27:14,829 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1103285257, now seen corresponding path program 1 times [2019-11-28 14:27:14,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:14,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176876843] [2019-11-28 14:27:14,832 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:27:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:15,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 14:27:15,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:15,103 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:27:15,103 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:15,200 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:27:15,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176876843] [2019-11-28 14:27:15,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:15,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-28 14:27:15,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361512317] [2019-11-28 14:27:15,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 14:27:15,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:15,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 14:27:15,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:27:15,203 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2019-11-28 14:27:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:27:15,276 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-28 14:27:15,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 14:27:15,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-28 14:27:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:27:15,280 INFO L225 Difference]: With dead ends: 42 [2019-11-28 14:27:15,280 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 14:27:15,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:27:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 14:27:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 14:27:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 14:27:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-28 14:27:15,297 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 23 [2019-11-28 14:27:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:27:15,298 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-28 14:27:15,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 14:27:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-28 14:27:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 14:27:15,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:15,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:27:15,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 14:27:15,521 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:15,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:15,521 INFO L82 PathProgramCache]: Analyzing trace with hash 157895800, now seen corresponding path program 1 times [2019-11-28 14:27:15,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:15,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245526246] [2019-11-28 14:27:15,523 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:27:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:15,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 14:27:15,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:15,845 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:27:15,845 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:16,209 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:27:16,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245526246] [2019-11-28 14:27:16,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:16,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-28 14:27:16,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451243497] [2019-11-28 14:27:16,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 14:27:16,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 14:27:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-28 14:27:16,211 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 17 states. [2019-11-28 14:27:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:27:16,673 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-11-28 14:27:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 14:27:16,679 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-28 14:27:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:27:16,680 INFO L225 Difference]: With dead ends: 53 [2019-11-28 14:27:16,680 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 14:27:16,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-11-28 14:27:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 14:27:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-11-28 14:27:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 14:27:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-28 14:27:16,689 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 24 [2019-11-28 14:27:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:27:16,689 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-28 14:27:16,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 14:27:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-28 14:27:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 14:27:16,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:16,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:27:16,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 14:27:16,911 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash 599802905, now seen corresponding path program 1 times [2019-11-28 14:27:16,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:16,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881542256] [2019-11-28 14:27:16,913 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:27:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:17,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 14:27:17,040 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:17,079 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:27:17,079 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:27:17,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:27:17,086 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:27:17,086 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:27:17,159 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:27:17,159 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:17,283 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:27:17,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881542256] [2019-11-28 14:27:17,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:17,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-28 14:27:17,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715220873] [2019-11-28 14:27:17,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 14:27:17,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 14:27:17,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:27:17,286 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 9 states. [2019-11-28 14:27:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:27:17,442 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-11-28 14:27:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 14:27:17,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 14:27:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:27:17,446 INFO L225 Difference]: With dead ends: 50 [2019-11-28 14:27:17,446 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 14:27:17,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:27:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 14:27:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-11-28 14:27:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 14:27:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-11-28 14:27:17,452 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 25 [2019-11-28 14:27:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:27:17,453 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-11-28 14:27:17,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 14:27:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-11-28 14:27:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 14:27:17,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:17,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:27:17,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 14:27:17,655 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash 306399898, now seen corresponding path program 1 times [2019-11-28 14:27:17,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:17,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932352105] [2019-11-28 14:27:17,656 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:27:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:17,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 14:27:17,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:17,823 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:27:17,823 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:17,898 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:27:17,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932352105] [2019-11-28 14:27:17,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:17,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-28 14:27:17,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874873720] [2019-11-28 14:27:17,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 14:27:17,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 14:27:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:27:17,901 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 9 states. [2019-11-28 14:27:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:27:17,999 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-11-28 14:27:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 14:27:18,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 14:27:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:27:18,001 INFO L225 Difference]: With dead ends: 47 [2019-11-28 14:27:18,001 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 14:27:18,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:27:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 14:27:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 14:27:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 14:27:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-28 14:27:18,006 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 25 [2019-11-28 14:27:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:27:18,007 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-28 14:27:18,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 14:27:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-28 14:27:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 14:27:18,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:18,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:27:18,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 14:27:18,221 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1123950726, now seen corresponding path program 1 times [2019-11-28 14:27:18,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:18,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965026232] [2019-11-28 14:27:18,223 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:27:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:18,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 14:27:18,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:18,394 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:27:18,394 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:18,576 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:27:18,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965026232] [2019-11-28 14:27:18,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:18,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-28 14:27:18,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838915220] [2019-11-28 14:27:18,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 14:27:18,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:18,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 14:27:18,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:27:18,579 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 9 states. [2019-11-28 14:27:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:27:18,670 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-11-28 14:27:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 14:27:18,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-28 14:27:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:27:18,672 INFO L225 Difference]: With dead ends: 47 [2019-11-28 14:27:18,672 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 14:27:18,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 14:27:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 14:27:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-11-28 14:27:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 14:27:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-11-28 14:27:18,678 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-11-28 14:27:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:27:18,678 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-11-28 14:27:18,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 14:27:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-11-28 14:27:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 14:27:18,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:27:18,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:27:18,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 14:27:18,898 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:27:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:27:18,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2141245867, now seen corresponding path program 1 times [2019-11-28 14:27:18,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:27:18,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853847820] [2019-11-28 14:27:18,900 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:27:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:27:19,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 14:27:19,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:27:19,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:27:19,080 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 14:27:19,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:27:19,096 INFO L614 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-28 14:27:19,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:27:19,100 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:27:19,101 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2019-11-28 14:27:19,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:27:19,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:27:19,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:27:19,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:27:27,400 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:27:27,401 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:27:48,413 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-11-28 14:27:48,421 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from false [2019-11-28 14:27:48,424 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from true [2019-11-28 14:27:48,434 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-11-28 14:27:48,450 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-11-28 14:27:48,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |c_#valid| c_free_16_~p.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from false [2019-11-28 14:27:48,464 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |c_#valid| c_free_16_~p.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from true [2019-11-28 14:27:48,476 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-11-28 14:27:48,483 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-11-28 14:27:48,490 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-11-28 14:27:48,497 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-11-28 14:27:48,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= (store |c_#valid| |c_free_16_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from false [2019-11-28 14:27:48,514 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= (store |c_#valid| |c_free_16_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from true [2019-11-28 14:27:50,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |c_#valid| v_alloc_16_~p~0.base_31) (_ bv0 1))) (= (store |c_#valid| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~1.base_20)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |c_old(#valid)| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from false [2019-11-28 14:27:50,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))) (= v_prenex_3 (store |c_#valid| |c_alloc_16_#res.base| (_ bv0 1))))))) is different from false [2019-11-28 14:27:50,765 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))) (= v_prenex_3 (store |c_#valid| |c_alloc_16_#res.base| (_ bv0 1))))))) is different from true [2019-11-28 14:27:50,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_alloc_16_#t~ret38.base| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from false [2019-11-28 14:27:50,796 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_alloc_16_#t~ret38.base| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from true [2019-11-28 14:27:50,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_53|) (_ bv0 1))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_ldv_malloc_#res.base_53| (_ bv0 1)) v_prenex_3) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from false [2019-11-28 14:27:50,871 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_53|) (_ bv0 1))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_ldv_malloc_#res.base_53| (_ bv0 1)) v_prenex_3) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from true [2019-11-28 14:27:50,880 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-11-28 14:27:50,944 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 14:27:50,947 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5, |v_old(#valid)_BEFORE_CALL_11|], 5=[v_prenex_6]} [2019-11-28 14:27:50,950 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-11-28 14:27:50,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))))) is different from false [2019-11-28 14:27:50,975 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))))) is different from true [2019-11-28 14:27:50,979 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 14:27:50,995 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-11-28 14:27:51,001 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_9], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-11-28 14:27:51,004 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5], 5=[v_prenex_6, |v_old(#valid)_BEFORE_CALL_14|]} [2019-11-28 14:27:51,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) is different from false [2019-11-28 14:27:51,024 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) is different from true [2019-11-28 14:27:51,030 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-28 14:27:51,035 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:27:51,039 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_9], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-11-28 14:27:51,041 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5], 5=[v_prenex_6, |v_old(#valid)_BEFORE_CALL_14|]} [2019-11-28 14:27:51,057 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_54| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_54|) (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |v_ldv_malloc_#res.base_54| (_ bv0 1))))) is different from true [2019-11-28 14:27:51,061 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-28 14:27:51,067 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-28 14:27:51,073 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_9], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-11-28 14:27:51,079 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5], 5=[v_prenex_6, |v_old(#valid)_BEFORE_CALL_14|]} [2019-11-28 14:27:51,126 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:27:51,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853847820] [2019-11-28 14:27:51,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:27:51,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 16] imperfect sequences [] total 27 [2019-11-28 14:27:51,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091389625] [2019-11-28 14:27:51,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 14:27:51,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:27:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 14:27:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=226, Unknown=45, NotChecked=410, Total=756 [2019-11-28 14:27:51,130 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2019-11-28 14:28:25,798 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1))))))))) is different from false [2019-11-28 14:28:25,908 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))))) (= (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:28:29,930 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_alloc_16_#t~ret38.base| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_alloc_16_#t~ret38.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_alloc_16_#t~ret38.base|) (_ bv0 1))) is different from false [2019-11-28 14:28:29,936 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_alloc_16_#t~ret38.base| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_alloc_16_#t~ret38.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_alloc_16_#t~ret38.base|) (_ bv0 1))) is different from true [2019-11-28 14:28:30,002 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_old(#valid)| |c_alloc_16_#res.base|)) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))) (= v_prenex_3 (store |c_#valid| |c_alloc_16_#res.base| (_ bv0 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_alloc_16_#res.base| (_ bv1 1)))) is different from false [2019-11-28 14:28:50,921 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= (store |c_#valid| |c_free_16_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |c_old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-11-28 14:28:54,963 WARN L838 $PredicateComparison]: unable to prove that (and (= c_free_16_~p.base |c_free_16_#in~p.base|) (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |c_#valid| c_free_16_~p.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from false [2019-11-28 14:29:17,185 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))) is different from false [2019-11-28 14:29:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:29:21,319 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2019-11-28 14:29:21,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 14:29:21,320 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-11-28 14:29:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:29:21,321 INFO L225 Difference]: With dead ends: 48 [2019-11-28 14:29:21,321 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 14:29:21,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=119, Invalid=318, Unknown=93, NotChecked=952, Total=1482 [2019-11-28 14:29:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 14:29:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-28 14:29:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 14:29:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2019-11-28 14:29:21,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 30 [2019-11-28 14:29:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:29:21,325 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2019-11-28 14:29:21,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 14:29:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2019-11-28 14:29:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 14:29:21,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:29:21,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:29:21,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 14:29:21,528 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 14:29:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:29:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1144173514, now seen corresponding path program 1 times [2019-11-28 14:29:21,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:29:21,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241216285] [2019-11-28 14:29:21,530 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:29:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:29:21,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 14:29:21,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:29:21,680 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:29:21,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:29:21,693 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-28 14:29:21,693 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:29:21,694 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-28 14:29:21,874 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:29:21,874 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:29:22,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:29:22,126 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 1 case distinctions, treesize of input 17 treesize of output 16 [2019-11-28 14:29:22,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:29:22,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:29:22,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:29:22,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-11-28 14:29:22,331 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 20 treesize of output 9 [2019-11-28 14:29:22,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:29:22,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:29:22,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:29:22,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2019-11-28 14:29:22,418 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 20 treesize of output 9 [2019-11-28 14:29:22,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:29:22,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:29:22,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:29:22,422 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2019-11-28 14:29:22,505 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:29:22,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241216285] [2019-11-28 14:29:22,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:29:22,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 14] imperfect sequences [] total 23 [2019-11-28 14:29:22,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504465112] [2019-11-28 14:29:22,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 14:29:22,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:29:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 14:29:22,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-28 14:29:22,508 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand 24 states. [2019-11-28 14:29:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:29:23,003 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2019-11-28 14:29:23,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 14:29:23,004 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-28 14:29:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:29:23,004 INFO L225 Difference]: With dead ends: 30 [2019-11-28 14:29:23,004 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 14:29:23,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2019-11-28 14:29:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 14:29:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 14:29:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 14:29:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 14:29:23,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-11-28 14:29:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:29:23,007 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 14:29:23,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 14:29:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 14:29:23,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 14:29:23,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 14:29:23,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:29:23 BoogieIcfgContainer [2019-11-28 14:29:23,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 14:29:23,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 14:29:23,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 14:29:23,217 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 14:29:23,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:27:13" (3/4) ... [2019-11-28 14:29:23,222 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 14:29:23,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-28 14:29:23,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:29:23,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-28 14:29:23,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-28 14:29:23,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-28 14:29:23,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-28 14:29:23,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_16 [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-28 14:29:23,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-28 14:29:23,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-28 14:29:23,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-28 14:29:23,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_16 [2019-11-28 14:29:23,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 14:29:23,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-28 14:29:23,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-28 14:29:23,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-28 14:29:23,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-28 14:29:23,244 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2019-11-28 14:29:23,244 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 14:29:23,244 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 14:29:23,245 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 14:29:23,245 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 14:29:23,314 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 14:29:23,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 14:29:23,316 INFO L168 Benchmark]: Toolchain (without parser) took 132806.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 946.9 MB in the beginning and 870.7 MB in the end (delta: 76.2 MB). Peak memory consumption was 386.1 MB. Max. memory is 11.5 GB. [2019-11-28 14:29:23,317 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:29:23,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 913.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 14:29:23,318 INFO L168 Benchmark]: Boogie Preprocessor took 100.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:29:23,318 INFO L168 Benchmark]: RCFGBuilder took 1658.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 112.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2019-11-28 14:29:23,319 INFO L168 Benchmark]: TraceAbstraction took 130029.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 961.4 MB in the beginning and 879.9 MB in the end (delta: 81.5 MB). Peak memory consumption was 270.8 MB. Max. memory is 11.5 GB. [2019-11-28 14:29:23,319 INFO L168 Benchmark]: Witness Printer took 98.48 ms. Allocated memory is still 1.3 GB. Free memory was 879.9 MB in the beginning and 870.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-28 14:29:23,324 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 913.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1658.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 112.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 130029.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 961.4 MB in the beginning and 879.9 MB in the end (delta: 81.5 MB). Peak memory consumption was 270.8 MB. Max. memory is 11.5 GB. * Witness Printer took 98.48 ms. Allocated memory is still 1.3 GB. Free memory was 879.9 MB in the beginning and 870.7 MB 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: 777]: 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: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: 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 74 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 347 locations, 74 error locations. Result: SAFE, OverallTime: 129.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 91.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 209 SDslu, 1236 SDs, 0 SdLazy, 786 SolverSat, 95 SolverUnsat, 87 SolverUnknown, 0 SolverNotchecked, 77.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 333 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 45.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred 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, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 34.6s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 426 ConstructedInterpolants, 36 QuantifiedInterpolants, 75540 SizeOfPredicates, 29 NumberOfNonLiveVariables, 771 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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...