./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ddv-machzwd/ddv_machzwd_inb_p.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 ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:56:09,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:56:09,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:56:09,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:56:09,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:56:09,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:56:09,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:56:09,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:56:09,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:56:09,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:56:09,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:56:09,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:56:09,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:56:09,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:56:09,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:56:09,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:56:09,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:56:09,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:56:09,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:56:09,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:56:09,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:56:09,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:56:09,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:56:09,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:56:09,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:56:09,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:56:09,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:56:09,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:56:09,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:56:09,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:56:09,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:56:09,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:56:09,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:56:09,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:56:09,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:56:09,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:56:09,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:56:09,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:56:09,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:56:09,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:56:09,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:56:09,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:56:09,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:56:09,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:56:09,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:56:09,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:56:09,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:56:09,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:56:09,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:56:09,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:56:09,898 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:56:09,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:56:09,899 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:56:09,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:56:09,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:56:09,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:56:09,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:56:09,899 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:56:09,900 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:56:09,900 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:56:09,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:56:09,900 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:56:09,900 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:56:09,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:56:09,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:56:09,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:56:09,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:56:09,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:56:09,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:56:09,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:56:09,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:56:09,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:56:09,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 [2022-02-20 23:56:10,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:56:10,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:56:10,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:56:10,130 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:56:10,131 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:56:10,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2022-02-20 23:56:10,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ea916b1/c66ce1c298894b5e92372b5753415c84/FLAG3df231672 [2022-02-20 23:56:10,749 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:56:10,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2022-02-20 23:56:10,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ea916b1/c66ce1c298894b5e92372b5753415c84/FLAG3df231672 [2022-02-20 23:56:11,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ea916b1/c66ce1c298894b5e92372b5753415c84 [2022-02-20 23:56:11,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:56:11,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:56:11,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:11,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:56:11,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:56:11,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:11" (1/1) ... [2022-02-20 23:56:11,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbf11c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:11, skipping insertion in model container [2022-02-20 23:56:11,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:11" (1/1) ... [2022-02-20 23:56:11,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:56:11,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:56:11,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i[457,470] [2022-02-20 23:56:12,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:12,135 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) [2022-02-20 23:56:12,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@155531b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:12, skipping insertion in model container [2022-02-20 23:56:12,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:12,136 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:56:12,138 INFO L158 Benchmark]: Toolchain (without parser) took 899.58ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.9MB in the beginning and 63.8MB in the end (delta: 1.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-02-20 23:56:12,138 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 68.6MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:56:12,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 897.65ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 63.8MB in the end (delta: 780.2kB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-02-20 23:56:12,140 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 68.6MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 897.65ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 63.8MB in the end (delta: 780.2kB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2976]: 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ddv-machzwd/ddv_machzwd_inb_p.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 ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:56:13,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:56:13,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:56:13,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:56:13,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:56:13,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:56:13,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:56:13,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:56:13,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:56:13,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:56:13,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:56:13,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:56:13,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:56:13,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:56:13,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:56:13,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:56:13,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:56:13,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:56:13,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:56:13,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:56:13,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:56:13,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:56:13,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:56:13,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:56:13,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:56:13,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:56:13,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:56:13,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:56:13,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:56:13,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:56:13,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:56:13,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:56:13,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:56:13,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:56:13,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:56:13,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:56:13,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:56:13,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:56:13,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:56:13,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:56:13,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:56:13,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:56:13,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:56:13,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:56:13,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:56:13,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:56:13,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:56:13,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:56:13,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:56:13,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:56:13,742 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:56:13,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:56:13,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:56:13,743 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:56:13,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:56:13,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:56:13,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:56:13,743 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:56:13,743 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:56:13,744 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:56:13,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:56:13,744 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:56:13,744 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:56:13,744 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:56:13,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:56:13,744 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:56:13,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:56:13,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:56:13,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:56:13,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:56:13,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:56:13,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:56:13,752 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:56:13,752 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:56:13,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:56:13,752 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 [2022-02-20 23:56:14,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:56:14,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:56:14,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:56:14,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:56:14,029 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:56:14,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2022-02-20 23:56:14,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092505805/cfc64cdf7b5443b1ad5ae615c46931a1/FLAG67882bc56 [2022-02-20 23:56:14,541 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:56:14,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2022-02-20 23:56:14,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092505805/cfc64cdf7b5443b1ad5ae615c46931a1/FLAG67882bc56 [2022-02-20 23:56:14,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092505805/cfc64cdf7b5443b1ad5ae615c46931a1 [2022-02-20 23:56:14,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:56:14,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:56:14,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:14,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:56:14,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:56:14,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:14" (1/1) ... [2022-02-20 23:56:14,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ef4681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:14, skipping insertion in model container [2022-02-20 23:56:14,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:14" (1/1) ... [2022-02-20 23:56:14,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:56:14,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:56:15,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i[457,470] [2022-02-20 23:56:15,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:15,848 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:56:15,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:56:15,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i[457,470] [2022-02-20 23:56:16,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:16,080 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:56:16,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i[457,470] [2022-02-20 23:56:16,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:16,334 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:56:16,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16 WrapperNode [2022-02-20 23:56:16,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:16,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:56:16,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:56:16,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:56:16,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,460 INFO L137 Inliner]: procedures = 482, calls = 839, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 970 [2022-02-20 23:56:16,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:56:16,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:56:16,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:56:16,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:56:16,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:56:16,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:56:16,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:56:16,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:56:16,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (1/1) ... [2022-02-20 23:56:16,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:56:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:56:16,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:56:16,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2022-02-20 23:56:16,652 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2022-02-20 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT [2022-02-20 23:56:16,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT [2022-02-20 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 23:56:16,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2022-02-20 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 23:56:16,653 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-02-20 23:56:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:56:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 23:56:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 23:56:16,654 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 23:56:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 23:56:16,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2022-02-20 23:56:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2022-02-20 23:56:16,654 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2022-02-20 23:56:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2022-02-20 23:56:16,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2022-02-20 23:56:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:56:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2022-02-20 23:56:16,655 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2022-02-20 23:56:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:56:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:56:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 23:56:16,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 23:56:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2022-02-20 23:56:16,656 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2022-02-20 23:56:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2022-02-20 23:56:16,656 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2022-02-20 23:56:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:56:16,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:56:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2022-02-20 23:56:16,657 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2022-02-20 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-02-20 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 23:56:16,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-02-20 23:56:16,658 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-02-20 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 23:56:16,658 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2022-02-20 23:56:16,659 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2022-02-20 23:56:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 23:56:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-02-20 23:56:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:56:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:56:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2022-02-20 23:56:16,661 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2022-02-20 23:56:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-02-20 23:56:16,661 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-02-20 23:56:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-02-20 23:56:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-02-20 23:56:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2022-02-20 23:56:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2022-02-20 23:56:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2022-02-20 23:56:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2022-02-20 23:56:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2022-02-20 23:56:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2022-02-20 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_ULONG~X~$Pointer$~TO~C_LONG [2022-02-20 23:56:16,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_ULONG~X~$Pointer$~TO~C_LONG [2022-02-20 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2022-02-20 23:56:16,663 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2022-02-20 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-02-20 23:56:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2022-02-20 23:56:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2022-02-20 23:56:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 23:56:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 23:56:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_ULONG~TO~VOID [2022-02-20 23:56:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_ULONG~TO~VOID [2022-02-20 23:56:17,012 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:56:17,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:56:21,959 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:56:21,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:56:21,981 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:56:21,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:56:21 BoogieIcfgContainer [2022-02-20 23:56:21,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:56:21,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:56:21,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:56:21,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:56:21,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:56:14" (1/3) ... [2022-02-20 23:56:21,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfa9798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:56:21, skipping insertion in model container [2022-02-20 23:56:21,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16" (2/3) ... [2022-02-20 23:56:21,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfa9798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:56:21, skipping insertion in model container [2022-02-20 23:56:21,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:56:21" (3/3) ... [2022-02-20 23:56:21,991 INFO L111 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inb_p.i [2022-02-20 23:56:21,994 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:56:21,994 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 205 error locations. [2022-02-20 23:56:22,032 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:56:22,038 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:56:22,038 INFO L340 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2022-02-20 23:56:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 666 states, 356 states have (on average 1.8202247191011236) internal successors, (648), 566 states have internal predecessors, (648), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-02-20 23:56:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:56:22,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:22,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:56:22,071 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr0REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:56:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:22,075 INFO L85 PathProgramCache]: Analyzing trace with hash 333908101, now seen corresponding path program 1 times [2022-02-20 23:56:22,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:22,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384738301] [2022-02-20 23:56:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:22,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:22,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:22,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:56:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:22,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:56:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:22,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:22,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {669#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:22,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:22,697 INFO L272 TraceCheckUtils]: 2: Hoare triple {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {681#(and (= (select |#valid| (_ bv44 32)) (_ bv1 1)) (= |spin_lock_init_#in~lock.base| (_ bv44 32)))} is VALID [2022-02-20 23:56:22,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {681#(and (= (select |#valid| (_ bv44 32)) (_ bv1 1)) (= |spin_lock_init_#in~lock.base| (_ bv44 32)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {685#(and (= spin_lock_init_~lock.base (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:22,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {685#(and (= spin_lock_init_~lock.base (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} assume !(1bv1 == #valid[~lock.base]); {670#false} is VALID [2022-02-20 23:56:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:56:22,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:22,700 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:22,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384738301] [2022-02-20 23:56:22,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384738301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:22,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:22,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:56:22,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336389277] [2022-02-20 23:56:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:22,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:22,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:22,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:22,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:56:22,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:22,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:56:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:56:22,763 INFO L87 Difference]: Start difference. First operand has 666 states, 356 states have (on average 1.8202247191011236) internal successors, (648), 566 states have internal predecessors, (648), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:26,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:28,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:37,079 INFO L93 Difference]: Finished difference Result 1204 states and 1443 transitions. [2022-02-20 23:56:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:56:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1453 transitions. [2022-02-20 23:56:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1453 transitions. [2022-02-20 23:56:37,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1453 transitions. [2022-02-20 23:56:38,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1453 edges. 1453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:38,583 INFO L225 Difference]: With dead ends: 1204 [2022-02-20 23:56:38,583 INFO L226 Difference]: Without dead ends: 1200 [2022-02-20 23:56:38,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:56:38,587 INFO L933 BasicCegarLoop]: 759 mSDtfsCounter, 687 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:38,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 2484 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1106 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-02-20 23:56:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-02-20 23:56:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 987. [2022-02-20 23:56:38,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:38,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1200 states. Second operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:38,676 INFO L74 IsIncluded]: Start isIncluded. First operand 1200 states. Second operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:38,678 INFO L87 Difference]: Start difference. First operand 1200 states. Second operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:38,738 INFO L93 Difference]: Finished difference Result 1200 states and 1439 transitions. [2022-02-20 23:56:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1439 transitions. [2022-02-20 23:56:38,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:38,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:38,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1200 states. [2022-02-20 23:56:38,750 INFO L87 Difference]: Start difference. First operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1200 states. [2022-02-20 23:56:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:38,803 INFO L93 Difference]: Finished difference Result 1200 states and 1439 transitions. [2022-02-20 23:56:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1439 transitions. [2022-02-20 23:56:38,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:38,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:38,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:38,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1347 transitions. [2022-02-20 23:56:38,849 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1347 transitions. Word has length 5 [2022-02-20 23:56:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:38,850 INFO L470 AbstractCegarLoop]: Abstraction has 987 states and 1347 transitions. [2022-02-20 23:56:38,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1347 transitions. [2022-02-20 23:56:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:56:38,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:38,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:56:38,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:56:39,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:39,062 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr1REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:56:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 333908102, now seen corresponding path program 1 times [2022-02-20 23:56:39,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:39,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345845324] [2022-02-20 23:56:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:39,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:39,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:39,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:56:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:39,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:56:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:39,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:39,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {5283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:39,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:39,519 INFO L272 TraceCheckUtils]: 2: Hoare triple {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {5295#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |spin_lock_init_#in~lock.base| (_ bv44 32)) (= |spin_lock_init_#in~lock.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:39,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {5295#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |spin_lock_init_#in~lock.base| (_ bv44 32)) (= |spin_lock_init_#in~lock.offset| (_ bv0 32)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {5299#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= spin_lock_init_~lock.offset (_ bv0 32)) (= spin_lock_init_~lock.base (_ bv44 32)))} is VALID [2022-02-20 23:56:39,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {5299#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= spin_lock_init_~lock.offset (_ bv0 32)) (= spin_lock_init_~lock.base (_ bv44 32)))} assume !((~bvule32(~bvadd32(4bv32, ~lock.offset), #length[~lock.base]) && ~bvule32(~lock.offset, ~bvadd32(4bv32, ~lock.offset))) && ~bvule32(0bv32, ~lock.offset)); {5284#false} is VALID [2022-02-20 23:56:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:56:39,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:39,520 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:39,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345845324] [2022-02-20 23:56:39,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345845324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:39,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:39,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:56:39,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301146698] [2022-02-20 23:56:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:39,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:39,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:39,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:39,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:39,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:56:39,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:56:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:56:39,545 INFO L87 Difference]: Start difference. First operand 987 states and 1347 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:43,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:45,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:53,411 INFO L93 Difference]: Finished difference Result 1119 states and 1439 transitions. [2022-02-20 23:56:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:56:53,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1030 transitions. [2022-02-20 23:56:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1030 transitions. [2022-02-20 23:56:53,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1030 transitions. [2022-02-20 23:56:54,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1030 edges. 1030 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:54,455 INFO L225 Difference]: With dead ends: 1119 [2022-02-20 23:56:54,455 INFO L226 Difference]: Without dead ends: 1119 [2022-02-20 23:56:54,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:56:54,456 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 268 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:54,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 2630 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 850 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-02-20 23:56:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-02-20 23:56:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1060. [2022-02-20 23:56:54,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:54,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1119 states. Second operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:56:54,477 INFO L74 IsIncluded]: Start isIncluded. First operand 1119 states. Second operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:56:54,478 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:56:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:54,521 INFO L93 Difference]: Finished difference Result 1119 states and 1439 transitions. [2022-02-20 23:56:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1439 transitions. [2022-02-20 23:56:54,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:54,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:54,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1119 states. [2022-02-20 23:56:54,529 INFO L87 Difference]: Start difference. First operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1119 states. [2022-02-20 23:56:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:54,579 INFO L93 Difference]: Finished difference Result 1119 states and 1439 transitions. [2022-02-20 23:56:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1439 transitions. [2022-02-20 23:56:54,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:54,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:54,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:54,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:56:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1435 transitions. [2022-02-20 23:56:54,628 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1435 transitions. Word has length 5 [2022-02-20 23:56:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:54,628 INFO L470 AbstractCegarLoop]: Abstraction has 1060 states and 1435 transitions. [2022-02-20 23:56:54,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1435 transitions. [2022-02-20 23:56:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:56:54,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:54,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:56:54,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:56:54,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:54,843 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:56:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash -863937403, now seen corresponding path program 1 times [2022-02-20 23:56:54,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:54,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971862692] [2022-02-20 23:56:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:54,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:54,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:54,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:54,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:56:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:55,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:56:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:55,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:55,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {9723#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,290 INFO L272 TraceCheckUtils]: 2: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32); srcloc: L4154 {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); srcloc: L4154-1 {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume true; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,294 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} #1159#return; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} init_kernel_~i~1#1 := 0bv32; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:55,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume !(1bv1 == #valid[~#shared_workqueue~0.base]); {9724#false} is VALID [2022-02-20 23:56:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:56:55,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:55,296 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:55,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971862692] [2022-02-20 23:56:55,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971862692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:55,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:55,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-20 23:56:55,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997542809] [2022-02-20 23:56:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:56:55,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:55,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:56:55,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:55,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:56:55,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:55,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:56:55,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:56:55,333 INFO L87 Difference]: Start difference. First operand 1060 states and 1435 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:00,802 INFO L93 Difference]: Finished difference Result 1266 states and 1522 transitions. [2022-02-20 23:57:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:57:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1437 transitions. [2022-02-20 23:57:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1437 transitions. [2022-02-20 23:57:00,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1437 transitions. [2022-02-20 23:57:02,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1437 edges. 1437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:02,203 INFO L225 Difference]: With dead ends: 1266 [2022-02-20 23:57:02,204 INFO L226 Difference]: Without dead ends: 1266 [2022-02-20 23:57:02,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:02,205 INFO L933 BasicCegarLoop]: 742 mSDtfsCounter, 660 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:02,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 1290 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 23:57:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-02-20 23:57:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1059. [2022-02-20 23:57:02,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:02,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1266 states. Second operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:02,228 INFO L74 IsIncluded]: Start isIncluded. First operand 1266 states. Second operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:02,229 INFO L87 Difference]: Start difference. First operand 1266 states. Second operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:02,273 INFO L93 Difference]: Finished difference Result 1266 states and 1522 transitions. [2022-02-20 23:57:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1522 transitions. [2022-02-20 23:57:02,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:02,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:02,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1266 states. [2022-02-20 23:57:02,279 INFO L87 Difference]: Start difference. First operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1266 states. [2022-02-20 23:57:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:02,323 INFO L93 Difference]: Finished difference Result 1266 states and 1522 transitions. [2022-02-20 23:57:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1522 transitions. [2022-02-20 23:57:02,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:02,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:02,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:02,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1430 transitions. [2022-02-20 23:57:02,361 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1430 transitions. Word has length 11 [2022-02-20 23:57:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:02,362 INFO L470 AbstractCegarLoop]: Abstraction has 1059 states and 1430 transitions. [2022-02-20 23:57:02,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1430 transitions. [2022-02-20 23:57:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:57:02,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:02,363 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:02,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:57:02,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:57:02,573 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:57:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash -863937402, now seen corresponding path program 1 times [2022-02-20 23:57:02,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:02,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450830291] [2022-02-20 23:57:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:02,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:57:02,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:57:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:02,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:57:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:02,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:03,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {14615#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,078 INFO L272 TraceCheckUtils]: 2: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32); srcloc: L4154 {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); srcloc: L4154-1 {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume true; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,081 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} #1159#return; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} init_kernel_~i~1#1 := 0bv32; {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:03,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))), #length[~#shared_workqueue~0.base]) && ~bvule32(~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)))); {14616#false} is VALID [2022-02-20 23:57:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:03,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:03,083 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:03,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450830291] [2022-02-20 23:57:03,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450830291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:03,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:03,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:03,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211073393] [2022-02-20 23:57:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:57:03,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:03,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:03,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:03,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:57:03,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:57:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:03,128 INFO L87 Difference]: Start difference. First operand 1059 states and 1430 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:07,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:57:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:11,255 INFO L93 Difference]: Finished difference Result 1125 states and 1445 transitions. [2022-02-20 23:57:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:57:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:57:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1037 transitions. [2022-02-20 23:57:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1037 transitions. [2022-02-20 23:57:11,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1037 transitions. [2022-02-20 23:57:12,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1037 edges. 1037 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:12,345 INFO L225 Difference]: With dead ends: 1125 [2022-02-20 23:57:12,345 INFO L226 Difference]: Without dead ends: 1125 [2022-02-20 23:57:12,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:12,347 INFO L933 BasicCegarLoop]: 837 mSDtfsCounter, 268 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:12,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 1514 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 410 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 23:57:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-02-20 23:57:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1062. [2022-02-20 23:57:12,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:12,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1125 states. Second operand has 1062 states, 638 states have (on average 1.7539184952978057) internal successors, (1119), 858 states have internal predecessors, (1119), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:12,383 INFO L74 IsIncluded]: Start isIncluded. First operand 1125 states. Second operand has 1062 states, 638 states have (on average 1.7539184952978057) internal successors, (1119), 858 states have internal predecessors, (1119), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:12,385 INFO L87 Difference]: Start difference. First operand 1125 states. Second operand has 1062 states, 638 states have (on average 1.7539184952978057) internal successors, (1119), 858 states have internal predecessors, (1119), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:12,426 INFO L93 Difference]: Finished difference Result 1125 states and 1445 transitions. [2022-02-20 23:57:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1445 transitions. [2022-02-20 23:57:12,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:12,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:12,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 1062 states, 638 states have (on average 1.7539184952978057) internal successors, (1119), 858 states have internal predecessors, (1119), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1125 states. [2022-02-20 23:57:12,431 INFO L87 Difference]: Start difference. First operand has 1062 states, 638 states have (on average 1.7539184952978057) internal successors, (1119), 858 states have internal predecessors, (1119), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1125 states. [2022-02-20 23:57:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:12,470 INFO L93 Difference]: Finished difference Result 1125 states and 1445 transitions. [2022-02-20 23:57:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1445 transitions. [2022-02-20 23:57:12,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:12,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:12,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:12,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 638 states have (on average 1.7539184952978057) internal successors, (1119), 858 states have internal predecessors, (1119), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1433 transitions. [2022-02-20 23:57:12,508 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1433 transitions. Word has length 11 [2022-02-20 23:57:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:12,509 INFO L470 AbstractCegarLoop]: Abstraction has 1062 states and 1433 transitions. [2022-02-20 23:57:12,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1433 transitions. [2022-02-20 23:57:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:57:12,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:12,509 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:12,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:57:12,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:57:12,721 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:57:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2114831441, now seen corresponding path program 1 times [2022-02-20 23:57:12,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:12,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120034916] [2022-02-20 23:57:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:12,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:12,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:57:12,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:57:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:13,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:57:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:13,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:13,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {19088#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,283 INFO L272 TraceCheckUtils]: 2: Hoare triple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32); srcloc: L4154 {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); srcloc: L4154-1 {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume true; {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,286 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} #1159#return; {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {19093#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} init_kernel_~i~1#1 := 0bv32; {19118#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {19118#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {19118#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {19118#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~#shared_workqueue~0.base, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), 4bv32); srcloc: L2670 {19118#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {19118#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := ~bvadd32(1bv32, init_kernel_#t~post298#1);havoc init_kernel_#t~post298#1; {19128#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {19128#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {19128#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:13,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {19128#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))), #length[~#shared_workqueue~0.base]) && ~bvule32(~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)))); {19089#false} is VALID [2022-02-20 23:57:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:13,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:13,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {19135#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))), #length[~#shared_workqueue~0.base]) && ~bvule32(~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)))); {19089#false} is VALID [2022-02-20 23:57:13,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {19135#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {19135#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:13,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {19142#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := ~bvadd32(1bv32, init_kernel_#t~post298#1);havoc init_kernel_#t~post298#1; {19135#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:14,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {19142#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~#shared_workqueue~0.base, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), 4bv32); srcloc: L2670 {19142#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:14,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {19142#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {19142#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:14,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {19152#(and (bvule (bvadd (_ bv4 32) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} init_kernel_~i~1#1 := 0bv32; {19142#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_init_kernel_~i~1#1|) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:14,037 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19088#true} {19152#(and (bvule (bvadd (_ bv4 32) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} #1159#return; {19152#(and (bvule (bvadd (_ bv4 32) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:14,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {19088#true} assume true; {19088#true} is VALID [2022-02-20 23:57:14,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {19088#true} SUMMARY for call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); srcloc: L4154-1 {19088#true} is VALID [2022-02-20 23:57:14,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {19088#true} SUMMARY for call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32); srcloc: L4154 {19088#true} is VALID [2022-02-20 23:57:14,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {19088#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {19088#true} is VALID [2022-02-20 23:57:14,038 INFO L272 TraceCheckUtils]: 2: Hoare triple {19152#(and (bvule (bvadd (_ bv4 32) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {19088#true} is VALID [2022-02-20 23:57:14,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {19152#(and (bvule (bvadd (_ bv4 32) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {19152#(and (bvule (bvadd (_ bv4 32) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:14,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {19088#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {19152#(and (bvule (bvadd (_ bv4 32) |~#shared_workqueue~0.offset|) (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|)) (bvule (bvadd (_ bv8 32) |~#shared_workqueue~0.offset|) (select |#length| |~#shared_workqueue~0.base|)))} is VALID [2022-02-20 23:57:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:14,046 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:14,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120034916] [2022-02-20 23:57:14,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120034916] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:57:14,047 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:57:14,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2022-02-20 23:57:14,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423335858] [2022-02-20 23:57:14,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:14,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-02-20 23:57:14,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:14,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:14,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:14,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:57:14,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:14,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:57:14,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:14,664 INFO L87 Difference]: Start difference. First operand 1062 states and 1433 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:18,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []