./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version de1bb103 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_5.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 fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd ............................................................................................................................ 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_5.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 fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-de1bb10 [2019-11-27 13:24:27,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:24:27,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:24:27,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:24:27,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:24:27,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:24:27,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:24:27,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:24:27,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:24:27,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:24:27,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:24:27,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:24:27,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:24:27,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:24:27,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:24:27,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:24:27,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:24:27,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:24:27,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:24:27,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:24:27,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:24:27,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:24:27,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:24:27,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:24:27,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:24:27,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:24:27,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:24:27,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:24:27,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:24:27,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:24:27,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:24:27,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:24:27,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:24:27,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:24:27,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:24:27,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:24:27,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:24:27,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:24:27,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:24:27,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:24:27,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:24:27,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 13:24:27,612 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:24:27,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:24:27,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:24:27,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:24:27,615 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:24:27,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:24:27,615 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:24:27,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 13:24:27,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 13:24:27,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:24:27,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:24:27,616 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 13:24:27,617 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 13:24:27,617 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 13:24:27,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:24:27,618 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 13:24:27,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:24:27,618 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:24:27,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:24:27,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:24:27,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:24:27,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:24:27,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:24:27,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:24:27,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:24:27,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 13:24:27,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 13:24:27,621 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 -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-27 13:24:27,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:24:27,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:24:27,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:24:27,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:24:27,982 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:24:27,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 13:24:28,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68baeab45/cc960d37e431427cadd741cc7c4d0c66/FLAGcf40835b0 [2019-11-27 13:24:28,497 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:24:28,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 13:24:28,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68baeab45/cc960d37e431427cadd741cc7c4d0c66/FLAGcf40835b0 [2019-11-27 13:24:28,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68baeab45/cc960d37e431427cadd741cc7c4d0c66 [2019-11-27 13:24:28,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:24:28,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 13:24:28,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:28,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:24:28,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:24:28,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:28" (1/1) ... [2019-11-27 13:24:28,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1900eb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:28, skipping insertion in model container [2019-11-27 13:24:28,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:28" (1/1) ... [2019-11-27 13:24:28,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:24:28,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:24:29,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:29,427 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-27 13:24:29,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66871229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:29, skipping insertion in model container [2019-11-27 13:24:29,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:29,429 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 13:24:29,432 INFO L168 Benchmark]: Toolchain (without parser) took 642.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-27 13:24:29,433 INFO L168 Benchmark]: CDTParser took 0.25 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-27 13:24:29,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-27 13:24:29,436 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.25 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 639.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 20.9 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-de1bb10 [2019-11-27 13:24:31,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:24:31,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:24:31,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:24:31,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:24:31,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:24:31,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:24:31,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:24:31,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:24:31,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:24:31,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:24:31,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:24:31,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:24:31,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:24:31,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:24:31,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:24:31,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:24:31,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:24:31,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:24:31,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:24:31,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:24:31,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:24:31,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:24:31,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:24:31,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:24:31,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:24:31,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:24:31,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:24:31,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:24:31,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:24:31,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:24:31,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:24:31,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:24:31,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:24:31,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:24:31,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:24:31,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:24:31,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:24:31,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:24:31,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:24:31,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:24:31,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 13:24:31,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:24:31,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:24:31,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:24:31,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:24:31,281 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:24:31,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:24:31,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:24:31,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 13:24:31,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 13:24:31,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:24:31,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:24:31,283 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 13:24:31,283 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 13:24:31,284 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 13:24:31,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:24:31,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 13:24:31,285 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 13:24:31,285 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 13:24:31,285 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:24:31,285 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:24:31,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:24:31,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:24:31,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:24:31,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:24:31,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:24:31,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:24:31,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:24:31,288 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 13:24:31,288 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 13:24:31,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 13:24:31,289 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 -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-27 13:24:31,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:24:31,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:24:31,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:24:31,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:24:31,602 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:24:31,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 13:24:31,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd6b3d90/f7828db78c164bff8b7cfffd2ec7d202/FLAGe62761713 [2019-11-27 13:24:32,255 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:24:32,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-27 13:24:32,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd6b3d90/f7828db78c164bff8b7cfffd2ec7d202/FLAGe62761713 [2019-11-27 13:24:32,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd6b3d90/f7828db78c164bff8b7cfffd2ec7d202 [2019-11-27 13:24:32,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:24:32,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 13:24:32,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:32,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:24:32,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:24:32,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:32" (1/1) ... [2019-11-27 13:24:32,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52957880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:32, skipping insertion in model container [2019-11-27 13:24:32,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:24:32" (1/1) ... [2019-11-27 13:24:32,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:24:32,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:24:33,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:33,195 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 13:24:33,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:24:33,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:33,309 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 13:24:33,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:24:33,480 INFO L208 MainTranslator]: Completed translation [2019-11-27 13:24:33,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33 WrapperNode [2019-11-27 13:24:33,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:24:33,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 13:24:33,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 13:24:33,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 13:24:33,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (1/1) ... [2019-11-27 13:24:33,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (1/1) ... [2019-11-27 13:24:33,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (1/1) ... [2019-11-27 13:24:33,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (1/1) ... [2019-11-27 13:24:33,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (1/1) ... [2019-11-27 13:24:33,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (1/1) ... [2019-11-27 13:24:33,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (1/1) ... [2019-11-27 13:24:33,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 13:24:33,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 13:24:33,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 13:24:33,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 13:24:33,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (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-27 13:24:33,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 13:24:33,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 13:24:33,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 13:24:33,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:24:33,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 13:24:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 13:24:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-27 13:24:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-27 13:24:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-27 13:24:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-27 13:24:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-27 13:24:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-27 13:24:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-27 13:24:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-27 13:24:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-27 13:24:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-27 13:24:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-27 13:24:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-27 13:24:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-27 13:24:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-27 13:24:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-27 13:24:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-27 13:24:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-27 13:24:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-27 13:24:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-27 13:24:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-27 13:24:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-27 13:24:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-27 13:24:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-27 13:24:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-27 13:24:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-27 13:24:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-27 13:24:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-27 13:24:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-27 13:24:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-27 13:24:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-27 13:24:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-27 13:24:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-27 13:24:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-27 13:24:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-27 13:24:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-27 13:24:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-27 13:24:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-27 13:24:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-27 13:24:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-27 13:24:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 13:24:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-27 13:24:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 13:24:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-27 13:24:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 13:24:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 13:24:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 13:24:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 13:24:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 13:24:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 13:24:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 13:24:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 13:24:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 13:24:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 13:24:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 13:24:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 13:24:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 13:24:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 13:24:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 13:24:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 13:24:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 13:24:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 13:24:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-27 13:24:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-27 13:24:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-27 13:24:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 13:24:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 13:24:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 13:24:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 13:24:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 13:24:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 13:24:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 13:24:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 13:24:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 13:24:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 13:24:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 13:24:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 13:24:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 13:24:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 13:24:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 13:24:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 13:24:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 13:24:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 13:24:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 13:24:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 13:24:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 13:24:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 13:24:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 13:24:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 13:24:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 13:24:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 13:24:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 13:24:33,674 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 13:24:33,674 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 13:24:33,674 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 13:24:33,674 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 13:24:33,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 13:24:33,674 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 13:24:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 13:24:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 13:24:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 13:24:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 13:24:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 13:24:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 13:24:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 13:24:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 13:24:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 13:24:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 13:24:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 13:24:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 13:24:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 13:24:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 13:24:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 13:24:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 13:24:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 13:24:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 13:24:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 13:24:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 13:24:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 13:24:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 13:24:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 13:24:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 13:24:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 13:24:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 13:24:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 13:24:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 13:24:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 13:24:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 13:24:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 13:24:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 13:24:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 13:24:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 13:24:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 13:24:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 13:24:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 13:24:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 13:24:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 13:24:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 13:24:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 13:24:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 13:24:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 13:24:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 13:24:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 13:24:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 13:24:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 13:24:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 13:24:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 13:24:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 13:24:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 13:24:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 13:24:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 13:24:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-27 13:24:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 13:24:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-27 13:24:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-27 13:24:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-27 13:24:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-27 13:24:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-27 13:24:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 13:24:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-27 13:24:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 13:24:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-27 13:24:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 13:24:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-27 13:24:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-27 13:24:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-27 13:24:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 13:24:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-27 13:24:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-27 13:24:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-27 13:24:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-27 13:24:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-27 13:24:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-27 13:24:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 13:24:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-27 13:24:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-27 13:24:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-27 13:24:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-27 13:24:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-27 13:24:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 13:24:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 13:24:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-27 13:24:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-27 13:24:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 13:24:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-27 13:24:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-27 13:24:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-27 13:24:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-27 13:24:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-27 13:24:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-27 13:24:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-27 13:24:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-27 13:24:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-27 13:24:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-27 13:24:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-27 13:24:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-27 13:24:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-27 13:24:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-27 13:24:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-27 13:24:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-27 13:24:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-27 13:24:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 13:24:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 13:24:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 13:24:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 13:24:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 13:24:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:24:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-27 13:24:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-27 13:24:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-27 13:24:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-27 13:24:34,378 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 13:24:34,769 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 13:24:35,115 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 13:24:35,115 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-27 13:24:35,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:24:35 BoogieIcfgContainer [2019-11-27 13:24:35,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 13:24:35,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 13:24:35,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 13:24:35,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 13:24:35,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 01:24:32" (1/3) ... [2019-11-27 13:24:35,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d7f859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:24:35, skipping insertion in model container [2019-11-27 13:24:35,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:24:33" (2/3) ... [2019-11-27 13:24:35,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d7f859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:24:35, skipping insertion in model container [2019-11-27 13:24:35,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:24:35" (3/3) ... [2019-11-27 13:24:35,129 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2019-11-27 13:24:35,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 13:24:35,154 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-27 13:24:35,168 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-27 13:24:35,194 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 13:24:35,194 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 13:24:35,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 13:24:35,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 13:24:35,195 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 13:24:35,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 13:24:35,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 13:24:35,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 13:24:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-11-27 13:24:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 13:24:35,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:35,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:35,246 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-27 13:24:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-27 13:24:35,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:35,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682452950] [2019-11-27 13:24:35,268 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-27 13:24:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:35,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:24:35,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:35,579 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-27 13:24:35,579 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:35,590 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:35,590 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:35,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:35,618 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-27 13:24:35,619 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:35,675 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-27 13:24:35,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682452950] [2019-11-27 13:24:35,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:35,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 13:24:35,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325495469] [2019-11-27 13:24:35,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:24:35,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:35,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:24:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:24:35,703 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-11-27 13:24:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:36,007 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2019-11-27 13:24:36,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:24:36,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 13:24:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:36,022 INFO L225 Difference]: With dead ends: 137 [2019-11-27 13:24:36,022 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 13:24:36,024 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-27 13:24:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 13:24:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2019-11-27 13:24:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-27 13:24:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2019-11-27 13:24:36,080 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 17 [2019-11-27 13:24:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:36,081 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2019-11-27 13:24:36,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:24:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2019-11-27 13:24:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 13:24:36,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:36,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:36,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 13:24:36,285 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-27 13:24:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:36,286 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-27 13:24:36,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:36,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334782469] [2019-11-27 13:24:36,289 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-27 13:24:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:36,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 13:24:36,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:36,446 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-27 13:24:36,446 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:36,456 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:36,456 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:36,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:24:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:36,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:36,842 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-27 13:24:36,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334782469] [2019-11-27 13:24:36,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:36,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 13:24:36,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253393527] [2019-11-27 13:24:36,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 13:24:36,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 13:24:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:24:36,847 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 10 states. [2019-11-27 13:24:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:37,517 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-27 13:24:37,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:24:37,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-27 13:24:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:37,526 INFO L225 Difference]: With dead ends: 133 [2019-11-27 13:24:37,526 INFO L226 Difference]: Without dead ends: 133 [2019-11-27 13:24:37,527 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-27 13:24:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-27 13:24:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2019-11-27 13:24:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-27 13:24:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2019-11-27 13:24:37,546 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 17 [2019-11-27 13:24:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:37,547 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2019-11-27 13:24:37,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 13:24:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2019-11-27 13:24:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 13:24:37,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:37,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:37,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 13:24:37,755 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-27 13:24:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-27 13:24:37,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:37,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181419990] [2019-11-27 13:24:37,757 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-27 13:24:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:37,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 13:24:37,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:37,931 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-27 13:24:37,933 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:37,970 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-27 13:24:37,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181419990] [2019-11-27 13:24:37,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:37,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 13:24:37,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555353313] [2019-11-27 13:24:37,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:24:37,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:24:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:24:37,973 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 5 states. [2019-11-27 13:24:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:38,006 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-27 13:24:38,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:24:38,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 13:24:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:38,010 INFO L225 Difference]: With dead ends: 127 [2019-11-27 13:24:38,010 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 13:24:38,010 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-27 13:24:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 13:24:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-27 13:24:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-27 13:24:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-11-27 13:24:38,021 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 17 [2019-11-27 13:24:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:38,022 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-11-27 13:24:38,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:24:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-11-27 13:24:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 13:24:38,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:38,024 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] [2019-11-27 13:24:38,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 13:24:38,244 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-27 13:24:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash -811306797, now seen corresponding path program 1 times [2019-11-27 13:24:38,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:38,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746441012] [2019-11-27 13:24:38,246 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-27 13:24:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:38,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:24:38,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:38,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-27 13:24:38,429 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:38,519 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-27 13:24:38,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746441012] [2019-11-27 13:24:38,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:38,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 13:24:38,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341983656] [2019-11-27 13:24:38,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:24:38,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:24:38,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:24:38,521 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2019-11-27 13:24:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:38,553 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2019-11-27 13:24:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:24:38,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-27 13:24:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:38,557 INFO L225 Difference]: With dead ends: 127 [2019-11-27 13:24:38,557 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 13:24:38,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-27 13:24:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 13:24:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-27 13:24:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-27 13:24:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-27 13:24:38,571 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 31 [2019-11-27 13:24:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:38,572 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-27 13:24:38,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:24:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-27 13:24:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 13:24:38,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:38,576 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] [2019-11-27 13:24:38,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 13:24:38,777 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-27 13:24:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:38,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1220131022, now seen corresponding path program 1 times [2019-11-27 13:24:38,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:38,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321581748] [2019-11-27 13:24:38,778 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-27 13:24:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:38,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 13:24:38,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:39,054 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-27 13:24:39,054 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:39,098 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-27 13:24:39,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321581748] [2019-11-27 13:24:39,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:39,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-27 13:24:39,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084682710] [2019-11-27 13:24:39,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 13:24:39,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:39,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 13:24:39,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 13:24:39,100 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 9 states. [2019-11-27 13:24:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:39,226 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-11-27 13:24:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 13:24:39,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-27 13:24:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:39,228 INFO L225 Difference]: With dead ends: 142 [2019-11-27 13:24:39,229 INFO L226 Difference]: Without dead ends: 142 [2019-11-27 13:24:39,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 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-27 13:24:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-27 13:24:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-11-27 13:24:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-27 13:24:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-27 13:24:39,242 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 31 [2019-11-27 13:24:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:39,242 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-27 13:24:39,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 13:24:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-27 13:24:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 13:24:39,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:39,244 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-27 13:24:39,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 13:24:39,458 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-27 13:24:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-27 13:24:39,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:39,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820439368] [2019-11-27 13:24:39,459 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-27 13:24:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:39,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 13:24:39,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:39,622 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-27 13:24:39,622 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:24:39,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820439368] [2019-11-27 13:24:39,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:39,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 13:24:39,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856504744] [2019-11-27 13:24:39,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 13:24:39,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:39,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 13:24:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:24:39,675 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 6 states. [2019-11-27 13:24:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:39,725 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-27 13:24:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:24:39,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 13:24:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:39,728 INFO L225 Difference]: With dead ends: 144 [2019-11-27 13:24:39,728 INFO L226 Difference]: Without dead ends: 140 [2019-11-27 13:24:39,728 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-27 13:24:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-27 13:24:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-27 13:24:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-27 13:24:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2019-11-27 13:24:39,750 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2019-11-27 13:24:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:39,751 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2019-11-27 13:24:39,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 13:24:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2019-11-27 13:24:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 13:24:39,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:39,752 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-27 13:24:39,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 13:24:39,969 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-27 13:24:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-27 13:24:39,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:39,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711491053] [2019-11-27 13:24:39,970 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-27 13:24:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:40,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:24:40,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:40,155 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-27 13:24:40,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:40,306 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-27 13:24:40,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711491053] [2019-11-27 13:24:40,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:24:40,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 13:24:40,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671183423] [2019-11-27 13:24:40,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 13:24:40,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 13:24:40,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:24:40,309 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 10 states. [2019-11-27 13:24:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:40,550 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2019-11-27 13:24:40,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 13:24:40,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-27 13:24:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:40,553 INFO L225 Difference]: With dead ends: 148 [2019-11-27 13:24:40,553 INFO L226 Difference]: Without dead ends: 144 [2019-11-27 13:24:40,555 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-27 13:24:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-27 13:24:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-27 13:24:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 13:24:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-27 13:24:40,571 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2019-11-27 13:24:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:40,572 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-27 13:24:40,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 13:24:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-27 13:24:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 13:24:40,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:40,579 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:24:40,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 13:24:40,784 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-27 13:24:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash 780110635, now seen corresponding path program 1 times [2019-11-27 13:24:40,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:40,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792942117] [2019-11-27 13:24:40,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:40,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-27 13:24:40,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 13:24:40,950 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 13:24:41,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792942117] [2019-11-27 13:24:41,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:41,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 13:24:41,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562008404] [2019-11-27 13:24:41,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 13:24:41,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:41,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 13:24:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 13:24:41,274 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 3 states. [2019-11-27 13:24:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:41,444 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-11-27 13:24:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 13:24:41,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 13:24:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:41,446 INFO L225 Difference]: With dead ends: 157 [2019-11-27 13:24:41,446 INFO L226 Difference]: Without dead ends: 137 [2019-11-27 13:24:41,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-27 13:24:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-27 13:24:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2019-11-27 13:24:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 13:24:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-27 13:24:41,456 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 36 [2019-11-27 13:24:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:41,458 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-27 13:24:41,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 13:24:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-27 13:24:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 13:24:41,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:41,466 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-27 13:24:41,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 13:24:41,667 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-27 13:24:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:41,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-27 13:24:41,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:41,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712804699] [2019-11-27 13:24:41,669 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 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-27 13:24:41,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 13:24:41,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:24:41,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 13:24:41,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:41,819 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-27 13:24:41,819 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:41,821 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:41,821 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:41,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:41,979 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-27 13:24:41,979 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:42,048 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-27 13:24:42,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712804699] [2019-11-27 13:24:42,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:42,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 13:24:42,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470845023] [2019-11-27 13:24:42,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 13:24:42,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 13:24:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 13:24:42,050 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 12 states. [2019-11-27 13:24:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:42,991 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-27 13:24:42,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 13:24:42,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-27 13:24:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:42,993 INFO L225 Difference]: With dead ends: 152 [2019-11-27 13:24:42,993 INFO L226 Difference]: Without dead ends: 152 [2019-11-27 13:24:42,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 13:24:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-27 13:24:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2019-11-27 13:24:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-27 13:24:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2019-11-27 13:24:43,001 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 38 [2019-11-27 13:24:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:43,002 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2019-11-27 13:24:43,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 13:24:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2019-11-27 13:24:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 13:24:43,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:43,003 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-27 13:24:43,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 13:24:43,214 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-27 13:24:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-27 13:24:43,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:43,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868461341] [2019-11-27 13:24:43,216 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-27 13:24:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:43,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 13:24:43,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:43,467 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-27 13:24:43,468 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:43,830 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-27 13:24:43,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868461341] [2019-11-27 13:24:43,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:24:43,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 13:24:43,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494909386] [2019-11-27 13:24:43,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 13:24:43,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 13:24:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-27 13:24:43,832 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 18 states. [2019-11-27 13:24:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:44,712 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-27 13:24:44,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 13:24:44,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-27 13:24:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:44,715 INFO L225 Difference]: With dead ends: 138 [2019-11-27 13:24:44,715 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 13:24:44,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-27 13:24:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 13:24:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-27 13:24:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-27 13:24:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2019-11-27 13:24:44,721 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 38 [2019-11-27 13:24:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:44,721 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2019-11-27 13:24:44,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 13:24:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2019-11-27 13:24:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 13:24:44,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:44,722 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-27 13:24:44,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 13:24:44,927 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-27 13:24:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-27 13:24:44,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:44,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112216117] [2019-11-27 13:24:44,929 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:45,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 13:24:45,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:24:45,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 13:24:45,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:45,087 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-27 13:24:45,088 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:45,101 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:45,101 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:45,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:24:45,352 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-27 13:24:45,352 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:46,244 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-27 13:24:46,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112216117] [2019-11-27 13:24:46,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:46,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 13:24:46,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756763830] [2019-11-27 13:24:46,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 13:24:46,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:46,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 13:24:46,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 13:24:46,247 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 23 states. [2019-11-27 13:24:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:48,762 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-11-27 13:24:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 13:24:48,763 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-27 13:24:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:48,764 INFO L225 Difference]: With dead ends: 133 [2019-11-27 13:24:48,764 INFO L226 Difference]: Without dead ends: 133 [2019-11-27 13:24:48,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-27 13:24:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-27 13:24:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-27 13:24:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-27 13:24:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-27 13:24:48,771 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 46 [2019-11-27 13:24:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:48,771 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-27 13:24:48,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 13:24:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-27 13:24:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-27 13:24:48,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:48,772 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-27 13:24:48,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 13:24:48,983 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-27 13:24:48,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-27 13:24:48,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:48,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788557371] [2019-11-27 13:24:48,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 13:24:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:49,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 13:24:49,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:49,388 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-27 13:24:49,388 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:49,499 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-27 13:24:50,322 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-27 13:24:50,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788557371] [2019-11-27 13:24:50,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:24:50,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-27 13:24:50,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099959428] [2019-11-27 13:24:50,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-27 13:24:50,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-27 13:24:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 13:24:50,326 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 34 states. [2019-11-27 13:24:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:51,092 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-27 13:24:51,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 13:24:51,093 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-27 13:24:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:51,095 INFO L225 Difference]: With dead ends: 139 [2019-11-27 13:24:51,095 INFO L226 Difference]: Without dead ends: 135 [2019-11-27 13:24:51,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-27 13:24:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-27 13:24:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-27 13:24:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-27 13:24:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2019-11-27 13:24:51,101 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 51 [2019-11-27 13:24:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:51,102 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2019-11-27 13:24:51,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-27 13:24:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2019-11-27 13:24:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 13:24:51,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:51,103 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-27 13:24:51,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 13:24:51,315 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-27 13:24:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-27 13:24:51,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:51,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345045474] [2019-11-27 13:24:51,316 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 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-27 13:24:51,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 13:24:51,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:24:51,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 13:24:51,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:51,462 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-27 13:24:51,462 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:51,464 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:51,464 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:51,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:51,624 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-27 13:24:51,624 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:51,686 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-27 13:24:51,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345045474] [2019-11-27 13:24:51,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:51,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 13:24:51,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546016376] [2019-11-27 13:24:51,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 13:24:51,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:51,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 13:24:51,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 13:24:51,689 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 12 states. [2019-11-27 13:24:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:52,556 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-11-27 13:24:52,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 13:24:52,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-27 13:24:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:52,558 INFO L225 Difference]: With dead ends: 159 [2019-11-27 13:24:52,558 INFO L226 Difference]: Without dead ends: 159 [2019-11-27 13:24:52,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 13:24:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-27 13:24:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2019-11-27 13:24:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-27 13:24:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-27 13:24:52,566 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 53 [2019-11-27 13:24:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:52,566 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-27 13:24:52,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 13:24:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-27 13:24:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 13:24:52,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:52,567 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-27 13:24:52,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 13:24:52,775 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-27 13:24:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-27 13:24:52,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:52,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348351004] [2019-11-27 13:24:52,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 13:24:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:52,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 13:24:52,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:53,008 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-27 13:24:53,008 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:53,014 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:53,014 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:53,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:24:53,281 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-27 13:24:53,281 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:54,086 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-27 13:24:54,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348351004] [2019-11-27 13:24:54,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:54,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 13:24:54,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521954745] [2019-11-27 13:24:54,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 13:24:54,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:54,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 13:24:54,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 13:24:54,089 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 23 states. [2019-11-27 13:24:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:56,282 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2019-11-27 13:24:56,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 13:24:56,283 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-27 13:24:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:56,285 INFO L225 Difference]: With dead ends: 131 [2019-11-27 13:24:56,285 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 13:24:56,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-27 13:24:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 13:24:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-27 13:24:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-27 13:24:56,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-27 13:24:56,291 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 53 [2019-11-27 13:24:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:56,291 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-27 13:24:56,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 13:24:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-27 13:24:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-27 13:24:56,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:56,293 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] [2019-11-27 13:24:56,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 13:24:56,495 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-27 13:24:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1848313328, now seen corresponding path program 1 times [2019-11-27 13:24:56,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:56,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408444307] [2019-11-27 13:24:56,497 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-27 13:24:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:56,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 13:24:56,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:56,721 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-27 13:24:56,721 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:56,858 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-27 13:24:56,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408444307] [2019-11-27 13:24:56,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:56,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-27 13:24:56,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670251137] [2019-11-27 13:24:56,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 13:24:56,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 13:24:56,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 13:24:56,860 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 8 states. [2019-11-27 13:24:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:56,913 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-27 13:24:56,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 13:24:56,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-27 13:24:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:56,915 INFO L225 Difference]: With dead ends: 133 [2019-11-27 13:24:56,915 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 13:24:56,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 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-27 13:24:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 13:24:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-27 13:24:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-27 13:24:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-11-27 13:24:56,920 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 60 [2019-11-27 13:24:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:56,921 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-11-27 13:24:56,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 13:24:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-11-27 13:24:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-27 13:24:56,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:56,922 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] [2019-11-27 13:24:57,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 13:24:57,132 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-27 13:24:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1123996245, now seen corresponding path program 1 times [2019-11-27 13:24:57,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:57,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420819846] [2019-11-27 13:24:57,133 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-27 13:24:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:57,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 13:24:57,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:57,401 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-27 13:24:57,401 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:57,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:24:57,656 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-27 13:24:57,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420819846] [2019-11-27 13:24:57,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:57,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-27 13:24:57,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681321732] [2019-11-27 13:24:57,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 13:24:57,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:57,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 13:24:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 13:24:57,659 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 11 states. [2019-11-27 13:24:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:24:57,765 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-11-27 13:24:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 13:24:57,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-27 13:24:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:24:57,766 INFO L225 Difference]: With dead ends: 135 [2019-11-27 13:24:57,767 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 13:24:57,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 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-27 13:24:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 13:24:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-27 13:24:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-27 13:24:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-11-27 13:24:57,773 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 65 [2019-11-27 13:24:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:24:57,773 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-11-27 13:24:57,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 13:24:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-11-27 13:24:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-27 13:24:57,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:24:57,775 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] [2019-11-27 13:24:57,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 13:24:57,988 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-27 13:24:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:24:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash -638447166, now seen corresponding path program 1 times [2019-11-27 13:24:57,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:24:57,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124665294] [2019-11-27 13:24:57,989 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-27 13:24:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:24:58,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-27 13:24:58,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:24:58,227 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-27 13:24:58,227 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:24:58,229 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:24:58,229 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:24:58,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:24:58,502 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-27 13:24:58,502 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:24:58,724 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-27 13:24:58,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124665294] [2019-11-27 13:24:58,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:24:58,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 18 [2019-11-27 13:24:58,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387760173] [2019-11-27 13:24:58,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 13:24:58,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:24:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 13:24:58,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-27 13:24:58,727 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 19 states. [2019-11-27 13:25:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:00,284 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2019-11-27 13:25:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 13:25:00,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2019-11-27 13:25:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:00,288 INFO L225 Difference]: With dead ends: 183 [2019-11-27 13:25:00,288 INFO L226 Difference]: Without dead ends: 183 [2019-11-27 13:25:00,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-27 13:25:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-27 13:25:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2019-11-27 13:25:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 13:25:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2019-11-27 13:25:00,297 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 76 [2019-11-27 13:25:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:00,298 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2019-11-27 13:25:00,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 13:25:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2019-11-27 13:25:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-27 13:25:00,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:00,299 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] [2019-11-27 13:25:00,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 13:25:00,512 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-27 13:25:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:00,513 INFO L82 PathProgramCache]: Analyzing trace with hash -638447165, now seen corresponding path program 1 times [2019-11-27 13:25:00,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:00,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185101093] [2019-11-27 13:25:00,514 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-27 13:25:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:00,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-27 13:25:00,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:00,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-27 13:25:00,770 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:00,776 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:00,777 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:00,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:25:01,345 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-27 13:25:01,345 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:03,683 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-27 13:25:03,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185101093] [2019-11-27 13:25:03,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:03,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 18] imperfect sequences [] total 36 [2019-11-27 13:25:03,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943312516] [2019-11-27 13:25:03,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-27 13:25:03,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-27 13:25:03,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2019-11-27 13:25:03,686 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 37 states. [2019-11-27 13:25:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:08,333 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2019-11-27 13:25:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 13:25:08,334 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-11-27 13:25:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:08,335 INFO L225 Difference]: With dead ends: 155 [2019-11-27 13:25:08,335 INFO L226 Difference]: Without dead ends: 155 [2019-11-27 13:25:08,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2019-11-27 13:25:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-27 13:25:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-27 13:25:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-27 13:25:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2019-11-27 13:25:08,343 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 76 [2019-11-27 13:25:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:08,343 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2019-11-27 13:25:08,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-27 13:25:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2019-11-27 13:25:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 13:25:08,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:08,345 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 13:25:08,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 13:25:08,554 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-27 13:25:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:08,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1131008798, now seen corresponding path program 1 times [2019-11-27 13:25:08,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:08,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432790229] [2019-11-27 13:25:08,556 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-27 13:25:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:08,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 13:25:08,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 13:25:08,896 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:08,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 13:25:09,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432790229] [2019-11-27 13:25:09,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:09,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-27 13:25:09,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163237397] [2019-11-27 13:25:09,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 13:25:09,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 13:25:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-27 13:25:09,123 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 14 states. [2019-11-27 13:25:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:09,274 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2019-11-27 13:25:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 13:25:09,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-11-27 13:25:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:09,278 INFO L225 Difference]: With dead ends: 159 [2019-11-27 13:25:09,278 INFO L226 Difference]: Without dead ends: 153 [2019-11-27 13:25:09,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 153 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-27 13:25:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-27 13:25:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-27 13:25:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-27 13:25:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-27 13:25:09,284 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 83 [2019-11-27 13:25:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:09,284 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-27 13:25:09,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 13:25:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-27 13:25:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-27 13:25:09,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:09,286 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] [2019-11-27 13:25:09,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 13:25:09,498 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-27 13:25:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283129, now seen corresponding path program 1 times [2019-11-27 13:25:09,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:09,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990783257] [2019-11-27 13:25:09,499 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-27 13:25:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:09,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-27 13:25:09,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:09,782 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-27 13:25:09,782 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:09,784 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:09,785 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:09,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:25:10,235 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-27 13:25:10,235 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:10,500 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-27 13:25:10,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990783257] [2019-11-27 13:25:10,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:10,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22, 21] imperfect sequences [] total 22 [2019-11-27 13:25:10,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520331430] [2019-11-27 13:25:10,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 13:25:10,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:10,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 13:25:10,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-27 13:25:10,502 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-27 13:25:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:12,371 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2019-11-27 13:25:12,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-27 13:25:12,372 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2019-11-27 13:25:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:12,373 INFO L225 Difference]: With dead ends: 186 [2019-11-27 13:25:12,373 INFO L226 Difference]: Without dead ends: 186 [2019-11-27 13:25:12,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-11-27 13:25:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-27 13:25:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2019-11-27 13:25:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-27 13:25:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2019-11-27 13:25:12,381 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 89 [2019-11-27 13:25:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:12,381 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2019-11-27 13:25:12,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 13:25:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2019-11-27 13:25:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-27 13:25:12,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:12,383 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] [2019-11-27 13:25:12,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-27 13:25:12,596 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-27 13:25:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283130, now seen corresponding path program 1 times [2019-11-27 13:25:12,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:12,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463739995] [2019-11-27 13:25:12,598 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-27 13:25:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:12,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-27 13:25:12,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:12,913 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-27 13:25:12,913 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:12,921 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:12,921 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:12,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:25:13,575 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-27 13:25:13,575 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:16,381 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-27 13:25:16,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463739995] [2019-11-27 13:25:16,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:16,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 22] imperfect sequences [] total 44 [2019-11-27 13:25:16,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295247079] [2019-11-27 13:25:16,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-27 13:25:16,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:16,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-27 13:25:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2019-11-27 13:25:16,384 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 45 states. [2019-11-27 13:25:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:21,537 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-11-27 13:25:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-27 13:25:21,539 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-11-27 13:25:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:21,541 INFO L225 Difference]: With dead ends: 157 [2019-11-27 13:25:21,541 INFO L226 Difference]: Without dead ends: 157 [2019-11-27 13:25:21,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2019-11-27 13:25:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-27 13:25:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-27 13:25:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 13:25:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2019-11-27 13:25:21,549 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 89 [2019-11-27 13:25:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:21,549 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2019-11-27 13:25:21,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-27 13:25:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2019-11-27 13:25:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-27 13:25:21,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:21,551 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] [2019-11-27 13:25:21,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-27 13:25:21,764 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-27 13:25:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash 822322196, now seen corresponding path program 1 times [2019-11-27 13:25:21,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:21,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049989614] [2019-11-27 13:25:21,766 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-27 13:25:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:22,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-27 13:25:22,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:22,880 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-27 13:25:22,881 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:23,849 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-27 13:25:23,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049989614] [2019-11-27 13:25:23,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:25:23,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 21] imperfect sequences [] total 43 [2019-11-27 13:25:23,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516058523] [2019-11-27 13:25:23,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-27 13:25:23,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-27 13:25:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2019-11-27 13:25:23,853 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 44 states. [2019-11-27 13:25:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:26,755 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2019-11-27 13:25:26,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-27 13:25:26,758 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-11-27 13:25:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:26,759 INFO L225 Difference]: With dead ends: 156 [2019-11-27 13:25:26,759 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 13:25:26,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=230, Invalid=2422, Unknown=0, NotChecked=0, Total=2652 [2019-11-27 13:25:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 13:25:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-27 13:25:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 13:25:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2019-11-27 13:25:26,766 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 92 [2019-11-27 13:25:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:26,767 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2019-11-27 13:25:26,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-27 13:25:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2019-11-27 13:25:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-27 13:25:26,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:25:26,769 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] [2019-11-27 13:25:26,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-27 13:25:26,982 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-27 13:25:26,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:25:26,983 INFO L82 PathProgramCache]: Analyzing trace with hash -692582595, now seen corresponding path program 1 times [2019-11-27 13:25:26,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:25:26,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126531784] [2019-11-27 13:25:26,983 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-27 13:25:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:25:27,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-27 13:25:27,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:25:27,503 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-27 13:25:27,504 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,519 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:27,520 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-27 13:25:27,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:27,591 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-27 13:25:27,592 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,629 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-27 13:25:27,630 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-27 13:25:27,758 INFO L343 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2019-11-27 13:25:27,759 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 35 treesize of output 37 [2019-11-27 13:25:27,759 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,776 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:27,776 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-27 13:25:27,909 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-27 13:25:27,909 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-27 13:25:27,910 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,928 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:27,929 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:27,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-27 13:25:28,614 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-27 13:25:28,614 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:25:29,036 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 13:25:30,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:31,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:33,129 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 13:25:33,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 13:25:33,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:25:33,353 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-27 13:25:33,354 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-27 13:25:33,355 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-27 13:25:33,367 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-27 13:25:33,367 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-27 13:25:33,368 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:33,369 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:33,369 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:33,370 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:25:33,370 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-27 13:25:33,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-27 13:25:35,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 13:25:35,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:25:35,537 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-27 13:25:35,539 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-27 13:25:35,540 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-27 13:25:35,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,854 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-27 13:25:35,855 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-27 13:25:35,856 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-27 13:25:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:25:35,864 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:25:36,086 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-27 13:25:36,087 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-27 13:25:36,088 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:36,130 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-27 13:25:36,130 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:25:36,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-27 13:25:37,544 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-27 13:25:37,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126531784] [2019-11-27 13:25:37,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:25:37,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-27 13:25:37,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860729334] [2019-11-27 13:25:37,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-27 13:25:37,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:25:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-27 13:25:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-27 13:25:37,546 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 55 states. [2019-11-27 13:25:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:25:45,859 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-27 13:25:45,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-27 13:25:45,860 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 95 [2019-11-27 13:25:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:25:45,861 INFO L225 Difference]: With dead ends: 60 [2019-11-27 13:25:45,861 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 13:25:45,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-27 13:25:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 13:25:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 13:25:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 13:25:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 13:25:45,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-27 13:25:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:25:45,864 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 13:25:45,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-27 13:25:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 13:25:45,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 13:25:46,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-27 13:25:46,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 01:25:46 BoogieIcfgContainer [2019-11-27 13:25:46,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 13:25:46,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 13:25:46,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 13:25:46,075 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 13:25:46,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:24:35" (3/4) ... [2019-11-27 13:25:46,079 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 13:25:46,091 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-27 13:25:46,091 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:25:46,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-27 13:25:46,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-27 13:25:46,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-27 13:25:46,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-27 13:25:46,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-27 13:25:46,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-27 13:25:46,093 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-27 13:25:46,093 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-27 13:25:46,093 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-27 13:25:46,093 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-27 13:25:46,093 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-27 13:25:46,093 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-27 13:25:46,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-27 13:25:46,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-27 13:25:46,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-27 13:25:46,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-27 13:25:46,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-27 13:25:46,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-27 13:25:46,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-27 13:25:46,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-27 13:25:46,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_get [2019-11-27 13:25:46,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-27 13:25:46,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-27 13:25:46,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-27 13:25:46,096 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-27 13:25:46,096 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-27 13:25:46,096 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-27 13:25:46,096 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-27 13:25:46,096 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-27 13:25:46,096 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-27 13:25:46,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-27 13:25:46,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-27 13:25:46,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-27 13:25:46,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-27 13:25:46,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-27 13:25:46,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-27 13:25:46,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-27 13:25:46,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-27 13:25:46,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-27 13:25:46,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-27 13:25:46,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_put [2019-11-27 13:25:46,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-27 13:25:46,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-27 13:25:46,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-27 13:25:46,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-27 13:25:46,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-27 13:25:46,114 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2019-11-27 13:25:46,115 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-27 13:25:46,116 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 13:25:46,116 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 13:25:46,116 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 13:25:46,174 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 13:25:46,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 13:25:46,176 INFO L168 Benchmark]: Toolchain (without parser) took 73604.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.4 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -66.0 MB). Peak memory consumption was 428.4 MB. Max. memory is 11.5 GB. [2019-11-27 13:25:46,176 INFO L168 Benchmark]: CDTParser took 0.30 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-27 13:25:46,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 908.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -107.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 13:25:46,177 INFO L168 Benchmark]: Boogie Preprocessor took 106.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:25:46,177 INFO L168 Benchmark]: RCFGBuilder took 1529.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 950.0 MB in the end (delta: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 11.5 GB. [2019-11-27 13:25:46,178 INFO L168 Benchmark]: TraceAbstraction took 70953.78 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 380.1 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -76.3 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. [2019-11-27 13:25:46,178 INFO L168 Benchmark]: Witness Printer took 100.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:25:46,180 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.30 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 908.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -107.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1529.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 950.0 MB in the end (delta: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70953.78 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 380.1 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -76.3 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. * Witness Printer took 100.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. 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: 70.8s, OverallIterations: 23, TraceHistogramMax: 16, AutomataDifference: 34.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2441 SDtfs, 1348 SDslu, 19465 SDs, 0 SdLazy, 12495 SolverSat, 417 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2494 GetRequests, 1978 SyntacticMatches, 52 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=20, 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, 23 MinimizatonAttempts, 134 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 26.5s InterpolantComputationTime, 1219 NumberOfCodeBlocks, 1183 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2392 ConstructedInterpolants, 306 QuantifiedInterpolants, 727040 SizeOfPredicates, 152 NumberOfNonLiveVariables, 5416 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 46 InterpolantComputations, 38 PerfectInterpolantSequences, 2984/3514 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...