./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outb.i --full-output -ea --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
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/AutomizerReach.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outb.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9ba053a0d2bb5cff65ef20f502acdb8ce89a9e82653cf0711701cf2b8f86a02
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-03d7b7b
[2022-02-20 16:50:36,129 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-02-20 16:50:36,132 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-20 16:50:36,165 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-20 16:50:36,165 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-20 16:50:36,166 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-20 16:50:36,168 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-20 16:50:36,170 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-20 16:50:36,171 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-20 16:50:36,172 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-20 16:50:36,173 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-02-20 16:50:36,174 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-20 16:50:36,175 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-20 16:50:36,175 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-20 16:50:36,176 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-20 16:50:36,177 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-20 16:50:36,178 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-20 16:50:36,179 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-20 16:50:36,180 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-20 16:50:36,182 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-20 16:50:36,183 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-20 16:50:36,185 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-20 16:50:36,186 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-02-20 16:50:36,187 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-20 16:50:36,189 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-20 16:50:36,190 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-20 16:50:36,190 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-20 16:50:36,191 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-20 16:50:36,191 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-20 16:50:36,192 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-20 16:50:36,192 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-20 16:50:36,193 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-20 16:50:36,193 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-20 16:50:36,194 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-20 16:50:36,195 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-20 16:50:36,195 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-20 16:50:36,196 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-20 16:50:36,196 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-20 16:50:36,196 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-20 16:50:36,197 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-20 16:50:36,198 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-02-20 16:50:36,199 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-02-20 16:50:36,221 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-02-20 16:50:36,222 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-20 16:50:36,223 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-20 16:50:36,223 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-20 16:50:36,224 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-20 16:50:36,224 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-20 16:50:36,225 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-20 16:50:36,225 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-02-20 16:50:36,225 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-02-20 16:50:36,225 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-20 16:50:36,226 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-02-20 16:50:36,227 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-02-20 16:50:36,227 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-02-20 16:50:36,227 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-02-20 16:50:36,227 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-02-20 16:50:36,227 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-20 16:50:36,227 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-02-20 16:50:36,228 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-02-20 16:50:36,228 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-02-20 16:50:36,228 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-02-20 16:50:36,228 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-02-20 16:50:36,228 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-20 16:50:36,229 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-02-20 16:50:36,229 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-02-20 16:50:36,229 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 16:50:36,229 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-20 16:50:36,229 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-02-20 16:50:36,229 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-20 16:50:36,230 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-02-20 16:50:36,230 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-20 16:50:36,230 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-02-20 16:50:36,230 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2022-02-20 16:50:36,230 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-20 16:50:36,231 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 ! call(reach_error())) )


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 -> b9ba053a0d2bb5cff65ef20f502acdb8ce89a9e82653cf0711701cf2b8f86a02
[2022-02-20 16:50:36,428 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-20 16:50:36,450 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-20 16:50:36,452 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-20 16:50:36,453 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-02-20 16:50:36,454 INFO  L275        PluginConnector]: CDTParser initialized
[2022-02-20 16:50:36,455 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outb.i
[2022-02-20 16:50:36,523 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256f0c6a9/4867a6ddf8ce4cb3babe6b2f16c3cc2a/FLAG6a85eada5
[2022-02-20 16:50:37,075 INFO  L306              CDTParser]: Found 1 translation units.
[2022-02-20 16:50:37,075 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outb.i
[2022-02-20 16:50:37,098 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256f0c6a9/4867a6ddf8ce4cb3babe6b2f16c3cc2a/FLAG6a85eada5
[2022-02-20 16:50:37,305 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256f0c6a9/4867a6ddf8ce4cb3babe6b2f16c3cc2a
[2022-02-20 16:50:37,307 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-20 16:50:37,308 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2022-02-20 16:50:37,311 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-20 16:50:37,311 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-20 16:50:37,314 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-20 16:50:37,316 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:37" (1/1) ...
[2022-02-20 16:50:37,318 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0dff88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:37, skipping insertion in model container
[2022-02-20 16:50:37,319 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:37" (1/1) ...
[2022-02-20 16:50:37,325 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-02-20 16:50:37,381 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-02-20 16:50:37,566 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_outb.i[453,466]
[2022-02-20 16:50:38,312 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-20 16:50:38,339 INFO  L203         MainTranslator]: Completed pre-run
[2022-02-20 16:50:38,364 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_outb.i[453,466]
[2022-02-20 16:50:38,600 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-20 16:50:38,701 INFO  L208         MainTranslator]: Completed translation
[2022-02-20 16:50:38,701 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38 WrapperNode
[2022-02-20 16:50:38,701 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-20 16:50:38,702 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-20 16:50:38,703 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-20 16:50:38,703 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-20 16:50:38,711 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,766 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,852 INFO  L137                Inliner]: procedures = 474, calls = 839, calls flagged for inlining = 54, calls inlined = 38, statements flattened = 1024
[2022-02-20 16:50:38,853 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-20 16:50:38,854 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-20 16:50:38,854 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-20 16:50:38,854 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-02-20 16:50:38,864 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,867 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,876 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,884 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,931 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,954 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,962 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,980 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-20 16:50:38,988 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-20 16:50:38,988 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-02-20 16:50:38,989 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-02-20 16:50:38,990 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (1/1) ...
[2022-02-20 16:50:38,996 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 16:50:39,005 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 16:50:39,025 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 16:50:39,050 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 16:50:39,065 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_timer_off
[2022-02-20 16:50:39,066 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_timer_off
[2022-02-20 16:50:39,066 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-02-20 16:50:39,066 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin
[2022-02-20 16:50:39,066 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore
[2022-02-20 16:50:39,066 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore
[2022-02-20 16:50:39,066 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-20 16:50:39,067 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_unlock
[2022-02-20 16:50:39,067 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_unlock
[2022-02-20 16:50:39,067 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-02-20 16:50:39,067 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end
[2022-02-20 16:50:39,067 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_get_control
[2022-02-20 16:50:39,067 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_get_control
[2022-02-20 16:50:39,067 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2022-02-20 16:50:39,068 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-02-20 16:50:39,068 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-02-20 16:50:39,068 INFO  L130     BoogieDeclarations]: Found specification of procedure request_region
[2022-02-20 16:50:39,068 INFO  L138     BoogieDeclarations]: Found implementation of procedure request_region
[2022-02-20 16:50:39,081 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-20 16:50:39,081 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2022-02-20 16:50:39,082 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID
[2022-02-20 16:50:39,082 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID
[2022-02-20 16:50:39,082 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_lock_irqsave
[2022-02-20 16:50:39,083 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave
[2022-02-20 16:50:39,083 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID
[2022-02-20 16:50:39,083 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID
[2022-02-20 16:50:39,083 INFO  L130     BoogieDeclarations]: Found specification of procedure release_region
[2022-02-20 16:50:39,083 INFO  L138     BoogieDeclarations]: Found implementation of procedure release_region
[2022-02-20 16:50:39,083 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-20 16:50:39,084 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-20 16:50:39,084 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_lock_init
[2022-02-20 16:50:39,084 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_lock_init
[2022-02-20 16:50:39,084 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$
[2022-02-20 16:50:39,084 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-02-20 16:50:39,084 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-02-20 16:50:39,085 INFO  L130     BoogieDeclarations]: Found specification of procedure del_timer
[2022-02-20 16:50:39,085 INFO  L138     BoogieDeclarations]: Found implementation of procedure del_timer
[2022-02-20 16:50:39,085 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-20 16:50:39,085 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2022-02-20 16:50:39,086 INFO  L130     BoogieDeclarations]: Found specification of procedure add_timer
[2022-02-20 16:50:39,086 INFO  L138     BoogieDeclarations]: Found implementation of procedure add_timer
[2022-02-20 16:50:39,086 INFO  L130     BoogieDeclarations]: Found specification of procedure cdev_add
[2022-02-20 16:50:39,086 INFO  L138     BoogieDeclarations]: Found implementation of procedure cdev_add
[2022-02-20 16:50:39,086 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int
[2022-02-20 16:50:39,086 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int
[2022-02-20 16:50:39,087 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2022-02-20 16:50:39,087 INFO  L130     BoogieDeclarations]: Found specification of procedure printk
[2022-02-20 16:50:39,087 INFO  L138     BoogieDeclarations]: Found implementation of procedure printk
[2022-02-20 16:50:39,087 INFO  L130     BoogieDeclarations]: Found specification of procedure outw
[2022-02-20 16:50:39,087 INFO  L138     BoogieDeclarations]: Found implementation of procedure outw
[2022-02-20 16:50:39,088 INFO  L130     BoogieDeclarations]: Found specification of procedure outb
[2022-02-20 16:50:39,088 INFO  L138     BoogieDeclarations]: Found implementation of procedure outb
[2022-02-20 16:50:39,088 INFO  L130     BoogieDeclarations]: Found specification of procedure misc_deregister
[2022-02-20 16:50:39,088 INFO  L138     BoogieDeclarations]: Found implementation of procedure misc_deregister
[2022-02-20 16:50:39,088 INFO  L130     BoogieDeclarations]: Found specification of procedure assert_context_process
[2022-02-20 16:50:39,089 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert_context_process
[2022-02-20 16:50:39,090 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_set_control
[2022-02-20 16:50:39,090 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_set_control
[2022-02-20 16:50:39,090 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-02-20 16:50:39,090 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_readw
[2022-02-20 16:50:39,090 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_readw
[2022-02-20 16:50:39,091 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_ping
[2022-02-20 16:50:39,091 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_ping
[2022-02-20 16:50:39,091 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int
[2022-02-20 16:50:39,091 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int
[2022-02-20 16:50:39,091 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_lock
[2022-02-20 16:50:39,091 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_lock
[2022-02-20 16:50:39,091 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int
[2022-02-20 16:50:39,091 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int
[2022-02-20 16:50:39,092 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-20 16:50:39,423 INFO  L234             CfgBuilder]: Building ICFG
[2022-02-20 16:50:39,425 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-20 16:50:41,675 INFO  L275             CfgBuilder]: Performing block encoding
[2022-02-20 16:50:41,700 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-20 16:50:41,701 INFO  L299             CfgBuilder]: Removed 4 assume(true) statements.
[2022-02-20 16:50:41,703 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:41 BoogieIcfgContainer
[2022-02-20 16:50:41,704 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-20 16:50:41,707 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-20 16:50:41,707 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-02-20 16:50:41,710 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-02-20 16:50:41,710 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:50:37" (1/3) ...
[2022-02-20 16:50:41,711 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a11e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:41, skipping insertion in model container
[2022-02-20 16:50:41,711 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:38" (2/3) ...
[2022-02-20 16:50:41,712 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a11e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:41, skipping insertion in model container
[2022-02-20 16:50:41,712 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:41" (3/3) ...
[2022-02-20 16:50:41,713 INFO  L111   eAbstractionObserver]: Analyzing ICFG ddv_machzwd_outb.i
[2022-02-20 16:50:41,718 INFO  L205   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-20 16:50:41,718 INFO  L164   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-02-20 16:50:41,779 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-20 16:50:41,785 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:50:41,785 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-20 16:50:41,811 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 353 states, 247 states have (on average 1.360323886639676) internal successors, (336), 253 states have internal predecessors, (336), 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 16:50:41,815 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-02-20 16:50:41,816 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-20 16:50:41,816 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 16:50:41,817 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting outbErr0ASSERT_VIOLATIONERROR_FUNCTION === [outbErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 16:50:41,821 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 16:50:41,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 1689417019, now seen corresponding path program 1 times
[2022-02-20 16:50:41,829 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 16:50:41,829 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889884443]
[2022-02-20 16:50:41,829 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:50:41,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 16:50:42,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:42,265 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-02-20 16:50:42,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:42,313 INFO  L290        TraceCheckUtils]: 0: Hoare triple {365#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {356#true} is VALID
[2022-02-20 16:50:42,314 INFO  L290        TraceCheckUtils]: 1: Hoare triple {356#true} assume true; {356#true} is VALID
[2022-02-20 16:50:42,314 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {356#true} {356#true} #846#return; {356#true} is VALID
[2022-02-20 16:50:42,315 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-02-20 16:50:42,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:42,332 INFO  L290        TraceCheckUtils]: 0: Hoare triple {356#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {356#true} is VALID
[2022-02-20 16:50:42,332 INFO  L290        TraceCheckUtils]: 1: Hoare triple {356#true} assume true; {356#true} is VALID
[2022-02-20 16:50:42,332 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {356#true} {357#false} #848#return; {357#false} is VALID
[2022-02-20 16:50:42,338 INFO  L290        TraceCheckUtils]: 0: Hoare triple {356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(31, 5);call #Ultimate.allocInit(4, 6);call write~init~int(71, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(76, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(75, 7);call #Ultimate.allocInit(18, 8);call #Ultimate.allocInit(73, 9);call #Ultimate.allocInit(44, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(69, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(6, 15);call write~init~int(82, 15, 0, 1);call write~init~int(69, 15, 1, 1);call write~init~int(83, 15, 2, 1);call write~init~int(69, 15, 3, 1);call write~init~int(84, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(4, 16);call write~init~int(83, 16, 0, 1);call write~init~int(77, 16, 1, 1);call write~init~int(73, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(78, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(73, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(83, 18, 0, 1);call write~init~int(67, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(40, 19);call #Ultimate.allocInit(58, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(14, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(22, 26);~current_execution_context~0 := 0;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0, 0;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0, 0;~jiffies~0 := 0;~_ddv_module_author~0 := ~const~array~~LB~int~RB~int();~_ddv_module_description~0 := ~const~array~~LB~int~RB~int();~_ddv_module_license~0 := ~_ddv_module_license~0[0 := 71];~_ddv_module_license~0 := ~_ddv_module_license~0[1 := 80];~_ddv_module_license~0 := ~_ddv_module_license~0[2 := 76];~_ddv_module_license~0 := ~_ddv_module_license~0[3 := 0];~nowayout~0 := 0;~_ddv_module_param_nowayout~0 := ~const~array~~LB~int~RB~int();~#zf_info~0.base, ~#zf_info~0.offset := 27, 0;call #Ultimate.allocInit(40, 27);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~int(~bitwiseOr(32768, 256), ~#zf_info~0.base, ~#zf_info~0.offset, 4);call write~unchecked~int(1, ~#zf_info~0.base, 4 + ~#zf_info~0.offset, 4);call write~init~int(0, ~#zf_info~0.base, 8 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 9 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 10 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 11 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 12 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 13 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 14 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 15 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 16 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 17 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 18 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 19 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 20 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 21 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 22 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 23 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 24 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 25 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 26 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 27 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 28 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 29 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 30 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 31 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 32 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 33 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 34 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 35 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 36 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 37 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 38 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 39 + ~#zf_info~0.offset, 1);~action~0 := 0;~_ddv_module_param_action~0 := ~const~array~~LB~int~RB~int();~zf_action~0 := 2048;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28, 0;call #Ultimate.allocInit(4, 28);call write~init~int(0, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4);~zf_expect_close~0 := 0;~#zf_lock~0.base, ~#zf_lock~0.offset := 29, 0;call #Ultimate.allocInit(8, 29);call write~init~int(0, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4);call write~init~int(0, ~#zf_lock~0.base, 4 + ~#zf_lock~0.offset, 4);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30, 0;call #Ultimate.allocInit(8, 30);call write~init~int(0, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4);call write~init~int(0, ~#zf_port_lock~0.base, 4 + ~#zf_port_lock~0.offset, 4);~#zf_timer~0.base, ~#zf_timer~0.offset := 31, 0;call #Ultimate.allocInit(16, 31);call write~init~int(0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 12 + ~#zf_timer~0.offset, 2);call write~init~int(0, ~#zf_timer~0.base, 14 + ~#zf_timer~0.offset, 2);~next_heartbeat~0 := 0;~#zf_fops~0.base, ~#zf_fops~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);#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$(0, 0, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, 4 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, 12 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, 24 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, 40 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, 48 + ~#zf_fops~0.offset, 4);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33, 0;call #Ultimate.allocInit(12, 33);call write~init~int(130, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(14, 0, ~#zf_miscdev~0.base, 4 + ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, 8 + ~#zf_miscdev~0.offset, 4);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34, 0;call #Ultimate.allocInit(12, 34);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_notifier~0.base, 4 + ~#zf_notifier~0.offset, 4);call write~init~int(0, ~#zf_notifier~0.base, 8 + ~#zf_notifier~0.offset, 4);~_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 := 35, 0;call #Ultimate.allocInit(16, 35);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, 4 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 8 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 12 + ~#fixed_cdev~0.offset, 4);~fixed_cdev_used~0 := 0;~number_cdev_registered~0 := 0;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36, 0;call #Ultimate.allocInit(64, 36);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0;~number_fixed_genhd_used~0 := 0;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37, 0;call #Ultimate.allocInit(1280, 37);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38, 0;call #Ultimate.allocInit(1460, 38);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39, 0;call #Ultimate.allocInit(236, 39);#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 := 40, 0;call #Ultimate.allocInit(128, 40);#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 := 0;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41, 0;call #Ultimate.allocInit(6, 41);call write~init~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4);call write~init~int(0, ~#tasklet_registered~0.base, 4 + ~#tasklet_registered~0.offset, 2);~number_timer_registered~0 := 0;~#timer_registered~0.base, ~#timer_registered~0.offset := 42, 0;call #Ultimate.allocInit(4, 42);call write~init~$Pointer$(0, 0, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);#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 := 44, 0;call #Ultimate.allocInit(8, 44);call write~init~int(0, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4);call write~init~int(0, ~#kernel_lock~0.base, 4 + ~#kernel_lock~0.offset, 4);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45, 0;call #Ultimate.allocInit(460, 45);#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 := 0;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0, 0;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46, 0;call #Ultimate.allocInit(200, 46);#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 := 0;~ddv_ioport_request_len~0 := 0; {356#true} is VALID
[2022-02-20 16:50:42,339 INFO  L290        TraceCheckUtils]: 1: Hoare triple {356#true} assume { :end_inline_ULTIMATE.init } true;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 := 1;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; {356#true} is VALID
[2022-02-20 16:50:42,340 INFO  L272        TraceCheckUtils]: 2: Hoare triple {356#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {365#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2022-02-20 16:50:42,342 INFO  L290        TraceCheckUtils]: 3: Hoare triple {365#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {356#true} is VALID
[2022-02-20 16:50:42,344 INFO  L290        TraceCheckUtils]: 4: Hoare triple {356#true} assume true; {356#true} is VALID
[2022-02-20 16:50:42,344 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {356#true} {356#true} #846#return; {356#true} is VALID
[2022-02-20 16:50:42,345 INFO  L290        TraceCheckUtils]: 6: Hoare triple {356#true} init_kernel_~i~1#1 := 0; {361#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:42,345 INFO  L290        TraceCheckUtils]: 7: Hoare triple {361#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} assume !(init_kernel_~i~1#1 < 10); {357#false} is VALID
[2022-02-20 16:50:42,346 INFO  L290        TraceCheckUtils]: 8: Hoare triple {357#false} init_kernel_~i~1#1 := 0; {357#false} is VALID
[2022-02-20 16:50:42,347 INFO  L290        TraceCheckUtils]: 9: Hoare triple {357#false} assume !(init_kernel_~i~1#1 < 1); {357#false} is VALID
[2022-02-20 16:50:42,347 INFO  L290        TraceCheckUtils]: 10: Hoare triple {357#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~int } true;##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~int_#res#1;havoc ##fun~~TO~int_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {357#false} is VALID
[2022-02-20 16:50:42,347 INFO  L272        TraceCheckUtils]: 11: Hoare triple {357#false} call zf_init_#t~ret218#1 := printk(20, 0); {356#true} is VALID
[2022-02-20 16:50:42,348 INFO  L290        TraceCheckUtils]: 12: Hoare triple {356#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {356#true} is VALID
[2022-02-20 16:50:42,350 INFO  L290        TraceCheckUtils]: 13: Hoare triple {356#true} assume true; {356#true} is VALID
[2022-02-20 16:50:42,351 INFO  L284        TraceCheckUtils]: 14: Hoare quadruple {356#true} {357#false} #848#return; {357#false} is VALID
[2022-02-20 16:50:42,351 INFO  L290        TraceCheckUtils]: 15: Hoare triple {357#false} assume -2147483648 <= zf_init_#t~ret218#1 && zf_init_#t~ret218#1 <= 2147483647;havoc zf_init_#t~ret218#1; {357#false} is VALID
[2022-02-20 16:50:42,351 INFO  L272        TraceCheckUtils]: 16: Hoare triple {357#false} call zf_init_#t~ret219#1 := zf_readw(2); {357#false} is VALID
[2022-02-20 16:50:42,351 INFO  L290        TraceCheckUtils]: 17: Hoare triple {357#false} ~port#1 := #in~port#1; {357#false} is VALID
[2022-02-20 16:50:42,352 INFO  L272        TraceCheckUtils]: 18: Hoare triple {357#false} call outb(~port#1, 536); {357#false} is VALID
[2022-02-20 16:50:42,352 INFO  L290        TraceCheckUtils]: 19: Hoare triple {357#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {357#false} is VALID
[2022-02-20 16:50:42,352 INFO  L290        TraceCheckUtils]: 20: Hoare triple {357#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~port#1 % 4294967296 >= ~ddv_ioport_request_start~0 % 4294967296 && ~port#1 % 4294967296 < (~ddv_ioport_request_start~0 + ~ddv_ioport_request_len~0) % 4294967296 then 1 else 0), 26, 0;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {357#false} is VALID
[2022-02-20 16:50:42,352 INFO  L290        TraceCheckUtils]: 21: Hoare triple {357#false} assume 0 == __VERIFIER_assert_~expression#1; {357#false} is VALID
[2022-02-20 16:50:42,353 INFO  L290        TraceCheckUtils]: 22: Hoare triple {357#false} assume !false; {357#false} is VALID
[2022-02-20 16:50:42,353 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 16:50:42,354 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 16:50:42,354 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889884443]
[2022-02-20 16:50:42,355 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889884443] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 16:50:42,355 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 16:50:42,355 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-20 16:50:42,357 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772316201]
[2022-02-20 16:50:42,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 16:50:42,362 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23
[2022-02-20 16:50:42,363 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-02-20 16:50:42,366 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:50:42,399 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:50:42,399 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-20 16:50:42,400 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 16:50:42,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-20 16:50:42,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-20 16:50:42,428 INFO  L87              Difference]: Start difference. First operand  has 353 states, 247 states have (on average 1.360323886639676) internal successors, (336), 253 states have internal predecessors, (336), 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 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:50:45,333 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:45,334 INFO  L93              Difference]: Finished difference Result 712 states and 1032 transitions.
[2022-02-20 16:50:45,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2022-02-20 16:50:45,334 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23
[2022-02-20 16:50:45,335 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 16:50:45,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:50:45,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1032 transitions.
[2022-02-20 16:50:45,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:50:45,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1032 transitions.
[2022-02-20 16:50:45,411 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1032 transitions.
[2022-02-20 16:50:46,339 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 1032 edges. 1032 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:50:46,370 INFO  L225             Difference]: With dead ends: 712
[2022-02-20 16:50:46,371 INFO  L226             Difference]: Without dead ends: 355
[2022-02-20 16:50:46,377 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-20 16:50:46,380 INFO  L933         BasicCegarLoop]: 462 mSDtfsCounter, 86 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-02-20 16:50:46,381 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 1045 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-02-20 16:50:46,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 355 states.
[2022-02-20 16:50:46,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 345.
[2022-02-20 16:50:46,441 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 16:50:46,447 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:46,451 INFO  L74              IsIncluded]: Start isIncluded. First operand 355 states. Second operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:46,455 INFO  L87              Difference]: Start difference. First operand 355 states. Second operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:46,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:46,476 INFO  L93              Difference]: Finished difference Result 355 states and 487 transitions.
[2022-02-20 16:50:46,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 355 states and 487 transitions.
[2022-02-20 16:50:46,481 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:50:46,481 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:50:46,483 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 355 states.
[2022-02-20 16:50:46,484 INFO  L87              Difference]: Start difference. First operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 355 states.
[2022-02-20 16:50:46,501 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:46,501 INFO  L93              Difference]: Finished difference Result 355 states and 487 transitions.
[2022-02-20 16:50:46,501 INFO  L276                IsEmpty]: Start isEmpty. Operand 355 states and 487 transitions.
[2022-02-20 16:50:46,503 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:50:46,503 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:50:46,504 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-20 16:50:46,504 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 16:50:46,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:46,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 475 transitions.
[2022-02-20 16:50:46,524 INFO  L78                 Accepts]: Start accepts. Automaton has 345 states and 475 transitions. Word has length 23
[2022-02-20 16:50:46,524 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-20 16:50:46,524 INFO  L470      AbstractCegarLoop]: Abstraction has 345 states and 475 transitions.
[2022-02-20 16:50:46,525 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:50:46,525 INFO  L276                IsEmpty]: Start isEmpty. Operand 345 states and 475 transitions.
[2022-02-20 16:50:46,526 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-02-20 16:50:46,526 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-20 16:50:46,526 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 16:50:46,526 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-20 16:50:46,527 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting outbErr0ASSERT_VIOLATIONERROR_FUNCTION === [outbErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 16:50:46,527 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 16:50:46,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 2040210559, now seen corresponding path program 1 times
[2022-02-20 16:50:46,528 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 16:50:46,528 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591626380]
[2022-02-20 16:50:46,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:50:46,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 16:50:46,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:46,651 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-02-20 16:50:46,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:46,665 INFO  L290        TraceCheckUtils]: 0: Hoare triple {2545#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {2535#true} is VALID
[2022-02-20 16:50:46,665 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2535#true} assume true; {2535#true} is VALID
[2022-02-20 16:50:46,665 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {2535#true} {2535#true} #846#return; {2535#true} is VALID
[2022-02-20 16:50:46,666 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2022-02-20 16:50:46,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:46,673 INFO  L290        TraceCheckUtils]: 0: Hoare triple {2535#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {2535#true} is VALID
[2022-02-20 16:50:46,674 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2535#true} assume true; {2535#true} is VALID
[2022-02-20 16:50:46,674 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {2535#true} {2536#false} #848#return; {2536#false} is VALID
[2022-02-20 16:50:46,674 INFO  L290        TraceCheckUtils]: 0: Hoare triple {2535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(31, 5);call #Ultimate.allocInit(4, 6);call write~init~int(71, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(76, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(75, 7);call #Ultimate.allocInit(18, 8);call #Ultimate.allocInit(73, 9);call #Ultimate.allocInit(44, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(69, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(6, 15);call write~init~int(82, 15, 0, 1);call write~init~int(69, 15, 1, 1);call write~init~int(83, 15, 2, 1);call write~init~int(69, 15, 3, 1);call write~init~int(84, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(4, 16);call write~init~int(83, 16, 0, 1);call write~init~int(77, 16, 1, 1);call write~init~int(73, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(78, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(73, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(83, 18, 0, 1);call write~init~int(67, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(40, 19);call #Ultimate.allocInit(58, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(14, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(22, 26);~current_execution_context~0 := 0;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0, 0;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0, 0;~jiffies~0 := 0;~_ddv_module_author~0 := ~const~array~~LB~int~RB~int();~_ddv_module_description~0 := ~const~array~~LB~int~RB~int();~_ddv_module_license~0 := ~_ddv_module_license~0[0 := 71];~_ddv_module_license~0 := ~_ddv_module_license~0[1 := 80];~_ddv_module_license~0 := ~_ddv_module_license~0[2 := 76];~_ddv_module_license~0 := ~_ddv_module_license~0[3 := 0];~nowayout~0 := 0;~_ddv_module_param_nowayout~0 := ~const~array~~LB~int~RB~int();~#zf_info~0.base, ~#zf_info~0.offset := 27, 0;call #Ultimate.allocInit(40, 27);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~int(~bitwiseOr(32768, 256), ~#zf_info~0.base, ~#zf_info~0.offset, 4);call write~unchecked~int(1, ~#zf_info~0.base, 4 + ~#zf_info~0.offset, 4);call write~init~int(0, ~#zf_info~0.base, 8 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 9 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 10 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 11 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 12 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 13 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 14 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 15 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 16 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 17 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 18 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 19 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 20 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 21 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 22 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 23 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 24 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 25 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 26 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 27 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 28 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 29 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 30 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 31 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 32 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 33 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 34 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 35 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 36 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 37 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 38 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 39 + ~#zf_info~0.offset, 1);~action~0 := 0;~_ddv_module_param_action~0 := ~const~array~~LB~int~RB~int();~zf_action~0 := 2048;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28, 0;call #Ultimate.allocInit(4, 28);call write~init~int(0, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4);~zf_expect_close~0 := 0;~#zf_lock~0.base, ~#zf_lock~0.offset := 29, 0;call #Ultimate.allocInit(8, 29);call write~init~int(0, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4);call write~init~int(0, ~#zf_lock~0.base, 4 + ~#zf_lock~0.offset, 4);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30, 0;call #Ultimate.allocInit(8, 30);call write~init~int(0, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4);call write~init~int(0, ~#zf_port_lock~0.base, 4 + ~#zf_port_lock~0.offset, 4);~#zf_timer~0.base, ~#zf_timer~0.offset := 31, 0;call #Ultimate.allocInit(16, 31);call write~init~int(0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 12 + ~#zf_timer~0.offset, 2);call write~init~int(0, ~#zf_timer~0.base, 14 + ~#zf_timer~0.offset, 2);~next_heartbeat~0 := 0;~#zf_fops~0.base, ~#zf_fops~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);#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$(0, 0, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, 4 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, 12 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, 24 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, 40 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, 48 + ~#zf_fops~0.offset, 4);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33, 0;call #Ultimate.allocInit(12, 33);call write~init~int(130, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(14, 0, ~#zf_miscdev~0.base, 4 + ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, 8 + ~#zf_miscdev~0.offset, 4);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34, 0;call #Ultimate.allocInit(12, 34);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_notifier~0.base, 4 + ~#zf_notifier~0.offset, 4);call write~init~int(0, ~#zf_notifier~0.base, 8 + ~#zf_notifier~0.offset, 4);~_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 := 35, 0;call #Ultimate.allocInit(16, 35);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, 4 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 8 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 12 + ~#fixed_cdev~0.offset, 4);~fixed_cdev_used~0 := 0;~number_cdev_registered~0 := 0;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36, 0;call #Ultimate.allocInit(64, 36);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0;~number_fixed_genhd_used~0 := 0;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37, 0;call #Ultimate.allocInit(1280, 37);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38, 0;call #Ultimate.allocInit(1460, 38);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39, 0;call #Ultimate.allocInit(236, 39);#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 := 40, 0;call #Ultimate.allocInit(128, 40);#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 := 0;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41, 0;call #Ultimate.allocInit(6, 41);call write~init~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4);call write~init~int(0, ~#tasklet_registered~0.base, 4 + ~#tasklet_registered~0.offset, 2);~number_timer_registered~0 := 0;~#timer_registered~0.base, ~#timer_registered~0.offset := 42, 0;call #Ultimate.allocInit(4, 42);call write~init~$Pointer$(0, 0, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);#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 := 44, 0;call #Ultimate.allocInit(8, 44);call write~init~int(0, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4);call write~init~int(0, ~#kernel_lock~0.base, 4 + ~#kernel_lock~0.offset, 4);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45, 0;call #Ultimate.allocInit(460, 45);#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 := 0;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0, 0;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46, 0;call #Ultimate.allocInit(200, 46);#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 := 0;~ddv_ioport_request_len~0 := 0; {2535#true} is VALID
[2022-02-20 16:50:46,675 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2535#true} assume { :end_inline_ULTIMATE.init } true;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 := 1;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; {2535#true} is VALID
[2022-02-20 16:50:46,676 INFO  L272        TraceCheckUtils]: 2: Hoare triple {2535#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {2545#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2022-02-20 16:50:46,676 INFO  L290        TraceCheckUtils]: 3: Hoare triple {2545#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {2535#true} is VALID
[2022-02-20 16:50:46,676 INFO  L290        TraceCheckUtils]: 4: Hoare triple {2535#true} assume true; {2535#true} is VALID
[2022-02-20 16:50:46,676 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {2535#true} {2535#true} #846#return; {2535#true} is VALID
[2022-02-20 16:50:46,677 INFO  L290        TraceCheckUtils]: 6: Hoare triple {2535#true} init_kernel_~i~1#1 := 0; {2540#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:46,677 INFO  L290        TraceCheckUtils]: 7: Hoare triple {2540#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {2540#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:46,678 INFO  L290        TraceCheckUtils]: 8: Hoare triple {2540#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {2541#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} is VALID
[2022-02-20 16:50:46,679 INFO  L290        TraceCheckUtils]: 9: Hoare triple {2541#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} assume !(init_kernel_~i~1#1 < 10); {2536#false} is VALID
[2022-02-20 16:50:46,679 INFO  L290        TraceCheckUtils]: 10: Hoare triple {2536#false} init_kernel_~i~1#1 := 0; {2536#false} is VALID
[2022-02-20 16:50:46,680 INFO  L290        TraceCheckUtils]: 11: Hoare triple {2536#false} assume !!(init_kernel_~i~1#1 < 1);call write~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1, 4);call write~int(0, ~#tasklet_registered~0.base, 4 + (~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1), 2); {2536#false} is VALID
[2022-02-20 16:50:46,680 INFO  L290        TraceCheckUtils]: 12: Hoare triple {2536#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post299#1;havoc init_kernel_#t~post299#1; {2536#false} is VALID
[2022-02-20 16:50:46,680 INFO  L290        TraceCheckUtils]: 13: Hoare triple {2536#false} assume !(init_kernel_~i~1#1 < 1); {2536#false} is VALID
[2022-02-20 16:50:46,680 INFO  L290        TraceCheckUtils]: 14: Hoare triple {2536#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~int } true;##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~int_#res#1;havoc ##fun~~TO~int_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {2536#false} is VALID
[2022-02-20 16:50:46,680 INFO  L272        TraceCheckUtils]: 15: Hoare triple {2536#false} call zf_init_#t~ret218#1 := printk(20, 0); {2535#true} is VALID
[2022-02-20 16:50:46,681 INFO  L290        TraceCheckUtils]: 16: Hoare triple {2535#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {2535#true} is VALID
[2022-02-20 16:50:46,681 INFO  L290        TraceCheckUtils]: 17: Hoare triple {2535#true} assume true; {2535#true} is VALID
[2022-02-20 16:50:46,681 INFO  L284        TraceCheckUtils]: 18: Hoare quadruple {2535#true} {2536#false} #848#return; {2536#false} is VALID
[2022-02-20 16:50:46,681 INFO  L290        TraceCheckUtils]: 19: Hoare triple {2536#false} assume -2147483648 <= zf_init_#t~ret218#1 && zf_init_#t~ret218#1 <= 2147483647;havoc zf_init_#t~ret218#1; {2536#false} is VALID
[2022-02-20 16:50:46,682 INFO  L272        TraceCheckUtils]: 20: Hoare triple {2536#false} call zf_init_#t~ret219#1 := zf_readw(2); {2536#false} is VALID
[2022-02-20 16:50:46,682 INFO  L290        TraceCheckUtils]: 21: Hoare triple {2536#false} ~port#1 := #in~port#1; {2536#false} is VALID
[2022-02-20 16:50:46,682 INFO  L272        TraceCheckUtils]: 22: Hoare triple {2536#false} call outb(~port#1, 536); {2536#false} is VALID
[2022-02-20 16:50:46,682 INFO  L290        TraceCheckUtils]: 23: Hoare triple {2536#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {2536#false} is VALID
[2022-02-20 16:50:46,683 INFO  L290        TraceCheckUtils]: 24: Hoare triple {2536#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~port#1 % 4294967296 >= ~ddv_ioport_request_start~0 % 4294967296 && ~port#1 % 4294967296 < (~ddv_ioport_request_start~0 + ~ddv_ioport_request_len~0) % 4294967296 then 1 else 0), 26, 0;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {2536#false} is VALID
[2022-02-20 16:50:46,688 INFO  L290        TraceCheckUtils]: 25: Hoare triple {2536#false} assume 0 == __VERIFIER_assert_~expression#1; {2536#false} is VALID
[2022-02-20 16:50:46,690 INFO  L290        TraceCheckUtils]: 26: Hoare triple {2536#false} assume !false; {2536#false} is VALID
[2022-02-20 16:50:46,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:50:46,692 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 16:50:46,692 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591626380]
[2022-02-20 16:50:46,692 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591626380] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-20 16:50:46,692 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587835224]
[2022-02-20 16:50:46,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:50:46,693 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-20 16:50:46,693 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 16:50:46,695 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-20 16:50:46,707 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-02-20 16:50:47,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:47,006 INFO  L263         TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-02-20 16:50:47,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:47,059 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-20 16:50:47,200 INFO  L290        TraceCheckUtils]: 0: Hoare triple {2535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(31, 5);call #Ultimate.allocInit(4, 6);call write~init~int(71, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(76, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(75, 7);call #Ultimate.allocInit(18, 8);call #Ultimate.allocInit(73, 9);call #Ultimate.allocInit(44, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(69, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(6, 15);call write~init~int(82, 15, 0, 1);call write~init~int(69, 15, 1, 1);call write~init~int(83, 15, 2, 1);call write~init~int(69, 15, 3, 1);call write~init~int(84, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(4, 16);call write~init~int(83, 16, 0, 1);call write~init~int(77, 16, 1, 1);call write~init~int(73, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(78, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(73, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(83, 18, 0, 1);call write~init~int(67, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(40, 19);call #Ultimate.allocInit(58, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(14, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(22, 26);~current_execution_context~0 := 0;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0, 0;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0, 0;~jiffies~0 := 0;~_ddv_module_author~0 := ~const~array~~LB~int~RB~int();~_ddv_module_description~0 := ~const~array~~LB~int~RB~int();~_ddv_module_license~0 := ~_ddv_module_license~0[0 := 71];~_ddv_module_license~0 := ~_ddv_module_license~0[1 := 80];~_ddv_module_license~0 := ~_ddv_module_license~0[2 := 76];~_ddv_module_license~0 := ~_ddv_module_license~0[3 := 0];~nowayout~0 := 0;~_ddv_module_param_nowayout~0 := ~const~array~~LB~int~RB~int();~#zf_info~0.base, ~#zf_info~0.offset := 27, 0;call #Ultimate.allocInit(40, 27);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~int(~bitwiseOr(32768, 256), ~#zf_info~0.base, ~#zf_info~0.offset, 4);call write~unchecked~int(1, ~#zf_info~0.base, 4 + ~#zf_info~0.offset, 4);call write~init~int(0, ~#zf_info~0.base, 8 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 9 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 10 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 11 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 12 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 13 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 14 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 15 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 16 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 17 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 18 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 19 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 20 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 21 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 22 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 23 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 24 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 25 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 26 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 27 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 28 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 29 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 30 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 31 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 32 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 33 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 34 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 35 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 36 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 37 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 38 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 39 + ~#zf_info~0.offset, 1);~action~0 := 0;~_ddv_module_param_action~0 := ~const~array~~LB~int~RB~int();~zf_action~0 := 2048;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28, 0;call #Ultimate.allocInit(4, 28);call write~init~int(0, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4);~zf_expect_close~0 := 0;~#zf_lock~0.base, ~#zf_lock~0.offset := 29, 0;call #Ultimate.allocInit(8, 29);call write~init~int(0, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4);call write~init~int(0, ~#zf_lock~0.base, 4 + ~#zf_lock~0.offset, 4);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30, 0;call #Ultimate.allocInit(8, 30);call write~init~int(0, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4);call write~init~int(0, ~#zf_port_lock~0.base, 4 + ~#zf_port_lock~0.offset, 4);~#zf_timer~0.base, ~#zf_timer~0.offset := 31, 0;call #Ultimate.allocInit(16, 31);call write~init~int(0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 12 + ~#zf_timer~0.offset, 2);call write~init~int(0, ~#zf_timer~0.base, 14 + ~#zf_timer~0.offset, 2);~next_heartbeat~0 := 0;~#zf_fops~0.base, ~#zf_fops~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);#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$(0, 0, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, 4 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, 12 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, 24 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, 40 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, 48 + ~#zf_fops~0.offset, 4);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33, 0;call #Ultimate.allocInit(12, 33);call write~init~int(130, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(14, 0, ~#zf_miscdev~0.base, 4 + ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, 8 + ~#zf_miscdev~0.offset, 4);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34, 0;call #Ultimate.allocInit(12, 34);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_notifier~0.base, 4 + ~#zf_notifier~0.offset, 4);call write~init~int(0, ~#zf_notifier~0.base, 8 + ~#zf_notifier~0.offset, 4);~_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 := 35, 0;call #Ultimate.allocInit(16, 35);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, 4 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 8 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 12 + ~#fixed_cdev~0.offset, 4);~fixed_cdev_used~0 := 0;~number_cdev_registered~0 := 0;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36, 0;call #Ultimate.allocInit(64, 36);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0;~number_fixed_genhd_used~0 := 0;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37, 0;call #Ultimate.allocInit(1280, 37);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38, 0;call #Ultimate.allocInit(1460, 38);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39, 0;call #Ultimate.allocInit(236, 39);#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 := 40, 0;call #Ultimate.allocInit(128, 40);#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 := 0;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41, 0;call #Ultimate.allocInit(6, 41);call write~init~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4);call write~init~int(0, ~#tasklet_registered~0.base, 4 + ~#tasklet_registered~0.offset, 2);~number_timer_registered~0 := 0;~#timer_registered~0.base, ~#timer_registered~0.offset := 42, 0;call #Ultimate.allocInit(4, 42);call write~init~$Pointer$(0, 0, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);#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 := 44, 0;call #Ultimate.allocInit(8, 44);call write~init~int(0, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4);call write~init~int(0, ~#kernel_lock~0.base, 4 + ~#kernel_lock~0.offset, 4);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45, 0;call #Ultimate.allocInit(460, 45);#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 := 0;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0, 0;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46, 0;call #Ultimate.allocInit(200, 46);#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 := 0;~ddv_ioport_request_len~0 := 0; {2535#true} is VALID
[2022-02-20 16:50:47,200 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2535#true} assume { :end_inline_ULTIMATE.init } true;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 := 1;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; {2535#true} is VALID
[2022-02-20 16:50:47,201 INFO  L272        TraceCheckUtils]: 2: Hoare triple {2535#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {2535#true} is VALID
[2022-02-20 16:50:47,201 INFO  L290        TraceCheckUtils]: 3: Hoare triple {2535#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {2535#true} is VALID
[2022-02-20 16:50:47,201 INFO  L290        TraceCheckUtils]: 4: Hoare triple {2535#true} assume true; {2535#true} is VALID
[2022-02-20 16:50:47,201 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {2535#true} {2535#true} #846#return; {2535#true} is VALID
[2022-02-20 16:50:47,202 INFO  L290        TraceCheckUtils]: 6: Hoare triple {2535#true} init_kernel_~i~1#1 := 0; {2567#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:47,202 INFO  L290        TraceCheckUtils]: 7: Hoare triple {2567#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {2567#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:47,203 INFO  L290        TraceCheckUtils]: 8: Hoare triple {2567#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {2541#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} is VALID
[2022-02-20 16:50:47,204 INFO  L290        TraceCheckUtils]: 9: Hoare triple {2541#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} assume !(init_kernel_~i~1#1 < 10); {2536#false} is VALID
[2022-02-20 16:50:47,204 INFO  L290        TraceCheckUtils]: 10: Hoare triple {2536#false} init_kernel_~i~1#1 := 0; {2536#false} is VALID
[2022-02-20 16:50:47,204 INFO  L290        TraceCheckUtils]: 11: Hoare triple {2536#false} assume !!(init_kernel_~i~1#1 < 1);call write~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1, 4);call write~int(0, ~#tasklet_registered~0.base, 4 + (~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1), 2); {2536#false} is VALID
[2022-02-20 16:50:47,205 INFO  L290        TraceCheckUtils]: 12: Hoare triple {2536#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post299#1;havoc init_kernel_#t~post299#1; {2536#false} is VALID
[2022-02-20 16:50:47,205 INFO  L290        TraceCheckUtils]: 13: Hoare triple {2536#false} assume !(init_kernel_~i~1#1 < 1); {2536#false} is VALID
[2022-02-20 16:50:47,205 INFO  L290        TraceCheckUtils]: 14: Hoare triple {2536#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~int } true;##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~int_#res#1;havoc ##fun~~TO~int_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {2536#false} is VALID
[2022-02-20 16:50:47,205 INFO  L272        TraceCheckUtils]: 15: Hoare triple {2536#false} call zf_init_#t~ret218#1 := printk(20, 0); {2536#false} is VALID
[2022-02-20 16:50:47,206 INFO  L290        TraceCheckUtils]: 16: Hoare triple {2536#false} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {2536#false} is VALID
[2022-02-20 16:50:47,206 INFO  L290        TraceCheckUtils]: 17: Hoare triple {2536#false} assume true; {2536#false} is VALID
[2022-02-20 16:50:47,206 INFO  L284        TraceCheckUtils]: 18: Hoare quadruple {2536#false} {2536#false} #848#return; {2536#false} is VALID
[2022-02-20 16:50:47,206 INFO  L290        TraceCheckUtils]: 19: Hoare triple {2536#false} assume -2147483648 <= zf_init_#t~ret218#1 && zf_init_#t~ret218#1 <= 2147483647;havoc zf_init_#t~ret218#1; {2536#false} is VALID
[2022-02-20 16:50:47,207 INFO  L272        TraceCheckUtils]: 20: Hoare triple {2536#false} call zf_init_#t~ret219#1 := zf_readw(2); {2536#false} is VALID
[2022-02-20 16:50:47,207 INFO  L290        TraceCheckUtils]: 21: Hoare triple {2536#false} ~port#1 := #in~port#1; {2536#false} is VALID
[2022-02-20 16:50:47,207 INFO  L272        TraceCheckUtils]: 22: Hoare triple {2536#false} call outb(~port#1, 536); {2536#false} is VALID
[2022-02-20 16:50:47,207 INFO  L290        TraceCheckUtils]: 23: Hoare triple {2536#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {2536#false} is VALID
[2022-02-20 16:50:47,207 INFO  L290        TraceCheckUtils]: 24: Hoare triple {2536#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~port#1 % 4294967296 >= ~ddv_ioport_request_start~0 % 4294967296 && ~port#1 % 4294967296 < (~ddv_ioport_request_start~0 + ~ddv_ioport_request_len~0) % 4294967296 then 1 else 0), 26, 0;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {2536#false} is VALID
[2022-02-20 16:50:47,208 INFO  L290        TraceCheckUtils]: 25: Hoare triple {2536#false} assume 0 == __VERIFIER_assert_~expression#1; {2536#false} is VALID
[2022-02-20 16:50:47,208 INFO  L290        TraceCheckUtils]: 26: Hoare triple {2536#false} assume !false; {2536#false} is VALID
[2022-02-20 16:50:47,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:50:47,208 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-20 16:50:47,323 INFO  L290        TraceCheckUtils]: 26: Hoare triple {2536#false} assume !false; {2536#false} is VALID
[2022-02-20 16:50:47,323 INFO  L290        TraceCheckUtils]: 25: Hoare triple {2536#false} assume 0 == __VERIFIER_assert_~expression#1; {2536#false} is VALID
[2022-02-20 16:50:47,323 INFO  L290        TraceCheckUtils]: 24: Hoare triple {2536#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~port#1 % 4294967296 >= ~ddv_ioport_request_start~0 % 4294967296 && ~port#1 % 4294967296 < (~ddv_ioport_request_start~0 + ~ddv_ioport_request_len~0) % 4294967296 then 1 else 0), 26, 0;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {2536#false} is VALID
[2022-02-20 16:50:47,324 INFO  L290        TraceCheckUtils]: 23: Hoare triple {2536#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {2536#false} is VALID
[2022-02-20 16:50:47,324 INFO  L272        TraceCheckUtils]: 22: Hoare triple {2536#false} call outb(~port#1, 536); {2536#false} is VALID
[2022-02-20 16:50:47,324 INFO  L290        TraceCheckUtils]: 21: Hoare triple {2536#false} ~port#1 := #in~port#1; {2536#false} is VALID
[2022-02-20 16:50:47,324 INFO  L272        TraceCheckUtils]: 20: Hoare triple {2536#false} call zf_init_#t~ret219#1 := zf_readw(2); {2536#false} is VALID
[2022-02-20 16:50:47,325 INFO  L290        TraceCheckUtils]: 19: Hoare triple {2536#false} assume -2147483648 <= zf_init_#t~ret218#1 && zf_init_#t~ret218#1 <= 2147483647;havoc zf_init_#t~ret218#1; {2536#false} is VALID
[2022-02-20 16:50:47,325 INFO  L284        TraceCheckUtils]: 18: Hoare quadruple {2535#true} {2536#false} #848#return; {2536#false} is VALID
[2022-02-20 16:50:47,325 INFO  L290        TraceCheckUtils]: 17: Hoare triple {2535#true} assume true; {2535#true} is VALID
[2022-02-20 16:50:47,325 INFO  L290        TraceCheckUtils]: 16: Hoare triple {2535#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {2535#true} is VALID
[2022-02-20 16:50:47,325 INFO  L272        TraceCheckUtils]: 15: Hoare triple {2536#false} call zf_init_#t~ret218#1 := printk(20, 0); {2535#true} is VALID
[2022-02-20 16:50:47,326 INFO  L290        TraceCheckUtils]: 14: Hoare triple {2536#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~int } true;##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~int_#res#1;havoc ##fun~~TO~int_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {2536#false} is VALID
[2022-02-20 16:50:47,326 INFO  L290        TraceCheckUtils]: 13: Hoare triple {2536#false} assume !(init_kernel_~i~1#1 < 1); {2536#false} is VALID
[2022-02-20 16:50:47,328 INFO  L290        TraceCheckUtils]: 12: Hoare triple {2536#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post299#1;havoc init_kernel_#t~post299#1; {2536#false} is VALID
[2022-02-20 16:50:47,328 INFO  L290        TraceCheckUtils]: 11: Hoare triple {2536#false} assume !!(init_kernel_~i~1#1 < 1);call write~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1, 4);call write~int(0, ~#tasklet_registered~0.base, 4 + (~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1), 2); {2536#false} is VALID
[2022-02-20 16:50:47,328 INFO  L290        TraceCheckUtils]: 10: Hoare triple {2536#false} init_kernel_~i~1#1 := 0; {2536#false} is VALID
[2022-02-20 16:50:47,329 INFO  L290        TraceCheckUtils]: 9: Hoare triple {2679#(< |ULTIMATE.start_init_kernel_~i~1#1| 10)} assume !(init_kernel_~i~1#1 < 10); {2536#false} is VALID
[2022-02-20 16:50:47,330 INFO  L290        TraceCheckUtils]: 8: Hoare triple {2683#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {2679#(< |ULTIMATE.start_init_kernel_~i~1#1| 10)} is VALID
[2022-02-20 16:50:47,330 INFO  L290        TraceCheckUtils]: 7: Hoare triple {2683#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {2683#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} is VALID
[2022-02-20 16:50:47,331 INFO  L290        TraceCheckUtils]: 6: Hoare triple {2535#true} init_kernel_~i~1#1 := 0; {2683#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} is VALID
[2022-02-20 16:50:47,331 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {2535#true} {2535#true} #846#return; {2535#true} is VALID
[2022-02-20 16:50:47,331 INFO  L290        TraceCheckUtils]: 4: Hoare triple {2535#true} assume true; {2535#true} is VALID
[2022-02-20 16:50:47,331 INFO  L290        TraceCheckUtils]: 3: Hoare triple {2535#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {2535#true} is VALID
[2022-02-20 16:50:47,332 INFO  L272        TraceCheckUtils]: 2: Hoare triple {2535#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {2535#true} is VALID
[2022-02-20 16:50:47,332 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2535#true} assume { :end_inline_ULTIMATE.init } true;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 := 1;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; {2535#true} is VALID
[2022-02-20 16:50:47,332 INFO  L290        TraceCheckUtils]: 0: Hoare triple {2535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(31, 5);call #Ultimate.allocInit(4, 6);call write~init~int(71, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(76, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(75, 7);call #Ultimate.allocInit(18, 8);call #Ultimate.allocInit(73, 9);call #Ultimate.allocInit(44, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(69, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(6, 15);call write~init~int(82, 15, 0, 1);call write~init~int(69, 15, 1, 1);call write~init~int(83, 15, 2, 1);call write~init~int(69, 15, 3, 1);call write~init~int(84, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(4, 16);call write~init~int(83, 16, 0, 1);call write~init~int(77, 16, 1, 1);call write~init~int(73, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(78, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(73, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(83, 18, 0, 1);call write~init~int(67, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(40, 19);call #Ultimate.allocInit(58, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(14, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(22, 26);~current_execution_context~0 := 0;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0, 0;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0, 0;~jiffies~0 := 0;~_ddv_module_author~0 := ~const~array~~LB~int~RB~int();~_ddv_module_description~0 := ~const~array~~LB~int~RB~int();~_ddv_module_license~0 := ~_ddv_module_license~0[0 := 71];~_ddv_module_license~0 := ~_ddv_module_license~0[1 := 80];~_ddv_module_license~0 := ~_ddv_module_license~0[2 := 76];~_ddv_module_license~0 := ~_ddv_module_license~0[3 := 0];~nowayout~0 := 0;~_ddv_module_param_nowayout~0 := ~const~array~~LB~int~RB~int();~#zf_info~0.base, ~#zf_info~0.offset := 27, 0;call #Ultimate.allocInit(40, 27);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~int(~bitwiseOr(32768, 256), ~#zf_info~0.base, ~#zf_info~0.offset, 4);call write~unchecked~int(1, ~#zf_info~0.base, 4 + ~#zf_info~0.offset, 4);call write~init~int(0, ~#zf_info~0.base, 8 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 9 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 10 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 11 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 12 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 13 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 14 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 15 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 16 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 17 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 18 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 19 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 20 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 21 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 22 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 23 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 24 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 25 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 26 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 27 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 28 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 29 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 30 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 31 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 32 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 33 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 34 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 35 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 36 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 37 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 38 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 39 + ~#zf_info~0.offset, 1);~action~0 := 0;~_ddv_module_param_action~0 := ~const~array~~LB~int~RB~int();~zf_action~0 := 2048;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28, 0;call #Ultimate.allocInit(4, 28);call write~init~int(0, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4);~zf_expect_close~0 := 0;~#zf_lock~0.base, ~#zf_lock~0.offset := 29, 0;call #Ultimate.allocInit(8, 29);call write~init~int(0, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4);call write~init~int(0, ~#zf_lock~0.base, 4 + ~#zf_lock~0.offset, 4);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30, 0;call #Ultimate.allocInit(8, 30);call write~init~int(0, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4);call write~init~int(0, ~#zf_port_lock~0.base, 4 + ~#zf_port_lock~0.offset, 4);~#zf_timer~0.base, ~#zf_timer~0.offset := 31, 0;call #Ultimate.allocInit(16, 31);call write~init~int(0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 12 + ~#zf_timer~0.offset, 2);call write~init~int(0, ~#zf_timer~0.base, 14 + ~#zf_timer~0.offset, 2);~next_heartbeat~0 := 0;~#zf_fops~0.base, ~#zf_fops~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);#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$(0, 0, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, 4 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, 12 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, 24 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, 40 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, 48 + ~#zf_fops~0.offset, 4);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33, 0;call #Ultimate.allocInit(12, 33);call write~init~int(130, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(14, 0, ~#zf_miscdev~0.base, 4 + ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, 8 + ~#zf_miscdev~0.offset, 4);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34, 0;call #Ultimate.allocInit(12, 34);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_notifier~0.base, 4 + ~#zf_notifier~0.offset, 4);call write~init~int(0, ~#zf_notifier~0.base, 8 + ~#zf_notifier~0.offset, 4);~_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 := 35, 0;call #Ultimate.allocInit(16, 35);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, 4 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 8 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 12 + ~#fixed_cdev~0.offset, 4);~fixed_cdev_used~0 := 0;~number_cdev_registered~0 := 0;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36, 0;call #Ultimate.allocInit(64, 36);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0;~number_fixed_genhd_used~0 := 0;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37, 0;call #Ultimate.allocInit(1280, 37);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38, 0;call #Ultimate.allocInit(1460, 38);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39, 0;call #Ultimate.allocInit(236, 39);#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 := 40, 0;call #Ultimate.allocInit(128, 40);#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 := 0;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41, 0;call #Ultimate.allocInit(6, 41);call write~init~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4);call write~init~int(0, ~#tasklet_registered~0.base, 4 + ~#tasklet_registered~0.offset, 2);~number_timer_registered~0 := 0;~#timer_registered~0.base, ~#timer_registered~0.offset := 42, 0;call #Ultimate.allocInit(4, 42);call write~init~$Pointer$(0, 0, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);#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 := 44, 0;call #Ultimate.allocInit(8, 44);call write~init~int(0, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4);call write~init~int(0, ~#kernel_lock~0.base, 4 + ~#kernel_lock~0.offset, 4);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45, 0;call #Ultimate.allocInit(460, 45);#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 := 0;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0, 0;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46, 0;call #Ultimate.allocInit(200, 46);#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 := 0;~ddv_ioport_request_len~0 := 0; {2535#true} is VALID
[2022-02-20 16:50:47,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:50:47,333 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587835224] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-20 16:50:47,333 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-20 16:50:47,333 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2022-02-20 16:50:47,334 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340874702]
[2022-02-20 16:50:47,335 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-20 16:50:47,336 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27
[2022-02-20 16:50:47,338 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-02-20 16:50:47,338 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:47,378 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:50:47,379 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-20 16:50:47,379 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 16:50:47,380 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-20 16:50:47,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2022-02-20 16:50:47,380 INFO  L87              Difference]: Start difference. First operand 345 states and 475 transitions. Second operand  has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:51,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:51,366 INFO  L93              Difference]: Finished difference Result 698 states and 961 transitions.
[2022-02-20 16:50:51,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2022-02-20 16:50:51,366 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27
[2022-02-20 16:50:51,366 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 16:50:51,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:51,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions.
[2022-02-20 16:50:51,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:51,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions.
[2022-02-20 16:50:51,423 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 960 transitions.
[2022-02-20 16:50:52,159 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 960 edges. 960 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:50:52,181 INFO  L225             Difference]: With dead ends: 698
[2022-02-20 16:50:52,182 INFO  L226             Difference]: Without dead ends: 360
[2022-02-20 16:50:52,183 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2022-02-20 16:50:52,184 INFO  L933         BasicCegarLoop]: 448 mSDtfsCounter, 421 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-20 16:50:52,185 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 1526 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-20 16:50:52,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 360 states.
[2022-02-20 16:50:52,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 351.
[2022-02-20 16:50:52,228 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 16:50:52,230 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand  has 351 states, 248 states have (on average 1.3306451612903225) internal successors, (330), 254 states have internal predecessors, (330), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:52,231 INFO  L74              IsIncluded]: Start isIncluded. First operand 360 states. Second operand  has 351 states, 248 states have (on average 1.3306451612903225) internal successors, (330), 254 states have internal predecessors, (330), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:52,232 INFO  L87              Difference]: Start difference. First operand 360 states. Second operand  has 351 states, 248 states have (on average 1.3306451612903225) internal successors, (330), 254 states have internal predecessors, (330), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:52,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:52,250 INFO  L93              Difference]: Finished difference Result 360 states and 492 transitions.
[2022-02-20 16:50:52,250 INFO  L276                IsEmpty]: Start isEmpty. Operand 360 states and 492 transitions.
[2022-02-20 16:50:52,252 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:50:52,252 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:50:52,254 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 351 states, 248 states have (on average 1.3306451612903225) internal successors, (330), 254 states have internal predecessors, (330), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 360 states.
[2022-02-20 16:50:52,255 INFO  L87              Difference]: Start difference. First operand  has 351 states, 248 states have (on average 1.3306451612903225) internal successors, (330), 254 states have internal predecessors, (330), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 360 states.
[2022-02-20 16:50:52,274 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:52,274 INFO  L93              Difference]: Finished difference Result 360 states and 492 transitions.
[2022-02-20 16:50:52,274 INFO  L276                IsEmpty]: Start isEmpty. Operand 360 states and 492 transitions.
[2022-02-20 16:50:52,276 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:50:52,276 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:50:52,277 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-20 16:50:52,277 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 16:50:52,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 351 states, 248 states have (on average 1.3306451612903225) internal successors, (330), 254 states have internal predecessors, (330), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:52,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 481 transitions.
[2022-02-20 16:50:52,295 INFO  L78                 Accepts]: Start accepts. Automaton has 351 states and 481 transitions. Word has length 27
[2022-02-20 16:50:52,295 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-20 16:50:52,295 INFO  L470      AbstractCegarLoop]: Abstraction has 351 states and 481 transitions.
[2022-02-20 16:50:52,295 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:52,296 INFO  L276                IsEmpty]: Start isEmpty. Operand 351 states and 481 transitions.
[2022-02-20 16:50:52,296 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-02-20 16:50:52,296 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-20 16:50:52,296 INFO  L514         BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 16:50:52,326 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2022-02-20 16:50:52,524 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-20 16:50:52,524 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting outbErr0ASSERT_VIOLATIONERROR_FUNCTION === [outbErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 16:50:52,525 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 16:50:52,525 INFO  L85        PathProgramCache]: Analyzing trace with hash -792000699, now seen corresponding path program 2 times
[2022-02-20 16:50:52,525 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 16:50:52,525 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633001867]
[2022-02-20 16:50:52,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:50:52,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 16:50:52,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:52,695 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-02-20 16:50:52,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:52,706 INFO  L290        TraceCheckUtils]: 0: Hoare triple {4884#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {4871#true} is VALID
[2022-02-20 16:50:52,707 INFO  L290        TraceCheckUtils]: 1: Hoare triple {4871#true} assume true; {4871#true} is VALID
[2022-02-20 16:50:52,707 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {4871#true} {4871#true} #846#return; {4871#true} is VALID
[2022-02-20 16:50:52,708 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2022-02-20 16:50:52,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:52,715 INFO  L290        TraceCheckUtils]: 0: Hoare triple {4871#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {4871#true} is VALID
[2022-02-20 16:50:52,717 INFO  L290        TraceCheckUtils]: 1: Hoare triple {4871#true} assume true; {4871#true} is VALID
[2022-02-20 16:50:52,718 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {4871#true} {4872#false} #848#return; {4872#false} is VALID
[2022-02-20 16:50:52,727 INFO  L290        TraceCheckUtils]: 0: Hoare triple {4871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(31, 5);call #Ultimate.allocInit(4, 6);call write~init~int(71, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(76, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(75, 7);call #Ultimate.allocInit(18, 8);call #Ultimate.allocInit(73, 9);call #Ultimate.allocInit(44, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(69, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(6, 15);call write~init~int(82, 15, 0, 1);call write~init~int(69, 15, 1, 1);call write~init~int(83, 15, 2, 1);call write~init~int(69, 15, 3, 1);call write~init~int(84, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(4, 16);call write~init~int(83, 16, 0, 1);call write~init~int(77, 16, 1, 1);call write~init~int(73, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(78, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(73, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(83, 18, 0, 1);call write~init~int(67, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(40, 19);call #Ultimate.allocInit(58, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(14, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(22, 26);~current_execution_context~0 := 0;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0, 0;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0, 0;~jiffies~0 := 0;~_ddv_module_author~0 := ~const~array~~LB~int~RB~int();~_ddv_module_description~0 := ~const~array~~LB~int~RB~int();~_ddv_module_license~0 := ~_ddv_module_license~0[0 := 71];~_ddv_module_license~0 := ~_ddv_module_license~0[1 := 80];~_ddv_module_license~0 := ~_ddv_module_license~0[2 := 76];~_ddv_module_license~0 := ~_ddv_module_license~0[3 := 0];~nowayout~0 := 0;~_ddv_module_param_nowayout~0 := ~const~array~~LB~int~RB~int();~#zf_info~0.base, ~#zf_info~0.offset := 27, 0;call #Ultimate.allocInit(40, 27);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~int(~bitwiseOr(32768, 256), ~#zf_info~0.base, ~#zf_info~0.offset, 4);call write~unchecked~int(1, ~#zf_info~0.base, 4 + ~#zf_info~0.offset, 4);call write~init~int(0, ~#zf_info~0.base, 8 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 9 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 10 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 11 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 12 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 13 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 14 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 15 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 16 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 17 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 18 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 19 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 20 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 21 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 22 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 23 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 24 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 25 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 26 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 27 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 28 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 29 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 30 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 31 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 32 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 33 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 34 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 35 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 36 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 37 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 38 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 39 + ~#zf_info~0.offset, 1);~action~0 := 0;~_ddv_module_param_action~0 := ~const~array~~LB~int~RB~int();~zf_action~0 := 2048;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28, 0;call #Ultimate.allocInit(4, 28);call write~init~int(0, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4);~zf_expect_close~0 := 0;~#zf_lock~0.base, ~#zf_lock~0.offset := 29, 0;call #Ultimate.allocInit(8, 29);call write~init~int(0, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4);call write~init~int(0, ~#zf_lock~0.base, 4 + ~#zf_lock~0.offset, 4);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30, 0;call #Ultimate.allocInit(8, 30);call write~init~int(0, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4);call write~init~int(0, ~#zf_port_lock~0.base, 4 + ~#zf_port_lock~0.offset, 4);~#zf_timer~0.base, ~#zf_timer~0.offset := 31, 0;call #Ultimate.allocInit(16, 31);call write~init~int(0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 12 + ~#zf_timer~0.offset, 2);call write~init~int(0, ~#zf_timer~0.base, 14 + ~#zf_timer~0.offset, 2);~next_heartbeat~0 := 0;~#zf_fops~0.base, ~#zf_fops~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);#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$(0, 0, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, 4 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, 12 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, 24 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, 40 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, 48 + ~#zf_fops~0.offset, 4);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33, 0;call #Ultimate.allocInit(12, 33);call write~init~int(130, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(14, 0, ~#zf_miscdev~0.base, 4 + ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, 8 + ~#zf_miscdev~0.offset, 4);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34, 0;call #Ultimate.allocInit(12, 34);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_notifier~0.base, 4 + ~#zf_notifier~0.offset, 4);call write~init~int(0, ~#zf_notifier~0.base, 8 + ~#zf_notifier~0.offset, 4);~_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 := 35, 0;call #Ultimate.allocInit(16, 35);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, 4 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 8 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 12 + ~#fixed_cdev~0.offset, 4);~fixed_cdev_used~0 := 0;~number_cdev_registered~0 := 0;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36, 0;call #Ultimate.allocInit(64, 36);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0;~number_fixed_genhd_used~0 := 0;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37, 0;call #Ultimate.allocInit(1280, 37);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38, 0;call #Ultimate.allocInit(1460, 38);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39, 0;call #Ultimate.allocInit(236, 39);#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 := 40, 0;call #Ultimate.allocInit(128, 40);#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 := 0;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41, 0;call #Ultimate.allocInit(6, 41);call write~init~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4);call write~init~int(0, ~#tasklet_registered~0.base, 4 + ~#tasklet_registered~0.offset, 2);~number_timer_registered~0 := 0;~#timer_registered~0.base, ~#timer_registered~0.offset := 42, 0;call #Ultimate.allocInit(4, 42);call write~init~$Pointer$(0, 0, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);#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 := 44, 0;call #Ultimate.allocInit(8, 44);call write~init~int(0, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4);call write~init~int(0, ~#kernel_lock~0.base, 4 + ~#kernel_lock~0.offset, 4);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45, 0;call #Ultimate.allocInit(460, 45);#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 := 0;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0, 0;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46, 0;call #Ultimate.allocInit(200, 46);#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 := 0;~ddv_ioport_request_len~0 := 0; {4871#true} is VALID
[2022-02-20 16:50:52,729 INFO  L290        TraceCheckUtils]: 1: Hoare triple {4871#true} assume { :end_inline_ULTIMATE.init } true;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 := 1;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; {4871#true} is VALID
[2022-02-20 16:50:52,739 INFO  L272        TraceCheckUtils]: 2: Hoare triple {4871#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {4884#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2022-02-20 16:50:52,740 INFO  L290        TraceCheckUtils]: 3: Hoare triple {4884#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {4871#true} is VALID
[2022-02-20 16:50:52,740 INFO  L290        TraceCheckUtils]: 4: Hoare triple {4871#true} assume true; {4871#true} is VALID
[2022-02-20 16:50:52,741 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {4871#true} {4871#true} #846#return; {4871#true} is VALID
[2022-02-20 16:50:52,741 INFO  L290        TraceCheckUtils]: 6: Hoare triple {4871#true} init_kernel_~i~1#1 := 0; {4876#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:52,741 INFO  L290        TraceCheckUtils]: 7: Hoare triple {4876#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4876#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:52,742 INFO  L290        TraceCheckUtils]: 8: Hoare triple {4876#(= |ULTIMATE.start_init_kernel_~i~1#1| 0)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} is VALID
[2022-02-20 16:50:52,742 INFO  L290        TraceCheckUtils]: 9: Hoare triple {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} is VALID
[2022-02-20 16:50:52,743 INFO  L290        TraceCheckUtils]: 10: Hoare triple {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} is VALID
[2022-02-20 16:50:52,743 INFO  L290        TraceCheckUtils]: 11: Hoare triple {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} is VALID
[2022-02-20 16:50:52,744 INFO  L290        TraceCheckUtils]: 12: Hoare triple {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} is VALID
[2022-02-20 16:50:52,744 INFO  L290        TraceCheckUtils]: 13: Hoare triple {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} is VALID
[2022-02-20 16:50:52,745 INFO  L290        TraceCheckUtils]: 14: Hoare triple {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4880#(<= |ULTIMATE.start_init_kernel_~i~1#1| 4)} is VALID
[2022-02-20 16:50:52,745 INFO  L290        TraceCheckUtils]: 15: Hoare triple {4880#(<= |ULTIMATE.start_init_kernel_~i~1#1| 4)} assume !(init_kernel_~i~1#1 < 10); {4872#false} is VALID
[2022-02-20 16:50:52,746 INFO  L290        TraceCheckUtils]: 16: Hoare triple {4872#false} init_kernel_~i~1#1 := 0; {4872#false} is VALID
[2022-02-20 16:50:52,746 INFO  L290        TraceCheckUtils]: 17: Hoare triple {4872#false} assume !!(init_kernel_~i~1#1 < 1);call write~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1, 4);call write~int(0, ~#tasklet_registered~0.base, 4 + (~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1), 2); {4872#false} is VALID
[2022-02-20 16:50:52,746 INFO  L290        TraceCheckUtils]: 18: Hoare triple {4872#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post299#1;havoc init_kernel_#t~post299#1; {4872#false} is VALID
[2022-02-20 16:50:52,746 INFO  L290        TraceCheckUtils]: 19: Hoare triple {4872#false} assume !(init_kernel_~i~1#1 < 1); {4872#false} is VALID
[2022-02-20 16:50:52,746 INFO  L290        TraceCheckUtils]: 20: Hoare triple {4872#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~int } true;##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~int_#res#1;havoc ##fun~~TO~int_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {4872#false} is VALID
[2022-02-20 16:50:52,746 INFO  L272        TraceCheckUtils]: 21: Hoare triple {4872#false} call zf_init_#t~ret218#1 := printk(20, 0); {4871#true} is VALID
[2022-02-20 16:50:52,747 INFO  L290        TraceCheckUtils]: 22: Hoare triple {4871#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {4871#true} is VALID
[2022-02-20 16:50:52,747 INFO  L290        TraceCheckUtils]: 23: Hoare triple {4871#true} assume true; {4871#true} is VALID
[2022-02-20 16:50:52,747 INFO  L284        TraceCheckUtils]: 24: Hoare quadruple {4871#true} {4872#false} #848#return; {4872#false} is VALID
[2022-02-20 16:50:52,747 INFO  L290        TraceCheckUtils]: 25: Hoare triple {4872#false} assume -2147483648 <= zf_init_#t~ret218#1 && zf_init_#t~ret218#1 <= 2147483647;havoc zf_init_#t~ret218#1; {4872#false} is VALID
[2022-02-20 16:50:52,747 INFO  L272        TraceCheckUtils]: 26: Hoare triple {4872#false} call zf_init_#t~ret219#1 := zf_readw(2); {4872#false} is VALID
[2022-02-20 16:50:52,748 INFO  L290        TraceCheckUtils]: 27: Hoare triple {4872#false} ~port#1 := #in~port#1; {4872#false} is VALID
[2022-02-20 16:50:52,748 INFO  L272        TraceCheckUtils]: 28: Hoare triple {4872#false} call outb(~port#1, 536); {4872#false} is VALID
[2022-02-20 16:50:52,748 INFO  L290        TraceCheckUtils]: 29: Hoare triple {4872#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {4872#false} is VALID
[2022-02-20 16:50:52,748 INFO  L290        TraceCheckUtils]: 30: Hoare triple {4872#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~port#1 % 4294967296 >= ~ddv_ioport_request_start~0 % 4294967296 && ~port#1 % 4294967296 < (~ddv_ioport_request_start~0 + ~ddv_ioport_request_len~0) % 4294967296 then 1 else 0), 26, 0;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {4872#false} is VALID
[2022-02-20 16:50:52,748 INFO  L290        TraceCheckUtils]: 31: Hoare triple {4872#false} assume 0 == __VERIFIER_assert_~expression#1; {4872#false} is VALID
[2022-02-20 16:50:52,748 INFO  L290        TraceCheckUtils]: 32: Hoare triple {4872#false} assume !false; {4872#false} is VALID
[2022-02-20 16:50:52,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:50:52,749 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 16:50:52,749 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633001867]
[2022-02-20 16:50:52,750 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633001867] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-20 16:50:52,750 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94966011]
[2022-02-20 16:50:52,750 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-20 16:50:52,750 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-20 16:50:52,750 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 16:50:52,752 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-20 16:50:52,762 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-02-20 16:50:53,644 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-02-20 16:50:53,644 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-20 16:50:53,650 INFO  L263         TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-02-20 16:50:53,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:50:53,679 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-20 16:50:53,828 INFO  L290        TraceCheckUtils]: 0: Hoare triple {4871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(31, 5);call #Ultimate.allocInit(4, 6);call write~init~int(71, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(76, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(75, 7);call #Ultimate.allocInit(18, 8);call #Ultimate.allocInit(73, 9);call #Ultimate.allocInit(44, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(69, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(6, 15);call write~init~int(82, 15, 0, 1);call write~init~int(69, 15, 1, 1);call write~init~int(83, 15, 2, 1);call write~init~int(69, 15, 3, 1);call write~init~int(84, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(4, 16);call write~init~int(83, 16, 0, 1);call write~init~int(77, 16, 1, 1);call write~init~int(73, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(78, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(73, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(83, 18, 0, 1);call write~init~int(67, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(40, 19);call #Ultimate.allocInit(58, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(14, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(22, 26);~current_execution_context~0 := 0;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0, 0;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0, 0;~jiffies~0 := 0;~_ddv_module_author~0 := ~const~array~~LB~int~RB~int();~_ddv_module_description~0 := ~const~array~~LB~int~RB~int();~_ddv_module_license~0 := ~_ddv_module_license~0[0 := 71];~_ddv_module_license~0 := ~_ddv_module_license~0[1 := 80];~_ddv_module_license~0 := ~_ddv_module_license~0[2 := 76];~_ddv_module_license~0 := ~_ddv_module_license~0[3 := 0];~nowayout~0 := 0;~_ddv_module_param_nowayout~0 := ~const~array~~LB~int~RB~int();~#zf_info~0.base, ~#zf_info~0.offset := 27, 0;call #Ultimate.allocInit(40, 27);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~int(~bitwiseOr(32768, 256), ~#zf_info~0.base, ~#zf_info~0.offset, 4);call write~unchecked~int(1, ~#zf_info~0.base, 4 + ~#zf_info~0.offset, 4);call write~init~int(0, ~#zf_info~0.base, 8 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 9 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 10 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 11 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 12 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 13 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 14 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 15 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 16 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 17 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 18 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 19 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 20 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 21 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 22 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 23 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 24 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 25 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 26 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 27 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 28 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 29 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 30 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 31 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 32 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 33 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 34 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 35 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 36 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 37 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 38 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 39 + ~#zf_info~0.offset, 1);~action~0 := 0;~_ddv_module_param_action~0 := ~const~array~~LB~int~RB~int();~zf_action~0 := 2048;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28, 0;call #Ultimate.allocInit(4, 28);call write~init~int(0, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4);~zf_expect_close~0 := 0;~#zf_lock~0.base, ~#zf_lock~0.offset := 29, 0;call #Ultimate.allocInit(8, 29);call write~init~int(0, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4);call write~init~int(0, ~#zf_lock~0.base, 4 + ~#zf_lock~0.offset, 4);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30, 0;call #Ultimate.allocInit(8, 30);call write~init~int(0, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4);call write~init~int(0, ~#zf_port_lock~0.base, 4 + ~#zf_port_lock~0.offset, 4);~#zf_timer~0.base, ~#zf_timer~0.offset := 31, 0;call #Ultimate.allocInit(16, 31);call write~init~int(0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 12 + ~#zf_timer~0.offset, 2);call write~init~int(0, ~#zf_timer~0.base, 14 + ~#zf_timer~0.offset, 2);~next_heartbeat~0 := 0;~#zf_fops~0.base, ~#zf_fops~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);#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$(0, 0, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, 4 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, 12 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, 24 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, 40 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, 48 + ~#zf_fops~0.offset, 4);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33, 0;call #Ultimate.allocInit(12, 33);call write~init~int(130, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(14, 0, ~#zf_miscdev~0.base, 4 + ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, 8 + ~#zf_miscdev~0.offset, 4);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34, 0;call #Ultimate.allocInit(12, 34);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_notifier~0.base, 4 + ~#zf_notifier~0.offset, 4);call write~init~int(0, ~#zf_notifier~0.base, 8 + ~#zf_notifier~0.offset, 4);~_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 := 35, 0;call #Ultimate.allocInit(16, 35);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, 4 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 8 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 12 + ~#fixed_cdev~0.offset, 4);~fixed_cdev_used~0 := 0;~number_cdev_registered~0 := 0;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36, 0;call #Ultimate.allocInit(64, 36);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0;~number_fixed_genhd_used~0 := 0;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37, 0;call #Ultimate.allocInit(1280, 37);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38, 0;call #Ultimate.allocInit(1460, 38);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39, 0;call #Ultimate.allocInit(236, 39);#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 := 40, 0;call #Ultimate.allocInit(128, 40);#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 := 0;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41, 0;call #Ultimate.allocInit(6, 41);call write~init~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4);call write~init~int(0, ~#tasklet_registered~0.base, 4 + ~#tasklet_registered~0.offset, 2);~number_timer_registered~0 := 0;~#timer_registered~0.base, ~#timer_registered~0.offset := 42, 0;call #Ultimate.allocInit(4, 42);call write~init~$Pointer$(0, 0, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);#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 := 44, 0;call #Ultimate.allocInit(8, 44);call write~init~int(0, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4);call write~init~int(0, ~#kernel_lock~0.base, 4 + ~#kernel_lock~0.offset, 4);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45, 0;call #Ultimate.allocInit(460, 45);#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 := 0;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0, 0;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46, 0;call #Ultimate.allocInit(200, 46);#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 := 0;~ddv_ioport_request_len~0 := 0; {4871#true} is VALID
[2022-02-20 16:50:53,828 INFO  L290        TraceCheckUtils]: 1: Hoare triple {4871#true} assume { :end_inline_ULTIMATE.init } true;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 := 1;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; {4871#true} is VALID
[2022-02-20 16:50:53,828 INFO  L272        TraceCheckUtils]: 2: Hoare triple {4871#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {4871#true} is VALID
[2022-02-20 16:50:53,828 INFO  L290        TraceCheckUtils]: 3: Hoare triple {4871#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {4871#true} is VALID
[2022-02-20 16:50:53,829 INFO  L290        TraceCheckUtils]: 4: Hoare triple {4871#true} assume true; {4871#true} is VALID
[2022-02-20 16:50:53,829 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {4871#true} {4871#true} #846#return; {4871#true} is VALID
[2022-02-20 16:50:53,831 INFO  L290        TraceCheckUtils]: 6: Hoare triple {4871#true} init_kernel_~i~1#1 := 0; {4906#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:53,832 INFO  L290        TraceCheckUtils]: 7: Hoare triple {4906#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4906#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} is VALID
[2022-02-20 16:50:53,833 INFO  L290        TraceCheckUtils]: 8: Hoare triple {4906#(<= |ULTIMATE.start_init_kernel_~i~1#1| 0)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} is VALID
[2022-02-20 16:50:53,833 INFO  L290        TraceCheckUtils]: 9: Hoare triple {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} is VALID
[2022-02-20 16:50:53,833 INFO  L290        TraceCheckUtils]: 10: Hoare triple {4877#(<= |ULTIMATE.start_init_kernel_~i~1#1| 1)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} is VALID
[2022-02-20 16:50:53,834 INFO  L290        TraceCheckUtils]: 11: Hoare triple {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} is VALID
[2022-02-20 16:50:53,834 INFO  L290        TraceCheckUtils]: 12: Hoare triple {4878#(<= |ULTIMATE.start_init_kernel_~i~1#1| 2)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} is VALID
[2022-02-20 16:50:53,835 INFO  L290        TraceCheckUtils]: 13: Hoare triple {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} is VALID
[2022-02-20 16:50:53,835 INFO  L290        TraceCheckUtils]: 14: Hoare triple {4879#(<= |ULTIMATE.start_init_kernel_~i~1#1| 3)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {4880#(<= |ULTIMATE.start_init_kernel_~i~1#1| 4)} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 15: Hoare triple {4880#(<= |ULTIMATE.start_init_kernel_~i~1#1| 4)} assume !(init_kernel_~i~1#1 < 10); {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 16: Hoare triple {4872#false} init_kernel_~i~1#1 := 0; {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 17: Hoare triple {4872#false} assume !!(init_kernel_~i~1#1 < 1);call write~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1, 4);call write~int(0, ~#tasklet_registered~0.base, 4 + (~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1), 2); {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 18: Hoare triple {4872#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post299#1;havoc init_kernel_#t~post299#1; {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 19: Hoare triple {4872#false} assume !(init_kernel_~i~1#1 < 1); {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 20: Hoare triple {4872#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~int } true;##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~int_#res#1;havoc ##fun~~TO~int_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L272        TraceCheckUtils]: 21: Hoare triple {4872#false} call zf_init_#t~ret218#1 := printk(20, 0); {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 22: Hoare triple {4872#false} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 23: Hoare triple {4872#false} assume true; {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L284        TraceCheckUtils]: 24: Hoare quadruple {4872#false} {4872#false} #848#return; {4872#false} is VALID
[2022-02-20 16:50:53,836 INFO  L290        TraceCheckUtils]: 25: Hoare triple {4872#false} assume -2147483648 <= zf_init_#t~ret218#1 && zf_init_#t~ret218#1 <= 2147483647;havoc zf_init_#t~ret218#1; {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L272        TraceCheckUtils]: 26: Hoare triple {4872#false} call zf_init_#t~ret219#1 := zf_readw(2); {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L290        TraceCheckUtils]: 27: Hoare triple {4872#false} ~port#1 := #in~port#1; {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L272        TraceCheckUtils]: 28: Hoare triple {4872#false} call outb(~port#1, 536); {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L290        TraceCheckUtils]: 29: Hoare triple {4872#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L290        TraceCheckUtils]: 30: Hoare triple {4872#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~port#1 % 4294967296 >= ~ddv_ioport_request_start~0 % 4294967296 && ~port#1 % 4294967296 < (~ddv_ioport_request_start~0 + ~ddv_ioport_request_len~0) % 4294967296 then 1 else 0), 26, 0;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L290        TraceCheckUtils]: 31: Hoare triple {4872#false} assume 0 == __VERIFIER_assert_~expression#1; {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L290        TraceCheckUtils]: 32: Hoare triple {4872#false} assume !false; {4872#false} is VALID
[2022-02-20 16:50:53,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:50:53,837 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-20 16:50:54,020 INFO  L290        TraceCheckUtils]: 32: Hoare triple {4872#false} assume !false; {4872#false} is VALID
[2022-02-20 16:50:54,020 INFO  L290        TraceCheckUtils]: 31: Hoare triple {4872#false} assume 0 == __VERIFIER_assert_~expression#1; {4872#false} is VALID
[2022-02-20 16:50:54,021 INFO  L290        TraceCheckUtils]: 30: Hoare triple {4872#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~port#1 % 4294967296 >= ~ddv_ioport_request_start~0 % 4294967296 && ~port#1 % 4294967296 < (~ddv_ioport_request_start~0 + ~ddv_ioport_request_len~0) % 4294967296 then 1 else 0), 26, 0;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {4872#false} is VALID
[2022-02-20 16:50:54,021 INFO  L290        TraceCheckUtils]: 29: Hoare triple {4872#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {4872#false} is VALID
[2022-02-20 16:50:54,021 INFO  L272        TraceCheckUtils]: 28: Hoare triple {4872#false} call outb(~port#1, 536); {4872#false} is VALID
[2022-02-20 16:50:54,021 INFO  L290        TraceCheckUtils]: 27: Hoare triple {4872#false} ~port#1 := #in~port#1; {4872#false} is VALID
[2022-02-20 16:50:54,021 INFO  L272        TraceCheckUtils]: 26: Hoare triple {4872#false} call zf_init_#t~ret219#1 := zf_readw(2); {4872#false} is VALID
[2022-02-20 16:50:54,022 INFO  L290        TraceCheckUtils]: 25: Hoare triple {4872#false} assume -2147483648 <= zf_init_#t~ret218#1 && zf_init_#t~ret218#1 <= 2147483647;havoc zf_init_#t~ret218#1; {4872#false} is VALID
[2022-02-20 16:50:54,022 INFO  L284        TraceCheckUtils]: 24: Hoare quadruple {4871#true} {4872#false} #848#return; {4872#false} is VALID
[2022-02-20 16:50:54,022 INFO  L290        TraceCheckUtils]: 23: Hoare triple {4871#true} assume true; {4871#true} is VALID
[2022-02-20 16:50:54,022 INFO  L290        TraceCheckUtils]: 22: Hoare triple {4871#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0; {4871#true} is VALID
[2022-02-20 16:50:54,022 INFO  L272        TraceCheckUtils]: 21: Hoare triple {4872#false} call zf_init_#t~ret218#1 := printk(20, 0); {4871#true} is VALID
[2022-02-20 16:50:54,022 INFO  L290        TraceCheckUtils]: 20: Hoare triple {4872#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~int } true;##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~int_#res#1;havoc ##fun~~TO~int_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {4872#false} is VALID
[2022-02-20 16:50:54,023 INFO  L290        TraceCheckUtils]: 19: Hoare triple {4872#false} assume !(init_kernel_~i~1#1 < 1); {4872#false} is VALID
[2022-02-20 16:50:54,023 INFO  L290        TraceCheckUtils]: 18: Hoare triple {4872#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post299#1;havoc init_kernel_#t~post299#1; {4872#false} is VALID
[2022-02-20 16:50:54,023 INFO  L290        TraceCheckUtils]: 17: Hoare triple {4872#false} assume !!(init_kernel_~i~1#1 < 1);call write~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1, 4);call write~int(0, ~#tasklet_registered~0.base, 4 + (~#tasklet_registered~0.offset + 6 * init_kernel_~i~1#1), 2); {4872#false} is VALID
[2022-02-20 16:50:54,023 INFO  L290        TraceCheckUtils]: 16: Hoare triple {4872#false} init_kernel_~i~1#1 := 0; {4872#false} is VALID
[2022-02-20 16:50:54,024 INFO  L290        TraceCheckUtils]: 15: Hoare triple {5036#(< |ULTIMATE.start_init_kernel_~i~1#1| 10)} assume !(init_kernel_~i~1#1 < 10); {4872#false} is VALID
[2022-02-20 16:50:54,024 INFO  L290        TraceCheckUtils]: 14: Hoare triple {5040#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {5036#(< |ULTIMATE.start_init_kernel_~i~1#1| 10)} is VALID
[2022-02-20 16:50:54,025 INFO  L290        TraceCheckUtils]: 13: Hoare triple {5040#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {5040#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} is VALID
[2022-02-20 16:50:54,025 INFO  L290        TraceCheckUtils]: 12: Hoare triple {5047#(< |ULTIMATE.start_init_kernel_~i~1#1| 8)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {5040#(< |ULTIMATE.start_init_kernel_~i~1#1| 9)} is VALID
[2022-02-20 16:50:54,026 INFO  L290        TraceCheckUtils]: 11: Hoare triple {5047#(< |ULTIMATE.start_init_kernel_~i~1#1| 8)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {5047#(< |ULTIMATE.start_init_kernel_~i~1#1| 8)} is VALID
[2022-02-20 16:50:54,026 INFO  L290        TraceCheckUtils]: 10: Hoare triple {5054#(< |ULTIMATE.start_init_kernel_~i~1#1| 7)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {5047#(< |ULTIMATE.start_init_kernel_~i~1#1| 8)} is VALID
[2022-02-20 16:50:54,027 INFO  L290        TraceCheckUtils]: 9: Hoare triple {5054#(< |ULTIMATE.start_init_kernel_~i~1#1| 7)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {5054#(< |ULTIMATE.start_init_kernel_~i~1#1| 7)} is VALID
[2022-02-20 16:50:54,027 INFO  L290        TraceCheckUtils]: 8: Hoare triple {5061#(< |ULTIMATE.start_init_kernel_~i~1#1| 6)} init_kernel_#t~post298#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := 1 + init_kernel_#t~post298#1;havoc init_kernel_#t~post298#1; {5054#(< |ULTIMATE.start_init_kernel_~i~1#1| 7)} is VALID
[2022-02-20 16:50:54,028 INFO  L290        TraceCheckUtils]: 7: Hoare triple {5061#(< |ULTIMATE.start_init_kernel_~i~1#1| 6)} assume !!(init_kernel_~i~1#1 < 10);call write~$Pointer$(0, 0, ~#shared_workqueue~0.base, ~#shared_workqueue~0.offset + 4 * init_kernel_~i~1#1, 4); {5061#(< |ULTIMATE.start_init_kernel_~i~1#1| 6)} is VALID
[2022-02-20 16:50:54,028 INFO  L290        TraceCheckUtils]: 6: Hoare triple {4871#true} init_kernel_~i~1#1 := 0; {5061#(< |ULTIMATE.start_init_kernel_~i~1#1| 6)} is VALID
[2022-02-20 16:50:54,028 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {4871#true} {4871#true} #846#return; {4871#true} is VALID
[2022-02-20 16:50:54,029 INFO  L290        TraceCheckUtils]: 4: Hoare triple {4871#true} assume true; {4871#true} is VALID
[2022-02-20 16:50:54,029 INFO  L290        TraceCheckUtils]: 3: Hoare triple {4871#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~int(1, ~lock.base, ~lock.offset, 4);call write~int(0, ~lock.base, 4 + ~lock.offset, 4); {4871#true} is VALID
[2022-02-20 16:50:54,029 INFO  L272        TraceCheckUtils]: 2: Hoare triple {4871#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {4871#true} is VALID
[2022-02-20 16:50:54,029 INFO  L290        TraceCheckUtils]: 1: Hoare triple {4871#true} assume { :end_inline_ULTIMATE.init } true;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 := 1;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; {4871#true} is VALID
[2022-02-20 16:50:54,029 INFO  L290        TraceCheckUtils]: 0: Hoare triple {4871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(31, 5);call #Ultimate.allocInit(4, 6);call write~init~int(71, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(76, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(75, 7);call #Ultimate.allocInit(18, 8);call #Ultimate.allocInit(73, 9);call #Ultimate.allocInit(44, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(69, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(6, 15);call write~init~int(82, 15, 0, 1);call write~init~int(69, 15, 1, 1);call write~init~int(83, 15, 2, 1);call write~init~int(69, 15, 3, 1);call write~init~int(84, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(4, 16);call write~init~int(83, 16, 0, 1);call write~init~int(77, 16, 1, 1);call write~init~int(73, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(78, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(73, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(83, 18, 0, 1);call write~init~int(67, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(40, 19);call #Ultimate.allocInit(58, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(14, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(22, 26);~current_execution_context~0 := 0;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0, 0;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0, 0;~jiffies~0 := 0;~_ddv_module_author~0 := ~const~array~~LB~int~RB~int();~_ddv_module_description~0 := ~const~array~~LB~int~RB~int();~_ddv_module_license~0 := ~_ddv_module_license~0[0 := 71];~_ddv_module_license~0 := ~_ddv_module_license~0[1 := 80];~_ddv_module_license~0 := ~_ddv_module_license~0[2 := 76];~_ddv_module_license~0 := ~_ddv_module_license~0[3 := 0];~nowayout~0 := 0;~_ddv_module_param_nowayout~0 := ~const~array~~LB~int~RB~int();~#zf_info~0.base, ~#zf_info~0.offset := 27, 0;call #Ultimate.allocInit(40, 27);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~int(~bitwiseOr(32768, 256), ~#zf_info~0.base, ~#zf_info~0.offset, 4);call write~unchecked~int(1, ~#zf_info~0.base, 4 + ~#zf_info~0.offset, 4);call write~init~int(0, ~#zf_info~0.base, 8 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 9 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 10 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 11 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 12 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 13 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 14 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 15 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 16 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 17 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 18 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 19 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 20 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 21 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 22 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 23 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 24 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 25 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 26 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 27 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 28 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 29 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 30 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 31 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 32 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 33 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 34 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 35 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 36 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 37 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 38 + ~#zf_info~0.offset, 1);call write~init~int(0, ~#zf_info~0.base, 39 + ~#zf_info~0.offset, 1);~action~0 := 0;~_ddv_module_param_action~0 := ~const~array~~LB~int~RB~int();~zf_action~0 := 2048;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28, 0;call #Ultimate.allocInit(4, 28);call write~init~int(0, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4);~zf_expect_close~0 := 0;~#zf_lock~0.base, ~#zf_lock~0.offset := 29, 0;call #Ultimate.allocInit(8, 29);call write~init~int(0, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4);call write~init~int(0, ~#zf_lock~0.base, 4 + ~#zf_lock~0.offset, 4);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30, 0;call #Ultimate.allocInit(8, 30);call write~init~int(0, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4);call write~init~int(0, ~#zf_port_lock~0.base, 4 + ~#zf_port_lock~0.offset, 4);~#zf_timer~0.base, ~#zf_timer~0.offset := 31, 0;call #Ultimate.allocInit(16, 31);call write~init~int(0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);call write~init~int(0, ~#zf_timer~0.base, 12 + ~#zf_timer~0.offset, 2);call write~init~int(0, ~#zf_timer~0.base, 14 + ~#zf_timer~0.offset, 2);~next_heartbeat~0 := 0;~#zf_fops~0.base, ~#zf_fops~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);#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$(0, 0, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, 4 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, 12 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, 24 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, 40 + ~#zf_fops~0.offset, 4);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, 48 + ~#zf_fops~0.offset, 4);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33, 0;call #Ultimate.allocInit(12, 33);call write~init~int(130, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(14, 0, ~#zf_miscdev~0.base, 4 + ~#zf_miscdev~0.offset, 4);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, 8 + ~#zf_miscdev~0.offset, 4);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34, 0;call #Ultimate.allocInit(12, 34);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4);call write~init~$Pointer$(0, 0, ~#zf_notifier~0.base, 4 + ~#zf_notifier~0.offset, 4);call write~init~int(0, ~#zf_notifier~0.base, 8 + ~#zf_notifier~0.offset, 4);~_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 := 35, 0;call #Ultimate.allocInit(16, 35);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fixed_cdev~0.base, 4 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 8 + ~#fixed_cdev~0.offset, 4);call write~init~int(0, ~#fixed_cdev~0.base, 12 + ~#fixed_cdev~0.offset, 4);~fixed_cdev_used~0 := 0;~number_cdev_registered~0 := 0;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36, 0;call #Ultimate.allocInit(64, 36);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0;~number_fixed_genhd_used~0 := 0;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37, 0;call #Ultimate.allocInit(1280, 37);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38, 0;call #Ultimate.allocInit(1460, 38);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39, 0;call #Ultimate.allocInit(236, 39);#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 := 40, 0;call #Ultimate.allocInit(128, 40);#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 := 0;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41, 0;call #Ultimate.allocInit(6, 41);call write~init~$Pointer$(0, 0, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4);call write~init~int(0, ~#tasklet_registered~0.base, 4 + ~#tasklet_registered~0.offset, 2);~number_timer_registered~0 := 0;~#timer_registered~0.base, ~#timer_registered~0.offset := 42, 0;call #Ultimate.allocInit(4, 42);call write~init~$Pointer$(0, 0, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);#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 := 44, 0;call #Ultimate.allocInit(8, 44);call write~init~int(0, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4);call write~init~int(0, ~#kernel_lock~0.base, 4 + ~#kernel_lock~0.offset, 4);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45, 0;call #Ultimate.allocInit(460, 45);#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 := 0;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0, 0;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46, 0;call #Ultimate.allocInit(200, 46);#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 := 0;~ddv_ioport_request_len~0 := 0; {4871#true} is VALID
[2022-02-20 16:50:54,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:50:54,030 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [94966011] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-20 16:50:54,030 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-20 16:50:54,030 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14
[2022-02-20 16:50:54,031 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354981299]
[2022-02-20 16:50:54,031 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-20 16:50:54,031 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33
[2022-02-20 16:50:54,032 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-02-20 16:50:54,032 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:54,076 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:50:54,076 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-02-20 16:50:54,076 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 16:50:54,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-02-20 16:50:54,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182
[2022-02-20 16:50:54,077 INFO  L87              Difference]: Start difference. First operand 351 states and 481 transitions. Second operand  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:58,042 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:58,043 INFO  L93              Difference]: Finished difference Result 710 states and 976 transitions.
[2022-02-20 16:50:58,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-20 16:50:58,043 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33
[2022-02-20 16:50:58,043 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 16:50:58,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:58,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 975 transitions.
[2022-02-20 16:50:58,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:58,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 975 transitions.
[2022-02-20 16:50:58,084 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 975 transitions.
[2022-02-20 16:50:58,881 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 975 edges. 975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:50:58,894 INFO  L225             Difference]: With dead ends: 710
[2022-02-20 16:50:58,895 INFO  L226             Difference]: Without dead ends: 372
[2022-02-20 16:50:58,896 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182
[2022-02-20 16:50:58,902 INFO  L933         BasicCegarLoop]: 448 mSDtfsCounter, 266 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-20 16:50:58,903 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 1542 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-20 16:50:58,904 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2022-02-20 16:50:58,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 363.
[2022-02-20 16:50:58,955 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 16:50:58,957 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 372 states. Second operand  has 363 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 266 states have internal predecessors, (342), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:58,957 INFO  L74              IsIncluded]: Start isIncluded. First operand 372 states. Second operand  has 363 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 266 states have internal predecessors, (342), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:58,960 INFO  L87              Difference]: Start difference. First operand 372 states. Second operand  has 363 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 266 states have internal predecessors, (342), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:58,974 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:58,975 INFO  L93              Difference]: Finished difference Result 372 states and 504 transitions.
[2022-02-20 16:50:58,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 372 states and 504 transitions.
[2022-02-20 16:50:58,976 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:50:58,976 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:50:58,977 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 363 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 266 states have internal predecessors, (342), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 372 states.
[2022-02-20 16:50:58,978 INFO  L87              Difference]: Start difference. First operand  has 363 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 266 states have internal predecessors, (342), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 372 states.
[2022-02-20 16:50:58,994 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:50:58,994 INFO  L93              Difference]: Finished difference Result 372 states and 504 transitions.
[2022-02-20 16:50:58,994 INFO  L276                IsEmpty]: Start isEmpty. Operand 372 states and 504 transitions.
[2022-02-20 16:50:58,995 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:50:58,996 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:50:58,996 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-20 16:50:58,996 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 16:50:58,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 363 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 266 states have internal predecessors, (342), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:50:59,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 493 transitions.
[2022-02-20 16:50:59,014 INFO  L78                 Accepts]: Start accepts. Automaton has 363 states and 493 transitions. Word has length 33
[2022-02-20 16:50:59,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-20 16:50:59,014 INFO  L470      AbstractCegarLoop]: Abstraction has 363 states and 493 transitions.
[2022-02-20 16:50:59,014 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:50:59,015 INFO  L276                IsEmpty]: Start isEmpty. Operand 363 states and 493 transitions.
[2022-02-20 16:50:59,017 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2022-02-20 16:50:59,017 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-20 16:50:59,018 INFO  L514         BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 16:50:59,052 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-02-20 16:50:59,239 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-02-20 16:50:59,240 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting outbErr0ASSERT_VIOLATIONERROR_FUNCTION === [outbErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 16:50:59,240 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 16:50:59,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 551495505, now seen corresponding path program 3 times
[2022-02-20 16:50:59,240 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 16:50:59,240 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210474069]
[2022-02-20 16:50:59,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:50:59,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 16:50:59,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-20 16:50:59,656 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-20 16:50:59,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-20 16:50:59,796 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-20 16:50:59,797 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2022-02-20 16:50:59,798 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location outbErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-02-20 16:50:59,799 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-20 16:50:59,802 INFO  L732         BasicCegarLoop]: Path program histogram: [3, 1]
[2022-02-20 16:50:59,804 INFO  L180   ceAbstractionStarter]: Computing trace abstraction results
[2022-02-20 16:50:59,880 FATAL L489      DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call spin_lock_init(~#kernel_lock~0);
[2022-02-20 16:50:59,881 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206)
	at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132)
	at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:156)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
	at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2022-02-20 16:50:59,891 INFO  L158              Benchmark]: Toolchain (without parser) took 22580.41ms. Allocated memory was 83.9MB in the beginning and 255.9MB in the end (delta: 172.0MB). Free memory was 48.4MB in the beginning and 65.5MB in the end (delta: -17.1MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB.
[2022-02-20 16:50:59,891 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-02-20 16:50:59,893 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 1390.80ms. Allocated memory was 83.9MB in the beginning and 115.3MB in the end (delta: 31.5MB). Free memory was 48.2MB in the beginning and 69.3MB in the end (delta: -21.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB.
[2022-02-20 16:50:59,894 INFO  L158              Benchmark]: Boogie Procedure Inliner took 150.52ms. Allocated memory is still 115.3MB. Free memory was 69.3MB in the beginning and 57.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2022-02-20 16:50:59,894 INFO  L158              Benchmark]: Boogie Preprocessor took 133.44ms. Allocated memory is still 115.3MB. Free memory was 57.4MB in the beginning and 47.5MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-02-20 16:50:59,894 INFO  L158              Benchmark]: RCFGBuilder took 2716.13ms. Allocated memory was 115.3MB in the beginning and 176.2MB in the end (delta: 60.8MB). Free memory was 47.5MB in the beginning and 95.0MB in the end (delta: -47.5MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB.
[2022-02-20 16:50:59,895 INFO  L158              Benchmark]: TraceAbstraction took 18181.11ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 95.0MB in the beginning and 65.5MB in the end (delta: 29.5MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB.
[2022-02-20 16:50:59,896 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.18ms. Allocated memory is still 83.9MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 1390.80ms. Allocated memory was 83.9MB in the beginning and 115.3MB in the end (delta: 31.5MB). Free memory was 48.2MB in the beginning and 69.3MB in the end (delta: -21.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 150.52ms. Allocated memory is still 115.3MB. Free memory was 69.3MB in the beginning and 57.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 133.44ms. Allocated memory is still 115.3MB. Free memory was 57.4MB in the beginning and 47.5MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * RCFGBuilder took 2716.13ms. Allocated memory was 115.3MB in the beginning and 176.2MB in the end (delta: 60.8MB). Free memory was 47.5MB in the beginning and 95.0MB in the end (delta: -47.5MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 18181.11ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 95.0MB in the beginning and 65.5MB in the end (delta: 29.5MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator
    de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2022-02-20 16:50:59,933 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
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/AutomizerReach.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outb.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9ba053a0d2bb5cff65ef20f502acdb8ce89a9e82653cf0711701cf2b8f86a02
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-03d7b7b
[2022-02-20 16:51:01,927 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-02-20 16:51:01,930 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-20 16:51:01,964 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-20 16:51:01,964 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-20 16:51:01,968 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-20 16:51:01,969 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-20 16:51:01,974 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-20 16:51:01,977 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-20 16:51:01,981 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-20 16:51:01,982 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-02-20 16:51:01,983 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-20 16:51:01,983 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-20 16:51:01,986 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-20 16:51:01,987 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-20 16:51:01,992 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-20 16:51:01,993 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-20 16:51:01,994 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-20 16:51:01,996 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-20 16:51:02,001 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-20 16:51:02,002 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-20 16:51:02,004 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-20 16:51:02,005 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-02-20 16:51:02,006 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-20 16:51:02,012 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-20 16:51:02,013 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-20 16:51:02,013 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-20 16:51:02,015 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-20 16:51:02,015 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-20 16:51:02,016 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-20 16:51:02,016 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-20 16:51:02,017 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-20 16:51:02,018 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-20 16:51:02,018 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-20 16:51:02,019 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-20 16:51:02,019 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-20 16:51:02,020 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-20 16:51:02,020 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-20 16:51:02,020 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-20 16:51:02,021 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-20 16:51:02,022 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-02-20 16:51:02,023 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2022-02-20 16:51:02,067 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-02-20 16:51:02,068 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-20 16:51:02,069 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-20 16:51:02,069 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-20 16:51:02,070 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-20 16:51:02,070 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-20 16:51:02,071 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-20 16:51:02,071 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-02-20 16:51:02,071 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-02-20 16:51:02,072 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-20 16:51:02,073 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-02-20 16:51:02,073 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-02-20 16:51:02,073 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-02-20 16:51:02,073 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-02-20 16:51:02,073 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-20 16:51:02,073 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-02-20 16:51:02,074 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2022-02-20 16:51:02,074 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2022-02-20 16:51:02,074 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2022-02-20 16:51:02,074 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-02-20 16:51:02,074 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-02-20 16:51:02,074 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-02-20 16:51:02,075 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-02-20 16:51:02,075 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-20 16:51:02,075 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-02-20 16:51:02,075 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-02-20 16:51:02,075 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 16:51:02,081 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-20 16:51:02,082 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-02-20 16:51:02,082 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-20 16:51:02,082 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2022-02-20 16:51:02,082 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2022-02-20 16:51:02,082 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-02-20 16:51:02,082 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2022-02-20 16:51:02,083 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-20 16:51:02,083 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2022-02-20 16:51:02,083 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 ! call(reach_error())) )


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 -> b9ba053a0d2bb5cff65ef20f502acdb8ce89a9e82653cf0711701cf2b8f86a02
[2022-02-20 16:51:02,407 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-20 16:51:02,433 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-20 16:51:02,436 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-20 16:51:02,437 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-02-20 16:51:02,437 INFO  L275        PluginConnector]: CDTParser initialized
[2022-02-20 16:51:02,439 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outb.i
[2022-02-20 16:51:02,507 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0be17b43/dbca22b684b74934b6861f5d2a0fb2c6/FLAG0627aef7a
[2022-02-20 16:51:03,206 INFO  L306              CDTParser]: Found 1 translation units.
[2022-02-20 16:51:03,206 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outb.i
[2022-02-20 16:51:03,232 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0be17b43/dbca22b684b74934b6861f5d2a0fb2c6/FLAG0627aef7a
[2022-02-20 16:51:03,474 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0be17b43/dbca22b684b74934b6861f5d2a0fb2c6
[2022-02-20 16:51:03,476 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-20 16:51:03,478 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2022-02-20 16:51:03,480 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-20 16:51:03,481 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-20 16:51:03,483 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-20 16:51:03,484 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:03" (1/1) ...
[2022-02-20 16:51:03,485 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e716f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:03, skipping insertion in model container
[2022-02-20 16:51:03,486 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:03" (1/1) ...
[2022-02-20 16:51:03,492 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-02-20 16:51:03,557 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-02-20 16:51:03,767 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_outb.i[453,466]
[2022-02-20 16:51:04,599 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-20 16:51:04,647 INFO  L200         MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2022-02-20 16:51:04,671 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-02-20 16:51:04,675 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_outb.i[453,466]
[2022-02-20 16:51:04,914 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-20 16:51:04,937 INFO  L203         MainTranslator]: Completed pre-run
[2022-02-20 16:51:04,946 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_outb.i[453,466]
[2022-02-20 16:51:05,093 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-20 16:51:05,289 INFO  L208         MainTranslator]: Completed translation
[2022-02-20 16:51:05,290 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05 WrapperNode
[2022-02-20 16:51:05,290 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-20 16:51:05,291 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-20 16:51:05,291 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-20 16:51:05,302 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-20 16:51:05,308 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,385 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,482 INFO  L137                Inliner]: procedures = 482, calls = 839, calls flagged for inlining = 54, calls inlined = 38, statements flattened = 981
[2022-02-20 16:51:05,483 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-20 16:51:05,483 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-20 16:51:05,484 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-20 16:51:05,484 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-02-20 16:51:05,491 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,492 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,502 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,502 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,537 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,544 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,571 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,592 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-20 16:51:05,593 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-20 16:51:05,593 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-02-20 16:51:05,593 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-02-20 16:51:05,594 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (1/1) ...
[2022-02-20 16:51:05,599 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 16:51:05,609 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 16:51:05,632 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 16:51:05,660 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 16:51:05,674 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_timer_off
[2022-02-20 16:51:05,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_timer_off
[2022-02-20 16:51:05,675 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT
[2022-02-20 16:51:05,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT
[2022-02-20 16:51:05,675 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-02-20 16:51:05,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin
[2022-02-20 16:51:05,675 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore
[2022-02-20 16:51:05,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore
[2022-02-20 16:51:05,675 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-20 16:51:05,675 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2
[2022-02-20 16:51:05,676 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2022-02-20 16:51:05,676 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4
[2022-02-20 16:51:05,676 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_unlock
[2022-02-20 16:51:05,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_unlock
[2022-02-20 16:51:05,676 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-02-20 16:51:05,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end
[2022-02-20 16:51:05,676 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_get_control
[2022-02-20 16:51:05,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_get_control
[2022-02-20 16:51:05,676 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT
[2022-02-20 16:51:05,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT
[2022-02-20 16:51:05,677 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-02-20 16:51:05,677 INFO  L130     BoogieDeclarations]: Found specification of procedure request_region
[2022-02-20 16:51:05,677 INFO  L138     BoogieDeclarations]: Found implementation of procedure request_region
[2022-02-20 16:51:05,677 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-20 16:51:05,677 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2022-02-20 16:51:05,677 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID
[2022-02-20 16:51:05,677 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID
[2022-02-20 16:51:05,677 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_lock_irqsave
[2022-02-20 16:51:05,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave
[2022-02-20 16:51:05,678 INFO  L130     BoogieDeclarations]: Found specification of procedure release_region
[2022-02-20 16:51:05,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure release_region
[2022-02-20 16:51:05,678 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-20 16:51:05,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-20 16:51:05,678 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_lock_init
[2022-02-20 16:51:05,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_lock_init
[2022-02-20 16:51:05,679 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE8
[2022-02-20 16:51:05,679 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2022-02-20 16:51:05,679 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE2
[2022-02-20 16:51:05,679 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$
[2022-02-20 16:51:05,679 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-02-20 16:51:05,679 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-02-20 16:51:05,679 INFO  L130     BoogieDeclarations]: Found specification of procedure del_timer
[2022-02-20 16:51:05,679 INFO  L138     BoogieDeclarations]: Found implementation of procedure del_timer
[2022-02-20 16:51:05,680 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-20 16:51:05,680 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2022-02-20 16:51:05,680 INFO  L130     BoogieDeclarations]: Found specification of procedure add_timer
[2022-02-20 16:51:05,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure add_timer
[2022-02-20 16:51:05,681 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE8
[2022-02-20 16:51:05,681 INFO  L130     BoogieDeclarations]: Found specification of procedure cdev_add
[2022-02-20 16:51:05,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure cdev_add
[2022-02-20 16:51:05,682 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1
[2022-02-20 16:51:05,682 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE2
[2022-02-20 16:51:05,682 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2022-02-20 16:51:05,683 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2022-02-20 16:51:05,683 INFO  L130     BoogieDeclarations]: Found specification of procedure printk
[2022-02-20 16:51:05,683 INFO  L138     BoogieDeclarations]: Found implementation of procedure printk
[2022-02-20 16:51:05,683 INFO  L130     BoogieDeclarations]: Found specification of procedure outw
[2022-02-20 16:51:05,683 INFO  L138     BoogieDeclarations]: Found implementation of procedure outw
[2022-02-20 16:51:05,683 INFO  L130     BoogieDeclarations]: Found specification of procedure outb
[2022-02-20 16:51:05,683 INFO  L138     BoogieDeclarations]: Found implementation of procedure outb
[2022-02-20 16:51:05,683 INFO  L130     BoogieDeclarations]: Found specification of procedure misc_deregister
[2022-02-20 16:51:05,684 INFO  L138     BoogieDeclarations]: Found implementation of procedure misc_deregister
[2022-02-20 16:51:05,684 INFO  L130     BoogieDeclarations]: Found specification of procedure assert_context_process
[2022-02-20 16:51:05,684 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert_context_process
[2022-02-20 16:51:05,684 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_set_control
[2022-02-20 16:51:05,684 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_set_control
[2022-02-20 16:51:05,684 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_ULONG~X~$Pointer$~TO~C_LONG
[2022-02-20 16:51:05,685 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_ULONG~X~$Pointer$~TO~C_LONG
[2022-02-20 16:51:05,685 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_readw
[2022-02-20 16:51:05,685 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_readw
[2022-02-20 16:51:05,685 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4
[2022-02-20 16:51:05,685 INFO  L130     BoogieDeclarations]: Found specification of procedure zf_ping
[2022-02-20 16:51:05,685 INFO  L138     BoogieDeclarations]: Found implementation of procedure zf_ping
[2022-02-20 16:51:05,685 INFO  L130     BoogieDeclarations]: Found specification of procedure spin_lock
[2022-02-20 16:51:05,685 INFO  L138     BoogieDeclarations]: Found implementation of procedure spin_lock
[2022-02-20 16:51:05,685 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~C_ULONG~TO~VOID
[2022-02-20 16:51:05,685 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~C_ULONG~TO~VOID
[2022-02-20 16:51:06,094 INFO  L234             CfgBuilder]: Building ICFG
[2022-02-20 16:51:06,095 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-20 16:51:11,129 INFO  L275             CfgBuilder]: Performing block encoding
[2022-02-20 16:51:11,139 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-20 16:51:11,139 INFO  L299             CfgBuilder]: Removed 4 assume(true) statements.
[2022-02-20 16:51:11,142 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:11 BoogieIcfgContainer
[2022-02-20 16:51:11,142 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-20 16:51:11,144 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-20 16:51:11,144 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-02-20 16:51:11,146 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-02-20 16:51:11,147 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:51:03" (1/3) ...
[2022-02-20 16:51:11,148 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16754f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:11, skipping insertion in model container
[2022-02-20 16:51:11,148 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:05" (2/3) ...
[2022-02-20 16:51:11,148 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16754f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:11, skipping insertion in model container
[2022-02-20 16:51:11,149 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:11" (3/3) ...
[2022-02-20 16:51:11,150 INFO  L111   eAbstractionObserver]: Analyzing ICFG ddv_machzwd_outb.i
[2022-02-20 16:51:11,154 INFO  L205   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-20 16:51:11,155 INFO  L164   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-02-20 16:51:11,205 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-20 16:51:11,211 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:51:11,211 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-20 16:51:11,244 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 353 states, 247 states have (on average 1.360323886639676) internal successors, (336), 253 states have internal predecessors, (336), 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 16:51:11,248 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-02-20 16:51:11,249 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-20 16:51:11,249 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 16:51:11,249 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting outbErr0ASSERT_VIOLATIONERROR_FUNCTION === [outbErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 16:51:11,254 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 16:51:11,254 INFO  L85        PathProgramCache]: Analyzing trace with hash -1780362613, now seen corresponding path program 1 times
[2022-02-20 16:51:11,267 INFO  L126   FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-02-20 16:51:11,268 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559339291]
[2022-02-20 16:51:11,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:51:11,269 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-02-20 16:51:11,269 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2022-02-20 16:51:11,271 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 16:51:11,272 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 16:51:11,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:51:11,755 INFO  L263         TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 1 conjunts are in the unsatisfiable core
[2022-02-20 16:51:11,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:51:11,781 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-20 16:51:11,879 INFO  L290        TraceCheckUtils]: 0: Hoare triple {356#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(19bv32, 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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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; {356#true} is VALID
[2022-02-20 16:51:11,879 INFO  L290        TraceCheckUtils]: 1: Hoare triple {356#true} assume { :end_inline_ULTIMATE.init } true;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; {356#true} is VALID
[2022-02-20 16:51:11,879 INFO  L272        TraceCheckUtils]: 2: Hoare triple {356#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {356#true} is VALID
[2022-02-20 16:51:11,880 INFO  L290        TraceCheckUtils]: 3: Hoare triple {356#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32);call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); {356#true} is VALID
[2022-02-20 16:51:11,880 INFO  L290        TraceCheckUtils]: 4: Hoare triple {356#true} assume true; {356#true} is VALID
[2022-02-20 16:51:11,880 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {356#true} {356#true} #854#return; {356#true} is VALID
[2022-02-20 16:51:11,880 INFO  L290        TraceCheckUtils]: 6: Hoare triple {356#true} init_kernel_~i~1#1 := 0bv32; {356#true} is VALID
[2022-02-20 16:51:11,881 INFO  L290        TraceCheckUtils]: 7: Hoare triple {356#true} assume !true; {357#false} is VALID
[2022-02-20 16:51:11,881 INFO  L290        TraceCheckUtils]: 8: Hoare triple {357#false} init_kernel_~i~1#1 := 0bv32; {357#false} is VALID
[2022-02-20 16:51:11,882 INFO  L290        TraceCheckUtils]: 9: Hoare triple {357#false} assume !true; {357#false} is VALID
[2022-02-20 16:51:11,882 INFO  L290        TraceCheckUtils]: 10: Hoare triple {357#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~C_INT } true;##fun~~TO~C_INT_#in~#fp#1.base, ##fun~~TO~C_INT_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~C_INT_#res#1;havoc ##fun~~TO~C_INT_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {357#false} is VALID
[2022-02-20 16:51:11,882 INFO  L272        TraceCheckUtils]: 11: Hoare triple {357#false} call zf_init_#t~ret218#1 := printk(20bv32, 0bv32); {357#false} is VALID
[2022-02-20 16:51:11,882 INFO  L290        TraceCheckUtils]: 12: Hoare triple {357#false} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0bv32; {357#false} is VALID
[2022-02-20 16:51:11,883 INFO  L290        TraceCheckUtils]: 13: Hoare triple {357#false} assume true; {357#false} is VALID
[2022-02-20 16:51:11,883 INFO  L284        TraceCheckUtils]: 14: Hoare quadruple {357#false} {357#false} #856#return; {357#false} is VALID
[2022-02-20 16:51:11,883 INFO  L290        TraceCheckUtils]: 15: Hoare triple {357#false} havoc zf_init_#t~ret218#1; {357#false} is VALID
[2022-02-20 16:51:11,883 INFO  L272        TraceCheckUtils]: 16: Hoare triple {357#false} call zf_init_#t~ret219#1 := zf_readw(2bv8); {357#false} is VALID
[2022-02-20 16:51:11,883 INFO  L290        TraceCheckUtils]: 17: Hoare triple {357#false} ~port#1 := #in~port#1; {357#false} is VALID
[2022-02-20 16:51:11,884 INFO  L272        TraceCheckUtils]: 18: Hoare triple {357#false} call outb(~port#1, 536bv32); {357#false} is VALID
[2022-02-20 16:51:11,884 INFO  L290        TraceCheckUtils]: 19: Hoare triple {357#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {357#false} is VALID
[2022-02-20 16:51:11,884 INFO  L290        TraceCheckUtils]: 20: Hoare triple {357#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~bvuge32(~port#1, ~ddv_ioport_request_start~0) && ~bvult32(~port#1, ~bvadd32(~ddv_ioport_request_start~0, ~ddv_ioport_request_len~0)) then 1bv32 else 0bv32), 26bv32, 0bv32;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {357#false} is VALID
[2022-02-20 16:51:11,884 INFO  L290        TraceCheckUtils]: 21: Hoare triple {357#false} assume 0bv32 == __VERIFIER_assert_~expression#1; {357#false} is VALID
[2022-02-20 16:51:11,885 INFO  L290        TraceCheckUtils]: 22: Hoare triple {357#false} assume !false; {357#false} is VALID
[2022-02-20 16:51:11,885 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 16:51:11,886 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-20 16:51:11,886 INFO  L144   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-02-20 16:51:11,887 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559339291]
[2022-02-20 16:51:11,887 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559339291] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 16:51:11,887 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 16:51:11,887 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-20 16:51:11,889 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87235136]
[2022-02-20 16:51:11,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 16:51:11,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23
[2022-02-20 16:51:11,895 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-02-20 16:51:11,898 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:11,952 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:51:11,952 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-20 16:51:11,952 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-02-20 16:51:11,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-20 16:51:11,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 16:51:11,990 INFO  L87              Difference]: Start difference. First operand  has 353 states, 247 states have (on average 1.360323886639676) internal successors, (336), 253 states have internal predecessors, (336), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:15,356 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:51:15,356 INFO  L93              Difference]: Finished difference Result 700 states and 1014 transitions.
[2022-02-20 16:51:15,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-02-20 16:51:15,357 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23
[2022-02-20 16:51:15,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 16:51:15,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:15,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1014 transitions.
[2022-02-20 16:51:15,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:15,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1014 transitions.
[2022-02-20 16:51:15,423 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 1014 transitions.
[2022-02-20 16:51:16,589 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 1014 edges. 1014 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:51:16,626 INFO  L225             Difference]: With dead ends: 700
[2022-02-20 16:51:16,627 INFO  L226             Difference]: Without dead ends: 343
[2022-02-20 16:51:16,632 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 16:51:16,635 INFO  L933         BasicCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 16:51:16,636 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 16:51:16,650 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 343 states.
[2022-02-20 16:51:16,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343.
[2022-02-20 16:51:16,682 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 16:51:16,685 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand  has 343 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 246 states have internal predecessors, (322), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:16,688 INFO  L74              IsIncluded]: Start isIncluded. First operand 343 states. Second operand  has 343 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 246 states have internal predecessors, (322), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:16,690 INFO  L87              Difference]: Start difference. First operand 343 states. Second operand  has 343 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 246 states have internal predecessors, (322), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:16,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:51:16,709 INFO  L93              Difference]: Finished difference Result 343 states and 473 transitions.
[2022-02-20 16:51:16,710 INFO  L276                IsEmpty]: Start isEmpty. Operand 343 states and 473 transitions.
[2022-02-20 16:51:16,715 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:51:16,715 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:51:16,717 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 343 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 246 states have internal predecessors, (322), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 343 states.
[2022-02-20 16:51:16,718 INFO  L87              Difference]: Start difference. First operand  has 343 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 246 states have internal predecessors, (322), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 343 states.
[2022-02-20 16:51:16,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:51:16,736 INFO  L93              Difference]: Finished difference Result 343 states and 473 transitions.
[2022-02-20 16:51:16,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 343 states and 473 transitions.
[2022-02-20 16:51:16,739 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:51:16,739 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:51:16,739 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-20 16:51:16,739 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 16:51:16,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 343 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 246 states have internal predecessors, (322), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:16,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 473 transitions.
[2022-02-20 16:51:16,761 INFO  L78                 Accepts]: Start accepts. Automaton has 343 states and 473 transitions. Word has length 23
[2022-02-20 16:51:16,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-20 16:51:16,762 INFO  L470      AbstractCegarLoop]: Abstraction has 343 states and 473 transitions.
[2022-02-20 16:51:16,762 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:16,763 INFO  L276                IsEmpty]: Start isEmpty. Operand 343 states and 473 transitions.
[2022-02-20 16:51:16,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-02-20 16:51:16,763 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-20 16:51:16,763 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 16:51:16,777 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 16:51:16,971 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 16:51:16,972 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting outbErr0ASSERT_VIOLATIONERROR_FUNCTION === [outbErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 16:51:16,972 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 16:51:16,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 21226903, now seen corresponding path program 1 times
[2022-02-20 16:51:16,973 INFO  L126   FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-02-20 16:51:16,973 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643206782]
[2022-02-20 16:51:16,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:51:16,974 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-02-20 16:51:16,974 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2022-02-20 16:51:16,975 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 16:51:16,977 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 16:51:17,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:51:17,339 INFO  L263         TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-02-20 16:51:17,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:51:17,363 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-20 16:51:17,444 INFO  L290        TraceCheckUtils]: 0: Hoare triple {2549#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(19bv32, 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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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; {2549#true} is VALID
[2022-02-20 16:51:17,445 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2549#true} assume { :end_inline_ULTIMATE.init } true;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; {2549#true} is VALID
[2022-02-20 16:51:17,445 INFO  L272        TraceCheckUtils]: 2: Hoare triple {2549#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {2549#true} is VALID
[2022-02-20 16:51:17,445 INFO  L290        TraceCheckUtils]: 3: Hoare triple {2549#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32);call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); {2549#true} is VALID
[2022-02-20 16:51:17,446 INFO  L290        TraceCheckUtils]: 4: Hoare triple {2549#true} assume true; {2549#true} is VALID
[2022-02-20 16:51:17,446 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {2549#true} {2549#true} #854#return; {2549#true} is VALID
[2022-02-20 16:51:17,447 INFO  L290        TraceCheckUtils]: 6: Hoare triple {2549#true} init_kernel_~i~1#1 := 0bv32; {2572#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32))} is VALID
[2022-02-20 16:51:17,447 INFO  L290        TraceCheckUtils]: 7: Hoare triple {2572#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32))} assume !~bvslt32(init_kernel_~i~1#1, 10bv32); {2550#false} is VALID
[2022-02-20 16:51:17,448 INFO  L290        TraceCheckUtils]: 8: Hoare triple {2550#false} init_kernel_~i~1#1 := 0bv32; {2550#false} is VALID
[2022-02-20 16:51:17,448 INFO  L290        TraceCheckUtils]: 9: Hoare triple {2550#false} assume !~bvslt32(init_kernel_~i~1#1, 1bv32); {2550#false} is VALID
[2022-02-20 16:51:17,448 INFO  L290        TraceCheckUtils]: 10: Hoare triple {2550#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~C_INT } true;##fun~~TO~C_INT_#in~#fp#1.base, ##fun~~TO~C_INT_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~C_INT_#res#1;havoc ##fun~~TO~C_INT_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {2550#false} is VALID
[2022-02-20 16:51:17,448 INFO  L272        TraceCheckUtils]: 11: Hoare triple {2550#false} call zf_init_#t~ret218#1 := printk(20bv32, 0bv32); {2550#false} is VALID
[2022-02-20 16:51:17,448 INFO  L290        TraceCheckUtils]: 12: Hoare triple {2550#false} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0bv32; {2550#false} is VALID
[2022-02-20 16:51:17,449 INFO  L290        TraceCheckUtils]: 13: Hoare triple {2550#false} assume true; {2550#false} is VALID
[2022-02-20 16:51:17,449 INFO  L284        TraceCheckUtils]: 14: Hoare quadruple {2550#false} {2550#false} #856#return; {2550#false} is VALID
[2022-02-20 16:51:17,449 INFO  L290        TraceCheckUtils]: 15: Hoare triple {2550#false} havoc zf_init_#t~ret218#1; {2550#false} is VALID
[2022-02-20 16:51:17,449 INFO  L272        TraceCheckUtils]: 16: Hoare triple {2550#false} call zf_init_#t~ret219#1 := zf_readw(2bv8); {2550#false} is VALID
[2022-02-20 16:51:17,449 INFO  L290        TraceCheckUtils]: 17: Hoare triple {2550#false} ~port#1 := #in~port#1; {2550#false} is VALID
[2022-02-20 16:51:17,450 INFO  L272        TraceCheckUtils]: 18: Hoare triple {2550#false} call outb(~port#1, 536bv32); {2550#false} is VALID
[2022-02-20 16:51:17,450 INFO  L290        TraceCheckUtils]: 19: Hoare triple {2550#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {2550#false} is VALID
[2022-02-20 16:51:17,450 INFO  L290        TraceCheckUtils]: 20: Hoare triple {2550#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~bvuge32(~port#1, ~ddv_ioport_request_start~0) && ~bvult32(~port#1, ~bvadd32(~ddv_ioport_request_start~0, ~ddv_ioport_request_len~0)) then 1bv32 else 0bv32), 26bv32, 0bv32;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {2550#false} is VALID
[2022-02-20 16:51:17,450 INFO  L290        TraceCheckUtils]: 21: Hoare triple {2550#false} assume 0bv32 == __VERIFIER_assert_~expression#1; {2550#false} is VALID
[2022-02-20 16:51:17,450 INFO  L290        TraceCheckUtils]: 22: Hoare triple {2550#false} assume !false; {2550#false} is VALID
[2022-02-20 16:51:17,451 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 16:51:17,451 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-20 16:51:17,451 INFO  L144   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-02-20 16:51:17,451 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643206782]
[2022-02-20 16:51:17,452 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleMathsat [643206782] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 16:51:17,452 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 16:51:17,452 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 16:51:17,452 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568599883]
[2022-02-20 16:51:17,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 16:51:17,454 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23
[2022-02-20 16:51:17,454 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-02-20 16:51:17,454 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:17,534 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:51:17,535 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 16:51:17,535 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-02-20 16:51:17,535 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 16:51:17,535 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 16:51:17,536 INFO  L87              Difference]: Start difference. First operand 343 states and 473 transitions. Second operand  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:23,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:51:23,668 INFO  L93              Difference]: Finished difference Result 684 states and 944 transitions.
[2022-02-20 16:51:23,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-02-20 16:51:23,668 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23
[2022-02-20 16:51:23,668 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 16:51:23,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:23,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions.
[2022-02-20 16:51:23,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:23,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions.
[2022-02-20 16:51:23,702 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 944 transitions.
[2022-02-20 16:51:24,708 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 944 edges. 944 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:51:24,733 INFO  L225             Difference]: With dead ends: 684
[2022-02-20 16:51:24,733 INFO  L226             Difference]: Without dead ends: 347
[2022-02-20 16:51:24,734 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 16:51:24,735 INFO  L933         BasicCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 16:51:24,736 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 933 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 16:51:24,737 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 347 states.
[2022-02-20 16:51:24,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345.
[2022-02-20 16:51:24,753 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 16:51:24,754 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:24,755 INFO  L74              IsIncluded]: Start isIncluded. First operand 347 states. Second operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:24,757 INFO  L87              Difference]: Start difference. First operand 347 states. Second operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:24,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:51:24,823 INFO  L93              Difference]: Finished difference Result 347 states and 477 transitions.
[2022-02-20 16:51:24,823 INFO  L276                IsEmpty]: Start isEmpty. Operand 347 states and 477 transitions.
[2022-02-20 16:51:24,826 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:51:24,826 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:51:24,828 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 347 states.
[2022-02-20 16:51:24,830 INFO  L87              Difference]: Start difference. First operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand 347 states.
[2022-02-20 16:51:24,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 16:51:24,869 INFO  L93              Difference]: Finished difference Result 347 states and 477 transitions.
[2022-02-20 16:51:24,870 INFO  L276                IsEmpty]: Start isEmpty. Operand 347 states and 477 transitions.
[2022-02-20 16:51:24,871 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 16:51:24,871 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 16:51:24,871 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-20 16:51:24,871 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 16:51:24,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 345 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 248 states have internal predecessors, (324), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75)
[2022-02-20 16:51:24,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 475 transitions.
[2022-02-20 16:51:24,896 INFO  L78                 Accepts]: Start accepts. Automaton has 345 states and 475 transitions. Word has length 23
[2022-02-20 16:51:24,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-20 16:51:24,897 INFO  L470      AbstractCegarLoop]: Abstraction has 345 states and 475 transitions.
[2022-02-20 16:51:24,897 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-02-20 16:51:24,897 INFO  L276                IsEmpty]: Start isEmpty. Operand 345 states and 475 transitions.
[2022-02-20 16:51:24,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-02-20 16:51:24,898 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-20 16:51:24,898 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 16:51:24,911 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2022-02-20 16:51:25,103 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 16:51:25,104 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting outbErr0ASSERT_VIOLATIONERROR_FUNCTION === [outbErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 16:51:25,104 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 16:51:25,104 INFO  L85        PathProgramCache]: Analyzing trace with hash -1291780389, now seen corresponding path program 1 times
[2022-02-20 16:51:25,105 INFO  L126   FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-02-20 16:51:25,105 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848958768]
[2022-02-20 16:51:25,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 16:51:25,106 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-02-20 16:51:25,106 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2022-02-20 16:51:25,107 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 16:51:25,112 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 16:51:25,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:51:25,511 INFO  L263         TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-02-20 16:51:25,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 16:51:25,534 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-20 16:51:25,640 INFO  L290        TraceCheckUtils]: 0: Hoare triple {4729#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(19bv32, 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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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; {4729#true} is VALID
[2022-02-20 16:51:25,640 INFO  L290        TraceCheckUtils]: 1: Hoare triple {4729#true} assume { :end_inline_ULTIMATE.init } true;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; {4729#true} is VALID
[2022-02-20 16:51:25,641 INFO  L272        TraceCheckUtils]: 2: Hoare triple {4729#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {4729#true} is VALID
[2022-02-20 16:51:25,641 INFO  L290        TraceCheckUtils]: 3: Hoare triple {4729#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32);call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); {4729#true} is VALID
[2022-02-20 16:51:25,641 INFO  L290        TraceCheckUtils]: 4: Hoare triple {4729#true} assume true; {4729#true} is VALID
[2022-02-20 16:51:25,641 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {4729#true} {4729#true} #854#return; {4729#true} is VALID
[2022-02-20 16:51:25,642 INFO  L290        TraceCheckUtils]: 6: Hoare triple {4729#true} init_kernel_~i~1#1 := 0bv32; {4752#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32))} is VALID
[2022-02-20 16:51:25,643 INFO  L290        TraceCheckUtils]: 7: Hoare triple {4752#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32);call write~$Pointer$(0bv32, 0bv32, ~#shared_workqueue~0.base, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), 4bv32); {4752#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32))} is VALID
[2022-02-20 16:51:25,643 INFO  L290        TraceCheckUtils]: 8: Hoare triple {4752#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ 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; {4759#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32))} is VALID
[2022-02-20 16:51:25,644 INFO  L290        TraceCheckUtils]: 9: Hoare triple {4759#(= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32))} assume !~bvslt32(init_kernel_~i~1#1, 10bv32); {4730#false} is VALID
[2022-02-20 16:51:25,644 INFO  L290        TraceCheckUtils]: 10: Hoare triple {4730#false} init_kernel_~i~1#1 := 0bv32; {4730#false} is VALID
[2022-02-20 16:51:25,644 INFO  L290        TraceCheckUtils]: 11: Hoare triple {4730#false} assume !!~bvslt32(init_kernel_~i~1#1, 1bv32);call write~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~bvadd32(~#tasklet_registered~0.offset, ~bvmul32(6bv32, init_kernel_~i~1#1)), 4bv32);call write~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~bvadd32(~#tasklet_registered~0.offset, ~bvmul32(6bv32, init_kernel_~i~1#1))), 2bv32); {4730#false} is VALID
[2022-02-20 16:51:25,645 INFO  L290        TraceCheckUtils]: 12: Hoare triple {4730#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := ~bvadd32(1bv32, init_kernel_#t~post299#1);havoc init_kernel_#t~post299#1; {4730#false} is VALID
[2022-02-20 16:51:25,645 INFO  L290        TraceCheckUtils]: 13: Hoare triple {4730#false} assume !~bvslt32(init_kernel_~i~1#1, 1bv32); {4730#false} is VALID
[2022-02-20 16:51:25,645 INFO  L290        TraceCheckUtils]: 14: Hoare triple {4730#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~C_INT } true;##fun~~TO~C_INT_#in~#fp#1.base, ##fun~~TO~C_INT_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~C_INT_#res#1;havoc ##fun~~TO~C_INT_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {4730#false} is VALID
[2022-02-20 16:51:25,645 INFO  L272        TraceCheckUtils]: 15: Hoare triple {4730#false} call zf_init_#t~ret218#1 := printk(20bv32, 0bv32); {4730#false} is VALID
[2022-02-20 16:51:25,645 INFO  L290        TraceCheckUtils]: 16: Hoare triple {4730#false} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0bv32; {4730#false} is VALID
[2022-02-20 16:51:25,646 INFO  L290        TraceCheckUtils]: 17: Hoare triple {4730#false} assume true; {4730#false} is VALID
[2022-02-20 16:51:25,646 INFO  L284        TraceCheckUtils]: 18: Hoare quadruple {4730#false} {4730#false} #856#return; {4730#false} is VALID
[2022-02-20 16:51:25,646 INFO  L290        TraceCheckUtils]: 19: Hoare triple {4730#false} havoc zf_init_#t~ret218#1; {4730#false} is VALID
[2022-02-20 16:51:25,646 INFO  L272        TraceCheckUtils]: 20: Hoare triple {4730#false} call zf_init_#t~ret219#1 := zf_readw(2bv8); {4730#false} is VALID
[2022-02-20 16:51:25,646 INFO  L290        TraceCheckUtils]: 21: Hoare triple {4730#false} ~port#1 := #in~port#1; {4730#false} is VALID
[2022-02-20 16:51:25,647 INFO  L272        TraceCheckUtils]: 22: Hoare triple {4730#false} call outb(~port#1, 536bv32); {4730#false} is VALID
[2022-02-20 16:51:25,647 INFO  L290        TraceCheckUtils]: 23: Hoare triple {4730#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {4730#false} is VALID
[2022-02-20 16:51:25,647 INFO  L290        TraceCheckUtils]: 24: Hoare triple {4730#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~bvuge32(~port#1, ~ddv_ioport_request_start~0) && ~bvult32(~port#1, ~bvadd32(~ddv_ioport_request_start~0, ~ddv_ioport_request_len~0)) then 1bv32 else 0bv32), 26bv32, 0bv32;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {4730#false} is VALID
[2022-02-20 16:51:25,647 INFO  L290        TraceCheckUtils]: 25: Hoare triple {4730#false} assume 0bv32 == __VERIFIER_assert_~expression#1; {4730#false} is VALID
[2022-02-20 16:51:25,648 INFO  L290        TraceCheckUtils]: 26: Hoare triple {4730#false} assume !false; {4730#false} is VALID
[2022-02-20 16:51:25,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:51:25,648 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-20 16:51:25,766 INFO  L290        TraceCheckUtils]: 26: Hoare triple {4730#false} assume !false; {4730#false} is VALID
[2022-02-20 16:51:25,767 INFO  L290        TraceCheckUtils]: 25: Hoare triple {4730#false} assume 0bv32 == __VERIFIER_assert_~expression#1; {4730#false} is VALID
[2022-02-20 16:51:25,767 INFO  L290        TraceCheckUtils]: 24: Hoare triple {4730#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~expression#1, __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset := (if ~bvuge32(~port#1, ~ddv_ioport_request_start~0) && ~bvult32(~port#1, ~bvadd32(~ddv_ioport_request_start~0, ~ddv_ioport_request_len~0)) then 1bv32 else 0bv32), 26bv32, 0bv32;havoc __VERIFIER_assert_~expression#1, __VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset;__VERIFIER_assert_~expression#1 := __VERIFIER_assert_#in~expression#1;__VERIFIER_assert_~x#1.base, __VERIFIER_assert_~x#1.offset := __VERIFIER_assert_#in~x#1.base, __VERIFIER_assert_#in~x#1.offset; {4730#false} is VALID
[2022-02-20 16:51:25,767 INFO  L290        TraceCheckUtils]: 23: Hoare triple {4730#false} ~byte#1 := #in~byte#1;~port#1 := #in~port#1; {4730#false} is VALID
[2022-02-20 16:51:25,768 INFO  L272        TraceCheckUtils]: 22: Hoare triple {4730#false} call outb(~port#1, 536bv32); {4730#false} is VALID
[2022-02-20 16:51:25,768 INFO  L290        TraceCheckUtils]: 21: Hoare triple {4730#false} ~port#1 := #in~port#1; {4730#false} is VALID
[2022-02-20 16:51:25,768 INFO  L272        TraceCheckUtils]: 20: Hoare triple {4730#false} call zf_init_#t~ret219#1 := zf_readw(2bv8); {4730#false} is VALID
[2022-02-20 16:51:25,768 INFO  L290        TraceCheckUtils]: 19: Hoare triple {4730#false} havoc zf_init_#t~ret218#1; {4730#false} is VALID
[2022-02-20 16:51:25,768 INFO  L284        TraceCheckUtils]: 18: Hoare quadruple {4729#true} {4730#false} #856#return; {4730#false} is VALID
[2022-02-20 16:51:25,769 INFO  L290        TraceCheckUtils]: 17: Hoare triple {4729#true} assume true; {4729#true} is VALID
[2022-02-20 16:51:25,769 INFO  L290        TraceCheckUtils]: 16: Hoare triple {4729#true} ~fmt.base, ~fmt.offset := #in~fmt.base, #in~fmt.offset;#res := 0bv32; {4729#true} is VALID
[2022-02-20 16:51:25,769 INFO  L272        TraceCheckUtils]: 15: Hoare triple {4730#false} call zf_init_#t~ret218#1 := printk(20bv32, 0bv32); {4729#true} is VALID
[2022-02-20 16:51:25,769 INFO  L290        TraceCheckUtils]: 14: Hoare triple {4730#false} assume { :end_inline_init_kernel } true;assume { :begin_inline_##fun~~TO~C_INT } true;##fun~~TO~C_INT_#in~#fp#1.base, ##fun~~TO~C_INT_#in~#fp#1.offset := ~_ddv_module_init~0.base, ~_ddv_module_init~0.offset;havoc ##fun~~TO~C_INT_#res#1;havoc ##fun~~TO~C_INT_#t~ret775#1;assume { :begin_inline_zf_init } true;havoc zf_init_#res#1;havoc zf_init_#t~ret218#1, zf_init_#t~ret219#1, zf_init_#t~ret220#1, zf_init_#t~ret221#1, zf_init_#t~ret222#1, zf_init_#t~ret223#1.base, zf_init_#t~ret223#1.offset, zf_init_#t~ret224#1, zf_init_#t~ret225#1, zf_init_#t~ret226#1, zf_init_#t~ret227#1, zf_init_~ret~3#1;havoc zf_init_~ret~3#1; {4730#false} is VALID
[2022-02-20 16:51:25,769 INFO  L290        TraceCheckUtils]: 13: Hoare triple {4730#false} assume !~bvslt32(init_kernel_~i~1#1, 1bv32); {4730#false} is VALID
[2022-02-20 16:51:25,770 INFO  L290        TraceCheckUtils]: 12: Hoare triple {4730#false} init_kernel_#t~post299#1 := init_kernel_~i~1#1;init_kernel_~i~1#1 := ~bvadd32(1bv32, init_kernel_#t~post299#1);havoc init_kernel_#t~post299#1; {4730#false} is VALID
[2022-02-20 16:51:25,770 INFO  L290        TraceCheckUtils]: 11: Hoare triple {4730#false} assume !!~bvslt32(init_kernel_~i~1#1, 1bv32);call write~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~bvadd32(~#tasklet_registered~0.offset, ~bvmul32(6bv32, init_kernel_~i~1#1)), 4bv32);call write~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~bvadd32(~#tasklet_registered~0.offset, ~bvmul32(6bv32, init_kernel_~i~1#1))), 2bv32); {4730#false} is VALID
[2022-02-20 16:51:25,770 INFO  L290        TraceCheckUtils]: 10: Hoare triple {4730#false} init_kernel_~i~1#1 := 0bv32; {4730#false} is VALID
[2022-02-20 16:51:25,771 INFO  L290        TraceCheckUtils]: 9: Hoare triple {4865#(bvslt |ULTIMATE.start_init_kernel_~i~1#1| (_ bv10 32))} assume !~bvslt32(init_kernel_~i~1#1, 10bv32); {4730#false} is VALID
[2022-02-20 16:51:25,773 INFO  L290        TraceCheckUtils]: 8: Hoare triple {4869#(bvslt (bvadd |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (_ bv10 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; {4865#(bvslt |ULTIMATE.start_init_kernel_~i~1#1| (_ bv10 32))} is VALID
[2022-02-20 16:51:25,774 INFO  L290        TraceCheckUtils]: 7: Hoare triple {4869#(bvslt (bvadd |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32);call write~$Pointer$(0bv32, 0bv32, ~#shared_workqueue~0.base, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), 4bv32); {4869#(bvslt (bvadd |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (_ bv10 32))} is VALID
[2022-02-20 16:51:25,774 INFO  L290        TraceCheckUtils]: 6: Hoare triple {4729#true} init_kernel_~i~1#1 := 0bv32; {4869#(bvslt (bvadd |ULTIMATE.start_init_kernel_~i~1#1| (_ bv1 32)) (_ bv10 32))} is VALID
[2022-02-20 16:51:25,774 INFO  L284        TraceCheckUtils]: 5: Hoare quadruple {4729#true} {4729#true} #854#return; {4729#true} is VALID
[2022-02-20 16:51:25,775 INFO  L290        TraceCheckUtils]: 4: Hoare triple {4729#true} assume true; {4729#true} is VALID
[2022-02-20 16:51:25,775 INFO  L290        TraceCheckUtils]: 3: Hoare triple {4729#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32);call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); {4729#true} is VALID
[2022-02-20 16:51:25,775 INFO  L272        TraceCheckUtils]: 2: Hoare triple {4729#true} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {4729#true} is VALID
[2022-02-20 16:51:25,775 INFO  L290        TraceCheckUtils]: 1: Hoare triple {4729#true} assume { :end_inline_ULTIMATE.init } true;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; {4729#true} is VALID
[2022-02-20 16:51:25,776 INFO  L290        TraceCheckUtils]: 0: Hoare triple {4729#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(19bv32, 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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#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);~#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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#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; {4729#true} is VALID
[2022-02-20 16:51:25,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-20 16:51:25,776 INFO  L144   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-02-20 16:51:25,776 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848958768]
[2022-02-20 16:51:25,777 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleMathsat [848958768] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-20 16:51:25,777 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-02-20 16:51:25,777 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2022-02-20 16:51:25,777 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674725854]
[2022-02-20 16:51:25,777 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-02-20 16:51:25,778 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27
[2022-02-20 16:51:25,778 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-02-20 16:51:25,778 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-02-20 16:51:25,831 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-20 16:51:25,831 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-20 16:51:25,831 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-02-20 16:51:25,832 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-20 16:51:25,832 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2022-02-20 16:51:25,832 INFO  L87              Difference]: Start difference. First operand 345 states and 475 transitions. Second operand  has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)