./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5758efa3 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_test22_4.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 e9fb52f5a8769e751d5dc39d93dc642433ae2f5b ............................................................................................................................ 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_test22_4.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 e9fb52f5a8769e751d5dc39d93dc642433ae2f5b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 21:23:44,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:44,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:44,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:44,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:44,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:44,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:44,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:44,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:44,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:44,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:44,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:44,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:44,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:44,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:44,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:44,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:44,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:44,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:44,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:44,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:44,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:44,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:44,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:44,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:44,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:44,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:44,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:44,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:44,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:44,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:44,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:44,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:44,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:44,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:44,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:44,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:44,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:44,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:44,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:44,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:44,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-26 21:23:44,488 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:44,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:44,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:44,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:44,494 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:44,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:44,494 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:44,495 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:44,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:44,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:44,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:44,497 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:44,497 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:44,498 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:44,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:44,498 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:44,499 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:44,499 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:44,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:44,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:44,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:44,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:44,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:44,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:44,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:44,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 21:23:44,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 21:23:44,503 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 -> e9fb52f5a8769e751d5dc39d93dc642433ae2f5b [2019-11-26 21:23:44,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:23:44,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:23:44,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:23:44,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:23:44,832 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:23:44,832 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-26 21:23:44,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7197e83ce/5470f08d0e5e42bcb5ce423165851c8e/FLAG0d6ceee2a [2019-11-26 21:23:45,465 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:23:45,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-26 21:23:45,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7197e83ce/5470f08d0e5e42bcb5ce423165851c8e/FLAG0d6ceee2a [2019-11-26 21:23:45,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7197e83ce/5470f08d0e5e42bcb5ce423165851c8e [2019-11-26 21:23:45,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:23:45,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:23:45,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:45,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:23:45,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:23:45,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:45" (1/1) ... [2019-11-26 21:23:45,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f384efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:45, skipping insertion in model container [2019-11-26 21:23:45,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:45" (1/1) ... [2019-11-26 21:23:45,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:23:45,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:46,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:46,482 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-26 21:23:46,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a8b683e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:46, skipping insertion in model container [2019-11-26 21:23:46,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:46,484 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-26 21:23:46,487 INFO L168 Benchmark]: Toolchain (without parser) took 714.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:46,488 INFO L168 Benchmark]: CDTParser took 0.63 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-26 21:23:46,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:46,491 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.63 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 710.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 20.7 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.24-5758efa [2019-11-26 21:23:48,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:48,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:48,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:48,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:48,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:48,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:48,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:48,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:48,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:48,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:48,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:48,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:48,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:48,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:48,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:48,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:48,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:48,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:48,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:48,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:48,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:48,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:48,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:48,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:48,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:48,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:48,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:48,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:48,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:48,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:48,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:48,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:48,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:48,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:48,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:48,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:48,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:48,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:48,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:48,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:48,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-26 21:23:48,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:48,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:48,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:48,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:48,383 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:48,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:48,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:48,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:48,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:48,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:48,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:48,385 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:48,385 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:48,385 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:48,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:48,386 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:48,386 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 21:23:48,386 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 21:23:48,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:48,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:48,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:48,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:48,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:48,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:48,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:48,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:48,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:48,389 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 21:23:48,389 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 21:23:48,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 21:23:48,390 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 -> e9fb52f5a8769e751d5dc39d93dc642433ae2f5b [2019-11-26 21:23:48,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:23:48,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:23:48,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:23:48,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:23:48,732 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:23:48,733 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-26 21:23:48,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7003440f4/4fa9ec75aa4e4655ad8bba0eebb34dcb/FLAG7776c576a [2019-11-26 21:23:49,320 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:23:49,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-26 21:23:49,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7003440f4/4fa9ec75aa4e4655ad8bba0eebb34dcb/FLAG7776c576a [2019-11-26 21:23:49,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7003440f4/4fa9ec75aa4e4655ad8bba0eebb34dcb [2019-11-26 21:23:49,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:23:49,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:23:49,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:49,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:23:49,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:23:49,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:49" (1/1) ... [2019-11-26 21:23:49,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6d29e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:49, skipping insertion in model container [2019-11-26 21:23:49,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:49" (1/1) ... [2019-11-26 21:23:49,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:23:49,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:50,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:50,229 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 21:23:50,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:50,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:50,301 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:23:50,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:50,452 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:23:50,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50 WrapperNode [2019-11-26 21:23:50,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:50,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:23:50,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:23:50,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:23:50,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (1/1) ... [2019-11-26 21:23:50,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (1/1) ... [2019-11-26 21:23:50,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (1/1) ... [2019-11-26 21:23:50,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (1/1) ... [2019-11-26 21:23:50,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (1/1) ... [2019-11-26 21:23:50,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (1/1) ... [2019-11-26 21:23:50,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (1/1) ... [2019-11-26 21:23:50,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:23:50,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:23:50,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:23:50,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:23:50,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (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-26 21:23:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 21:23:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:23:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:23:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:23:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 21:23:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 21:23:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-26 21:23:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-26 21:23:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-26 21:23:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-26 21:23:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-26 21:23:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-26 21:23:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-26 21:23:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:23:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-26 21:23:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-26 21:23:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-26 21:23:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-26 21:23:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-26 21:23:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-26 21:23:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-26 21:23:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-26 21:23:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-26 21:23:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-26 21:23:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-26 21:23:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-26 21:23:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-26 21:23:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-26 21:23:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-26 21:23:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-26 21:23:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-26 21:23:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-26 21:23:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-26 21:23:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-26 21:23:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-26 21:23:50,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-26 21:23:50,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-26 21:23:50,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-26 21:23:50,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-26 21:23:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-26 21:23:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-26 21:23:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-26 21:23:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-26 21:23:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-26 21:23:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-26 21:23:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 21:23:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-26 21:23:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-26 21:23:50,641 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-26 21:23:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 21:23:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 21:23:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 21:23:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 21:23:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 21:23:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 21:23:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 21:23:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 21:23:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 21:23:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 21:23:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 21:23:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 21:23:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 21:23:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 21:23:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 21:23:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 21:23:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 21:23:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 21:23:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-26 21:23:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-26 21:23:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-26 21:23:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 21:23:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 21:23:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 21:23:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 21:23:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 21:23:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 21:23:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 21:23:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 21:23:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 21:23:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 21:23:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 21:23:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 21:23:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 21:23:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 21:23:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 21:23:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 21:23:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 21:23:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 21:23:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 21:23:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 21:23:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 21:23:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 21:23:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 21:23:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 21:23:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 21:23:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 21:23:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 21:23:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 21:23:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 21:23:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 21:23:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 21:23:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 21:23:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 21:23:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 21:23:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 21:23:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 21:23:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 21:23:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 21:23:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 21:23:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 21:23:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 21:23:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 21:23:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 21:23:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 21:23:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 21:23:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 21:23:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 21:23:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 21:23:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 21:23:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 21:23:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 21:23:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 21:23:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 21:23:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 21:23:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 21:23:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 21:23:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 21:23:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 21:23:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 21:23:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 21:23:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 21:23:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 21:23:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 21:23:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 21:23:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 21:23:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 21:23:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 21:23:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 21:23:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 21:23:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 21:23:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 21:23:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 21:23:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 21:23:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 21:23:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 21:23:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 21:23:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 21:23:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 21:23:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 21:23:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 21:23:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 21:23:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 21:23:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 21:23:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 21:23:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 21:23:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 21:23:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-26 21:23:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 21:23:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-26 21:23:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-26 21:23:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 21:23:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 21:23:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-26 21:23:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 21:23:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-26 21:23:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-26 21:23:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:23:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 21:23:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-26 21:23:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-26 21:23:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-26 21:23:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 21:23:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-26 21:23:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-26 21:23:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-26 21:23:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-26 21:23:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-26 21:23:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-26 21:23:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 21:23:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-26 21:23:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-26 21:23:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-26 21:23:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-26 21:23:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-26 21:23:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 21:23:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 21:23:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-26 21:23:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-26 21:23:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:23:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-26 21:23:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-26 21:23:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-26 21:23:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-26 21:23:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-26 21:23:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-26 21:23:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-26 21:23:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-26 21:23:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-26 21:23:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-26 21:23:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-26 21:23:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-26 21:23:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-26 21:23:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-26 21:23:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-26 21:23:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-26 21:23:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-26 21:23:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 21:23:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 21:23:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 21:23:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 21:23:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:23:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:23:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-26 21:23:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-26 21:23:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-26 21:23:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-26 21:23:51,406 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:23:51,825 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:23:52,186 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:23:52,186 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 21:23:52,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:52 BoogieIcfgContainer [2019-11-26 21:23:52,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:23:52,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:23:52,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:23:52,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:23:52,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:23:49" (1/3) ... [2019-11-26 21:23:52,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25381bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:23:52, skipping insertion in model container [2019-11-26 21:23:52,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:50" (2/3) ... [2019-11-26 21:23:52,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25381bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:23:52, skipping insertion in model container [2019-11-26 21:23:52,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:52" (3/3) ... [2019-11-26 21:23:52,202 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2019-11-26 21:23:52,213 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:23:52,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-26 21:23:52,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-26 21:23:52,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:23:52,264 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 21:23:52,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:23:52,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:23:52,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:23:52,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:23:52,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:23:52,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:23:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-11-26 21:23:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:52,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:52,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:52,313 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-26 21:23:52,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:52,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088153338] [2019-11-26 21:23:52,335 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-26 21:23:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:52,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:52,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:52,662 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-26 21:23:52,663 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:52,675 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:52,675 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:52,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:52,701 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-26 21:23:52,702 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:52,764 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-26 21:23:52,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088153338] [2019-11-26 21:23:52,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:52,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 21:23:52,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56366719] [2019-11-26 21:23:52,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:52,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:52,805 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 5 states. [2019-11-26 21:23:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:53,188 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-26 21:23:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:53,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:23:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:53,207 INFO L225 Difference]: With dead ends: 160 [2019-11-26 21:23:53,208 INFO L226 Difference]: Without dead ends: 157 [2019-11-26 21:23:53,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-26 21:23:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2019-11-26 21:23:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 21:23:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2019-11-26 21:23:53,271 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 17 [2019-11-26 21:23:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:53,272 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2019-11-26 21:23:53,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:53,272 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2019-11-26 21:23:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:53,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:53,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:53,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 21:23:53,489 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-26 21:23:53,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:53,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793269827] [2019-11-26 21:23:53,491 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-26 21:23:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:53,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:23:53,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:53,694 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-26 21:23:53,694 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:53,703 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:53,703 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:53,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:53,758 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-26 21:23:53,758 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:54,112 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-26 21:23:54,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793269827] [2019-11-26 21:23:54,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:54,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 21:23:54,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277051558] [2019-11-26 21:23:54,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:23:54,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:23:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:23:54,116 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand 10 states. [2019-11-26 21:23:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:54,948 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-26 21:23:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:23:54,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 21:23:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:54,952 INFO L225 Difference]: With dead ends: 156 [2019-11-26 21:23:54,952 INFO L226 Difference]: Without dead ends: 156 [2019-11-26 21:23:54,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:23:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-26 21:23:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2019-11-26 21:23:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 21:23:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2019-11-26 21:23:54,974 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 17 [2019-11-26 21:23:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:54,975 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2019-11-26 21:23:54,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:23:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2019-11-26 21:23:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:54,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:54,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:55,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 21:23:55,189 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-26 21:23:55,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:55,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848214470] [2019-11-26 21:23:55,191 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-26 21:23:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:55,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:23:55,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:55,350 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-26 21:23:55,350 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:55,397 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-26 21:23:55,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848214470] [2019-11-26 21:23:55,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:55,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:23:55,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467245024] [2019-11-26 21:23:55,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:55,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:55,400 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 5 states. [2019-11-26 21:23:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:55,438 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2019-11-26 21:23:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:55,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:23:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:55,442 INFO L225 Difference]: With dead ends: 150 [2019-11-26 21:23:55,442 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 21:23:55,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 21:23:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-26 21:23:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-26 21:23:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2019-11-26 21:23:55,455 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 17 [2019-11-26 21:23:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:55,455 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2019-11-26 21:23:55,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2019-11-26 21:23:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:23:55,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:55,457 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] [2019-11-26 21:23:55,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 21:23:55,665 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 300911328, now seen corresponding path program 1 times [2019-11-26 21:23:55,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:55,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064890642] [2019-11-26 21:23:55,668 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-26 21:23:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:55,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:55,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:55,862 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-26 21:23:55,862 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:55,942 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-26 21:23:55,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064890642] [2019-11-26 21:23:55,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:23:55,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875731308] [2019-11-26 21:23:55,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:55,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:55,947 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 5 states. [2019-11-26 21:23:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:55,982 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2019-11-26 21:23:55,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:55,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-26 21:23:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:55,987 INFO L225 Difference]: With dead ends: 150 [2019-11-26 21:23:55,987 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 21:23:55,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 21:23:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-26 21:23:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-26 21:23:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2019-11-26 21:23:56,001 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 29 [2019-11-26 21:23:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:56,001 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2019-11-26 21:23:56,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2019-11-26 21:23:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:23:56,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:56,002 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] [2019-11-26 21:23:56,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 21:23:56,216 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:56,217 INFO L82 PathProgramCache]: Analyzing trace with hash -696161025, now seen corresponding path program 1 times [2019-11-26 21:23:56,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:56,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451966043] [2019-11-26 21:23:56,218 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-26 21:23:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:56,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 21:23:56,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:56,429 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-26 21:23:56,429 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:56,470 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-26 21:23:56,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451966043] [2019-11-26 21:23:56,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:56,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-26 21:23:56,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147386917] [2019-11-26 21:23:56,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:23:56,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:56,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:23:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:23:56,473 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 9 states. [2019-11-26 21:23:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:56,606 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2019-11-26 21:23:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:23:56,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-26 21:23:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:56,613 INFO L225 Difference]: With dead ends: 168 [2019-11-26 21:23:56,613 INFO L226 Difference]: Without dead ends: 168 [2019-11-26 21:23:56,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:23:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-26 21:23:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2019-11-26 21:23:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-26 21:23:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2019-11-26 21:23:56,642 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 29 [2019-11-26 21:23:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:56,642 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2019-11-26 21:23:56,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:23:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2019-11-26 21:23:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:23:56,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:56,644 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, 1, 1] [2019-11-26 21:23:56,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 21:23:56,869 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:56,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:56,870 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-26 21:23:56,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:56,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853914799] [2019-11-26 21:23:56,871 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-26 21:23:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:57,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 21:23:57,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:57,031 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-26 21:23:57,031 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:57,089 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-26 21:23:57,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853914799] [2019-11-26 21:23:57,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:57,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 21:23:57,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233915214] [2019-11-26 21:23:57,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:23:57,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:57,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:23:57,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:23:57,091 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand 6 states. [2019-11-26 21:23:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:57,140 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2019-11-26 21:23:57,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:23:57,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 21:23:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:57,143 INFO L225 Difference]: With dead ends: 168 [2019-11-26 21:23:57,143 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 21:23:57,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:23:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 21:23:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-26 21:23:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-26 21:23:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2019-11-26 21:23:57,159 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 32 [2019-11-26 21:23:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:57,159 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2019-11-26 21:23:57,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:23:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2019-11-26 21:23:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 21:23:57,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:57,161 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:57,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 21:23:57,381 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-26 21:23:57,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:57,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469297129] [2019-11-26 21:23:57,383 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-26 21:23:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:57,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:57,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:57,570 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:57,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469297129] [2019-11-26 21:23:57,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:57,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-26 21:23:57,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153246026] [2019-11-26 21:23:57,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:23:57,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:57,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:23:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:23:57,714 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 10 states. [2019-11-26 21:23:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:57,951 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2019-11-26 21:23:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:23:57,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-26 21:23:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:57,954 INFO L225 Difference]: With dead ends: 172 [2019-11-26 21:23:57,954 INFO L226 Difference]: Without dead ends: 168 [2019-11-26 21:23:57,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:23:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-26 21:23:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-26 21:23:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-26 21:23:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2019-11-26 21:23:57,964 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 34 [2019-11-26 21:23:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:57,965 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2019-11-26 21:23:57,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:23:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2019-11-26 21:23:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:23:57,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:57,967 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:58,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 21:23:58,178 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-26 21:23:58,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:58,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613880161] [2019-11-26 21:23:58,181 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-26 21:23:58,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:23:58,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:23:58,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:23:58,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:58,370 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-26 21:23:58,371 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:58,373 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:58,373 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:58,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 21:23:58,530 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 21:23:58,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613880161] [2019-11-26 21:23:58,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:58,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:23:58,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888221127] [2019-11-26 21:23:58,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:23:58,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:23:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:23:58,614 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 12 states. [2019-11-26 21:23:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:59,730 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2019-11-26 21:23:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:23:59,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-26 21:23:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:59,733 INFO L225 Difference]: With dead ends: 179 [2019-11-26 21:23:59,733 INFO L226 Difference]: Without dead ends: 179 [2019-11-26 21:23:59,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:23:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-26 21:23:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2019-11-26 21:23:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-26 21:23:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 174 transitions. [2019-11-26 21:23:59,742 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 174 transitions. Word has length 38 [2019-11-26 21:23:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:59,742 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 174 transitions. [2019-11-26 21:23:59,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:23:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 174 transitions. [2019-11-26 21:23:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:23:59,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:59,744 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:59,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 21:23:59,960 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-26 21:23:59,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:59,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267240569] [2019-11-26 21:23:59,961 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-26 21:24:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:00,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:24:00,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:00,201 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:00,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267240569] [2019-11-26 21:24:00,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:24:00,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-26 21:24:00,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4928185] [2019-11-26 21:24:00,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 21:24:00,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:00,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 21:24:00,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-26 21:24:00,531 INFO L87 Difference]: Start difference. First operand 167 states and 174 transitions. Second operand 18 states. [2019-11-26 21:24:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:01,551 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-11-26 21:24:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:24:01,552 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-26 21:24:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:01,553 INFO L225 Difference]: With dead ends: 179 [2019-11-26 21:24:01,553 INFO L226 Difference]: Without dead ends: 175 [2019-11-26 21:24:01,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-26 21:24:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-26 21:24:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-26 21:24:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-26 21:24:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2019-11-26 21:24:01,561 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 38 [2019-11-26 21:24:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:01,561 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2019-11-26 21:24:01,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 21:24:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2019-11-26 21:24:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 21:24:01,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:01,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:01,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 21:24:01,779 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1347385061, now seen corresponding path program 1 times [2019-11-26 21:24:01,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:01,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717673641] [2019-11-26 21:24:01,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:01,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:24:01,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:01,988 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-26 21:24:01,989 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:02,051 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-26 21:24:02,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717673641] [2019-11-26 21:24:02,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:02,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-26 21:24:02,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648888563] [2019-11-26 21:24:02,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:24:02,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:24:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:24:02,053 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand 7 states. [2019-11-26 21:24:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:02,102 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2019-11-26 21:24:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 21:24:02,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-26 21:24:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:02,104 INFO L225 Difference]: With dead ends: 184 [2019-11-26 21:24:02,105 INFO L226 Difference]: Without dead ends: 184 [2019-11-26 21:24:02,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:24:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-26 21:24:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-11-26 21:24:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-26 21:24:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2019-11-26 21:24:02,112 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 40 [2019-11-26 21:24:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:02,113 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2019-11-26 21:24:02,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:24:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2019-11-26 21:24:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:24:02,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:02,114 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:02,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 21:24:02,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1156201438, now seen corresponding path program 1 times [2019-11-26 21:24:02,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:02,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571191602] [2019-11-26 21:24:02,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:02,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 21:24:02,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:02,474 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-26 21:24:02,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:02,627 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-26 21:24:02,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571191602] [2019-11-26 21:24:02,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:02,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 21:24:02,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719765615] [2019-11-26 21:24:02,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 21:24:02,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 21:24:02,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 21:24:02,629 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand 3 states. [2019-11-26 21:24:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:02,842 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2019-11-26 21:24:02,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 21:24:02,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-26 21:24:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:02,845 INFO L225 Difference]: With dead ends: 191 [2019-11-26 21:24:02,845 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 21:24:02,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-26 21:24:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 21:24:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-26 21:24:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 21:24:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 163 transitions. [2019-11-26 21:24:02,853 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 163 transitions. Word has length 38 [2019-11-26 21:24:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:02,854 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 163 transitions. [2019-11-26 21:24:02,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 21:24:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 163 transitions. [2019-11-26 21:24:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 21:24:02,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:02,856 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:03,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 21:24:03,069 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:03,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-26 21:24:03,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:03,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684652713] [2019-11-26 21:24:03,070 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:03,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:24:03,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:24:03,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:24:03,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:03,294 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-26 21:24:03,295 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:03,301 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:03,302 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:03,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 21:24:03,623 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 21:24:04,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684652713] [2019-11-26 21:24:04,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:04,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:24:04,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287477227] [2019-11-26 21:24:04,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:24:04,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:04,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:24:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:24:04,552 INFO L87 Difference]: Start difference. First operand 157 states and 163 transitions. Second operand 23 states. [2019-11-26 21:24:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:07,703 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2019-11-26 21:24:07,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:24:07,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-26 21:24:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:07,706 INFO L225 Difference]: With dead ends: 156 [2019-11-26 21:24:07,706 INFO L226 Difference]: Without dead ends: 156 [2019-11-26 21:24:07,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:24:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-26 21:24:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-26 21:24:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-26 21:24:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-26 21:24:07,715 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 46 [2019-11-26 21:24:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:07,715 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-26 21:24:07,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:24:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-26 21:24:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 21:24:07,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:07,717 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:07,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 21:24:07,918 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-26 21:24:07,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:07,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451831576] [2019-11-26 21:24:07,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:08,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:24:08,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:08,283 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:08,398 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-26 21:24:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:09,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451831576] [2019-11-26 21:24:09,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:24:09,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-26 21:24:09,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035110587] [2019-11-26 21:24:09,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-26 21:24:09,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:09,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-26 21:24:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 21:24:09,278 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 34 states. [2019-11-26 21:24:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:10,060 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-11-26 21:24:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:24:10,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-26 21:24:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:10,062 INFO L225 Difference]: With dead ends: 162 [2019-11-26 21:24:10,062 INFO L226 Difference]: Without dead ends: 158 [2019-11-26 21:24:10,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-26 21:24:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-26 21:24:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-26 21:24:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-26 21:24:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 164 transitions. [2019-11-26 21:24:10,068 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 164 transitions. Word has length 51 [2019-11-26 21:24:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:10,069 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 164 transitions. [2019-11-26 21:24:10,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-26 21:24:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2019-11-26 21:24:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:24:10,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:10,070 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:10,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 21:24:10,274 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-26 21:24:10,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:10,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193681405] [2019-11-26 21:24:10,276 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:10,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:24:10,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:24:10,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:24:10,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:10,439 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-26 21:24:10,439 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:10,442 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:10,443 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:10,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:10,647 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:10,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193681405] [2019-11-26 21:24:10,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:10,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:24:10,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970616358] [2019-11-26 21:24:10,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:24:10,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:24:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:24:10,750 INFO L87 Difference]: Start difference. First operand 158 states and 164 transitions. Second operand 12 states. [2019-11-26 21:24:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:11,701 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2019-11-26 21:24:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:24:11,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-26 21:24:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:11,703 INFO L225 Difference]: With dead ends: 168 [2019-11-26 21:24:11,703 INFO L226 Difference]: Without dead ends: 168 [2019-11-26 21:24:11,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:24:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-26 21:24:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2019-11-26 21:24:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-26 21:24:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-26 21:24:11,708 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 53 [2019-11-26 21:24:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:11,709 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-26 21:24:11,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:24:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-26 21:24:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:24:11,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:11,710 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:11,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 21:24:11,917 INFO L410 AbstractCegarLoop]: === Iteration 15 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:11,917 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-26 21:24:11,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:11,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732580673] [2019-11-26 21:24:11,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:12,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:24:12,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:12,134 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-26 21:24:12,134 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:12,139 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:12,139 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:12,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:12,356 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:13,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732580673] [2019-11-26 21:24:13,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:13,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:24:13,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343311532] [2019-11-26 21:24:13,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:24:13,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:13,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:24:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:24:13,205 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 23 states. [2019-11-26 21:24:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:16,410 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2019-11-26 21:24:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:24:16,411 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-26 21:24:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:16,412 INFO L225 Difference]: With dead ends: 154 [2019-11-26 21:24:16,413 INFO L226 Difference]: Without dead ends: 154 [2019-11-26 21:24:16,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:24:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-26 21:24:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-26 21:24:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-26 21:24:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2019-11-26 21:24:16,419 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 53 [2019-11-26 21:24:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:16,419 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2019-11-26 21:24:16,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:24:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2019-11-26 21:24:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-26 21:24:16,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:16,421 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:16,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 21:24:16,634 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:16,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2141011139, now seen corresponding path program 1 times [2019-11-26 21:24:16,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:16,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303208720] [2019-11-26 21:24:16,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:16,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:24:16,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:16,873 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:17,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303208720] [2019-11-26 21:24:17,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-26 21:24:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741329152] [2019-11-26 21:24:17,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:24:17,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:24:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:24:17,024 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 8 states. [2019-11-26 21:24:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:17,076 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2019-11-26 21:24:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:24:17,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-26 21:24:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:17,079 INFO L225 Difference]: With dead ends: 156 [2019-11-26 21:24:17,079 INFO L226 Difference]: Without dead ends: 154 [2019-11-26 21:24:17,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:24:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-26 21:24:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-26 21:24:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-26 21:24:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2019-11-26 21:24:17,084 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 58 [2019-11-26 21:24:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:17,084 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2019-11-26 21:24:17,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:24:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2019-11-26 21:24:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 21:24:17,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:17,085 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:17,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 21:24:17,298 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1283825080, now seen corresponding path program 1 times [2019-11-26 21:24:17,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:17,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384051074] [2019-11-26 21:24:17,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:17,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:24:17,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:17,563 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:17,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384051074] [2019-11-26 21:24:17,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:17,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-26 21:24:17,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007468465] [2019-11-26 21:24:17,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:24:17,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:24:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:24:17,855 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 11 states. [2019-11-26 21:24:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:17,962 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-11-26 21:24:17,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:24:17,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-26 21:24:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:17,964 INFO L225 Difference]: With dead ends: 158 [2019-11-26 21:24:17,964 INFO L226 Difference]: Without dead ends: 154 [2019-11-26 21:24:17,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:24:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-26 21:24:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-26 21:24:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-26 21:24:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2019-11-26 21:24:17,979 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 63 [2019-11-26 21:24:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:17,980 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2019-11-26 21:24:17,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:24:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2019-11-26 21:24:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 21:24:17,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:17,981 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:18,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-26 21:24:18,183 INFO L410 AbstractCegarLoop]: === Iteration 18 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000591, now seen corresponding path program 1 times [2019-11-26 21:24:18,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:18,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876833046] [2019-11-26 21:24:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:18,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:24:18,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:18,416 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-26 21:24:18,416 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:18,419 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:18,419 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:18,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:18,670 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:18,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876833046] [2019-11-26 21:24:18,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:18,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-26 21:24:18,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130405302] [2019-11-26 21:24:18,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 21:24:18,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 21:24:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:24:18,869 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 17 states. [2019-11-26 21:24:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:20,310 INFO L93 Difference]: Finished difference Result 164 states and 167 transitions. [2019-11-26 21:24:20,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 21:24:20,310 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-26 21:24:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:20,312 INFO L225 Difference]: With dead ends: 164 [2019-11-26 21:24:20,312 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 21:24:20,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-26 21:24:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 21:24:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-26 21:24:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 21:24:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-11-26 21:24:20,318 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 74 [2019-11-26 21:24:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:20,318 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-11-26 21:24:20,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 21:24:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-11-26 21:24:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 21:24:20,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:20,320 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:20,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-26 21:24:20,533 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:20,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000592, now seen corresponding path program 1 times [2019-11-26 21:24:20,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:20,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150421124] [2019-11-26 21:24:20,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:20,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 21:24:20,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:20,769 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-26 21:24:20,769 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:20,779 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:20,779 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:20,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:21,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:23,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150421124] [2019-11-26 21:24:23,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:23,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-26 21:24:23,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791209019] [2019-11-26 21:24:23,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-26 21:24:23,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-26 21:24:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 21:24:23,111 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 33 states. [2019-11-26 21:24:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:27,754 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-11-26 21:24:27,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:24:27,755 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-26 21:24:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:27,756 INFO L225 Difference]: With dead ends: 150 [2019-11-26 21:24:27,756 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 21:24:27,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 21:24:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 21:24:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-26 21:24:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-26 21:24:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-11-26 21:24:27,762 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 74 [2019-11-26 21:24:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:27,762 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-11-26 21:24:27,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-26 21:24:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-11-26 21:24:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 21:24:27,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:27,764 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:24:27,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-26 21:24:27,976 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1519816277, now seen corresponding path program 1 times [2019-11-26 21:24:27,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:27,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475800759] [2019-11-26 21:24:27,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:28,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:24:28,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:28,293 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:28,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:28,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475800759] [2019-11-26 21:24:28,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:28,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-26 21:24:28,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628631288] [2019-11-26 21:24:28,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 21:24:28,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:28,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 21:24:28,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:24:28,550 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 14 states. [2019-11-26 21:24:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:28,707 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2019-11-26 21:24:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:24:28,707 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2019-11-26 21:24:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:28,709 INFO L225 Difference]: With dead ends: 156 [2019-11-26 21:24:28,709 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 21:24:28,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:24:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 21:24:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-26 21:24:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-26 21:24:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2019-11-26 21:24:28,714 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 85 [2019-11-26 21:24:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:28,715 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2019-11-26 21:24:28,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 21:24:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2019-11-26 21:24:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 21:24:28,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:28,716 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:28,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-26 21:24:28,923 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797402, now seen corresponding path program 1 times [2019-11-26 21:24:28,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:28,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295596125] [2019-11-26 21:24:28,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:29,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 21:24:29,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:29,201 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-26 21:24:29,201 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:29,202 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:29,203 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:29,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:29,533 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:29,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295596125] [2019-11-26 21:24:29,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:29,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-26 21:24:29,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145577101] [2019-11-26 21:24:29,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 21:24:29,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 21:24:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:24:29,785 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand 17 states. [2019-11-26 21:24:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:31,170 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2019-11-26 21:24:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:24:31,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-11-26 21:24:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:31,174 INFO L225 Difference]: With dead ends: 164 [2019-11-26 21:24:31,175 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 21:24:31,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-26 21:24:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 21:24:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2019-11-26 21:24:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-26 21:24:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-11-26 21:24:31,180 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 98 [2019-11-26 21:24:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:31,181 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-11-26 21:24:31,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 21:24:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-11-26 21:24:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 21:24:31,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:31,182 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:31,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-26 21:24:31,395 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797403, now seen corresponding path program 1 times [2019-11-26 21:24:31,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:31,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578278503] [2019-11-26 21:24:31,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:31,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 21:24:31,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:31,748 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-26 21:24:31,749 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:31,754 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:31,755 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:31,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:32,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:33,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578278503] [2019-11-26 21:24:33,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:33,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-26 21:24:33,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733834105] [2019-11-26 21:24:33,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-26 21:24:33,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:33,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-26 21:24:33,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 21:24:33,955 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 33 states. [2019-11-26 21:24:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:38,539 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2019-11-26 21:24:38,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:24:38,542 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2019-11-26 21:24:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:38,543 INFO L225 Difference]: With dead ends: 146 [2019-11-26 21:24:38,543 INFO L226 Difference]: Without dead ends: 146 [2019-11-26 21:24:38,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 158 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 21:24:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-26 21:24:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-26 21:24:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-26 21:24:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-11-26 21:24:38,547 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 98 [2019-11-26 21:24:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:38,548 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-11-26 21:24:38,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-26 21:24:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-11-26 21:24:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-26 21:24:38,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:38,550 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:38,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-26 21:24:38,761 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:38,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash -797927977, now seen corresponding path program 1 times [2019-11-26 21:24:38,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:38,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224196696] [2019-11-26 21:24:38,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:39,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 21:24:39,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:39,081 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:39,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224196696] [2019-11-26 21:24:39,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:39,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-26 21:24:39,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131071312] [2019-11-26 21:24:39,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:24:39,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:24:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:24:39,374 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 11 states. [2019-11-26 21:24:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:39,472 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-11-26 21:24:39,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:24:39,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-11-26 21:24:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:39,474 INFO L225 Difference]: With dead ends: 148 [2019-11-26 21:24:39,474 INFO L226 Difference]: Without dead ends: 146 [2019-11-26 21:24:39,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:24:39,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-26 21:24:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-26 21:24:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-26 21:24:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-11-26 21:24:39,479 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 96 [2019-11-26 21:24:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:39,479 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-11-26 21:24:39,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:24:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-11-26 21:24:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 21:24:39,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:39,481 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:39,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-26 21:24:39,692 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash 693754465, now seen corresponding path program 1 times [2019-11-26 21:24:39,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:39,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531978161] [2019-11-26 21:24:39,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:40,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-26 21:24:40,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:40,097 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-26 21:24:40,097 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:40,102 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:40,102 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:40,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:40,642 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:40,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531978161] [2019-11-26 21:24:40,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:40,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-26 21:24:40,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804859868] [2019-11-26 21:24:40,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-26 21:24:40,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-26 21:24:40,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-26 21:24:40,929 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 21 states. [2019-11-26 21:24:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:42,545 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2019-11-26 21:24:42,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 21:24:42,545 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2019-11-26 21:24:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:42,546 INFO L225 Difference]: With dead ends: 156 [2019-11-26 21:24:42,546 INFO L226 Difference]: Without dead ends: 156 [2019-11-26 21:24:42,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 191 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-26 21:24:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-26 21:24:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2019-11-26 21:24:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-26 21:24:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-11-26 21:24:42,551 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 111 [2019-11-26 21:24:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:42,551 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-11-26 21:24:42,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-26 21:24:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-11-26 21:24:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 21:24:42,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:42,553 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:42,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-26 21:24:42,763 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:42,764 INFO L82 PathProgramCache]: Analyzing trace with hash 693754466, now seen corresponding path program 1 times [2019-11-26 21:24:42,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:42,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458560850] [2019-11-26 21:24:42,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:43,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-26 21:24:43,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:43,162 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-26 21:24:43,163 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:43,170 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:43,171 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:43,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:43,986 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:46,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458560850] [2019-11-26 21:24:46,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:46,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-26 21:24:46,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252652906] [2019-11-26 21:24:46,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-26 21:24:46,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-26 21:24:46,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-26 21:24:46,443 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 41 states. [2019-11-26 21:24:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:51,708 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-11-26 21:24:51,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 21:24:51,709 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 111 [2019-11-26 21:24:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:51,710 INFO L225 Difference]: With dead ends: 142 [2019-11-26 21:24:51,710 INFO L226 Difference]: Without dead ends: 142 [2019-11-26 21:24:51,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-26 21:24:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-26 21:24:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-26 21:24:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-26 21:24:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-11-26 21:24:51,715 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 111 [2019-11-26 21:24:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:51,716 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-11-26 21:24:51,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-26 21:24:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-11-26 21:24:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 21:24:51,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:51,718 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:51,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-26 21:24:51,918 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash 256905644, now seen corresponding path program 1 times [2019-11-26 21:24:51,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:51,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099927578] [2019-11-26 21:24:51,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:52,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:24:52,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:53,158 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:53,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099927578] [2019-11-26 21:24:53,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:53,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-26 21:24:53,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558368244] [2019-11-26 21:24:53,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-26 21:24:53,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:53,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-26 21:24:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-26 21:24:53,975 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 40 states. [2019-11-26 21:24:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:56,563 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-11-26 21:24:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 21:24:56,564 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2019-11-26 21:24:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:56,565 INFO L225 Difference]: With dead ends: 141 [2019-11-26 21:24:56,565 INFO L226 Difference]: Without dead ends: 141 [2019-11-26 21:24:56,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-26 21:24:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-26 21:24:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-11-26 21:24:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-26 21:24:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2019-11-26 21:24:56,569 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 114 [2019-11-26 21:24:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:56,569 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2019-11-26 21:24:56,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-26 21:24:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2019-11-26 21:24:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-26 21:24:56,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:56,571 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:56,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-26 21:24:56,772 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash -155348315, now seen corresponding path program 1 times [2019-11-26 21:24:56,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:56,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056181121] [2019-11-26 21:24:56,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:57,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-26 21:24:57,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:57,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-26 21:24:57,410 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,420 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:57,420 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-26 21:24:57,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:57,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-26 21:24:57,489 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,525 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-26 21:24:57,526 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-26 21:25:10,045 WARN L192 SmtUtils]: Spent 12.45 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-26 21:25:10,045 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-26 21:25:10,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 81 [2019-11-26 21:25:10,047 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:25:10,108 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-26 21:25:10,109 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:10,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-26 21:25:10,246 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-26 21:25:10,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-26 21:25:10,247 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:25:10,279 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:25:10,279 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:10,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-26 21:25:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:25:11,346 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:25:11,768 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:25:13,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:15,852 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:25:15,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:25:15,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:25:16,092 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-26 21:25:16,093 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-26 21:25:16,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-26 21:25:16,101 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-26 21:25:16,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-26 21:25:16,102 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:25:16,103 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:25:16,103 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:16,104 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:25:16,104 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:16,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-26 21:25:17,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:25:17,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:25:18,424 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-26 21:25:18,425 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-26 21:25:18,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-26 21:25:18,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,658 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-26 21:25:18,659 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-26 21:25:18,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-26 21:25:18,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:18,667 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:25:18,927 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-26 21:25:18,928 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-26 21:25:18,928 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:18,984 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-26 21:25:18,984 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:18,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-26 21:25:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:25:20,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056181121] [2019-11-26 21:25:20,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:25:20,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-26 21:25:20,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580391729] [2019-11-26 21:25:20,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-26 21:25:20,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:25:20,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-26 21:25:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-26 21:25:20,771 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 55 states. [2019-11-26 21:25:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:25:30,542 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-26 21:25:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-26 21:25:30,543 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2019-11-26 21:25:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:25:30,543 INFO L225 Difference]: With dead ends: 60 [2019-11-26 21:25:30,544 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 21:25:30,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-26 21:25:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 21:25:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 21:25:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 21:25:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 21:25:30,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-11-26 21:25:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:25:30,546 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 21:25:30,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-26 21:25:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 21:25:30,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 21:25:30,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-26 21:25:30,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 09:25:30 BoogieIcfgContainer [2019-11-26 21:25:30,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 21:25:30,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 21:25:30,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 21:25:30,756 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 21:25:30,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:52" (3/4) ... [2019-11-26 21:25:30,766 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 21:25:30,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-26 21:25:30,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:25:30,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-26 21:25:30,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-26 21:25:30,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-26 21:25:30,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-26 21:25:30,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_get [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-26 21:25:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-26 21:25:30,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_put [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-26 21:25:30,777 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-26 21:25:30,786 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2019-11-26 21:25:30,787 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-26 21:25:30,787 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:25:30,787 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:25:30,788 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 21:25:30,860 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 21:25:30,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 21:25:30,862 INFO L168 Benchmark]: Toolchain (without parser) took 101222.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 517.5 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -295.4 MB). Peak memory consumption was 222.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:25:30,862 INFO L168 Benchmark]: CDTParser took 0.28 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-26 21:25:30,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-26 21:25:30,863 INFO L168 Benchmark]: Boogie Preprocessor took 112.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:25:30,863 INFO L168 Benchmark]: RCFGBuilder took 1621.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.6 MB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:25:30,864 INFO L168 Benchmark]: TraceAbstraction took 98563.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 989.6 MB in the beginning and 1.2 GB in the end (delta: -258.1 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. [2019-11-26 21:25:30,864 INFO L168 Benchmark]: Witness Printer took 104.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 93.6 kB). Peak memory consumption was 93.6 kB. Max. memory is 11.5 GB. [2019-11-26 21:25:30,873 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 812.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1621.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.6 MB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98563.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 989.6 MB in the beginning and 1.2 GB in the end (delta: -258.1 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. * Witness Printer took 104.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 93.6 kB). Peak memory consumption was 93.6 kB. 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: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 341 locations, 71 error locations. Result: SAFE, OverallTime: 98.4s, OverallIterations: 27, TraceHistogramMax: 16, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3350 SDtfs, 1546 SDslu, 28036 SDs, 0 SdLazy, 15114 SolverSat, 429 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3323 GetRequests, 2739 SyntacticMatches, 67 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 25.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred 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.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 97 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 42.6s InterpolantComputationTime, 1631 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3208 ConstructedInterpolants, 503 QuantifiedInterpolants, 1103791 SizeOfPredicates, 171 NumberOfNonLiveVariables, 6904 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 3788/4318 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...