./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a900a56caf1252bf2b77371f0836914c913e44b231203ecd4eebd687a96fd0c2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:57:46,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:57:46,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:57:46,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:57:46,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:57:46,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:57:46,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:57:46,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:57:46,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:57:46,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:57:46,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:57:46,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:57:46,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:57:46,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:57:46,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:57:46,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:57:46,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:57:46,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:57:46,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:57:46,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:57:46,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:57:46,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:57:46,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:57:46,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:57:46,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:57:46,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:57:46,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:57:46,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:57:46,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:57:46,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:57:46,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:57:46,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:57:46,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:57:46,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:57:46,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:57:46,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:57:46,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:57:46,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:57:46,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:57:46,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:57:46,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:57:46,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:57:46,759 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:57:46,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:57:46,760 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:57:46,760 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:57:46,761 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:57:46,761 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:57:46,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:57:46,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:57:46,761 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:57:46,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:57:46,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:57:46,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:57:46,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:57:46,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:57:46,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:57:46,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:57:46,763 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:57:46,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:57:46,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:57:46,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:57:46,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:57:46,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:57:46,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:57:46,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:57:46,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:57:46,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:57:46,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:57:46,765 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:57:46,766 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:57:46,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:57:46,766 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a900a56caf1252bf2b77371f0836914c913e44b231203ecd4eebd687a96fd0c2 [2022-02-20 21:57:46,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:57:46,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:57:46,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:57:46,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:57:46,979 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:57:46,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i [2022-02-20 21:57:47,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee0b4ea3/4863a58fa49147a49cf25ece8dd370a2/FLAG517a02d4c [2022-02-20 21:57:47,675 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:57:47,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i [2022-02-20 21:57:47,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee0b4ea3/4863a58fa49147a49cf25ece8dd370a2/FLAG517a02d4c [2022-02-20 21:57:47,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee0b4ea3/4863a58fa49147a49cf25ece8dd370a2 [2022-02-20 21:57:47,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:57:47,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:57:47,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:57:47,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:57:47,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:57:47,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:57:47" (1/1) ... [2022-02-20 21:57:47,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cdcd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:47, skipping insertion in model container [2022-02-20 21:57:47,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:57:47" (1/1) ... [2022-02-20 21:57:47,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:57:47,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:57:48,370 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5986] [2022-02-20 21:57:48,371 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5987-5988] [2022-02-20 21:57:48,758 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/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i[188410,188423] [2022-02-20 21:57:49,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:57:49,579 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:57:49,676 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5986] [2022-02-20 21:57:49,676 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5987-5988] [2022-02-20 21:57:49,688 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/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i[188410,188423] [2022-02-20 21:57:49,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:57:50,031 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:57:50,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50 WrapperNode [2022-02-20 21:57:50,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:57:50,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:57:50,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:57:50,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:57:50,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,248 INFO L137 Inliner]: procedures = 350, calls = 2000, calls flagged for inlining = 171, calls inlined = 139, statements flattened = 4723 [2022-02-20 21:57:50,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:57:50,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:57:50,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:57:50,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:57:50,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:57:50,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:57:50,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:57:50,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:57:50,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (1/1) ... [2022-02-20 21:57:50,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:57:50,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:57:50,528 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 21:57:50,535 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 21:57:50,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:57:50,562 INFO L130 BoogieDeclarations]: Found specification of procedure get_page [2022-02-20 21:57:50,562 INFO L138 BoogieDeclarations]: Found implementation of procedure get_page [2022-02-20 21:57:50,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:57:50,562 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_release_tx_bufs [2022-02-20 21:57:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_release_tx_bufs [2022-02-20 21:57:50,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:57:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:57:50,563 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2022-02-20 21:57:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2022-02-20 21:57:50,563 INFO L130 BoogieDeclarations]: Found specification of procedure napi_schedule [2022-02-20 21:57:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_schedule [2022-02-20 21:57:50,563 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_change_mtu [2022-02-20 21:57:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_change_mtu [2022-02-20 21:57:50,564 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-02-20 21:57:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-02-20 21:57:50,564 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_write [2022-02-20 21:57:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_write [2022-02-20 21:57:50,564 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-02-20 21:57:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-02-20 21:57:50,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-02-20 21:57:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-02-20 21:57:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:57:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:57:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-02-20 21:57:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-02-20 21:57:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure u64_stats_update_begin [2022-02-20 21:57:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure u64_stats_update_begin [2022-02-20 21:57:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure bind_evtchn_to_irqhandler [2022-02-20 21:57:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_evtchn_to_irqhandler [2022-02-20 21:57:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_transaction_end [2022-02-20 21:57:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_transaction_end [2022-02-20 21:57:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_remove [2022-02-20 21:57:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_remove [2022-02-20 21:57:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:57:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:57:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-02-20 21:57:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-02-20 21:57:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-02-20 21:57:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-02-20 21:57:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_grant_ring [2022-02-20 21:57:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_grant_ring [2022-02-20 21:57:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-02-20 21:57:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-02-20 21:57:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:57:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:57:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_claim_grant_reference [2022-02-20 21:57:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_claim_grant_reference [2022-02-20 21:57:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:57:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:57:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure netif_set_real_num_tx_queues [2022-02-20 21:57:50,569 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_set_real_num_tx_queues [2022-02-20 21:57:50,569 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_end_foreign_access [2022-02-20 21:57:50,569 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_end_foreign_access [2022-02-20 21:57:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_disconnect_backend [2022-02-20 21:57:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_disconnect_backend [2022-02-20 21:57:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_get_stats64 [2022-02-20 21:57:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_get_stats64 [2022-02-20 21:57:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 21:57:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 21:57:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_alloc_evtchn [2022-02-20 21:57:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_alloc_evtchn [2022-02-20 21:57:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-02-20 21:57:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-02-20 21:57:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_alloc_grant_references [2022-02-20 21:57:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_alloc_grant_references [2022-02-20 21:57:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:57:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure netfront_tx_slot_available [2022-02-20 21:57:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure netfront_tx_slot_available [2022-02-20 21:57:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure notify_remote_via_irq [2022-02-20 21:57:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure notify_remote_via_irq [2022-02-20 21:57:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_release_grant_reference [2022-02-20 21:57:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_release_grant_reference [2022-02-20 21:57:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure eth_mac_addr [2022-02-20 21:57:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_mac_addr [2022-02-20 21:57:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_can_sg [2022-02-20 21:57:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_can_sg [2022-02-20 21:57:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:57:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-02-20 21:57:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-02-20 21:57:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-02-20 21:57:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-02-20 21:57:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-02-20 21:57:50,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-02-20 21:57:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2022-02-20 21:57:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_queue_tail [2022-02-20 21:57:50,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_queue_tail [2022-02-20 21:57:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_rxidx [2022-02-20 21:57:50,575 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_rxidx [2022-02-20 21:57:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 21:57:50,575 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 21:57:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:57:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-02-20 21:57:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-02-20 21:57:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:57:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure write_queue_xenstore_keys [2022-02-20 21:57:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure write_queue_xenstore_keys [2022-02-20 21:57:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure pfn_to_mfn [2022-02-20 21:57:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure pfn_to_mfn [2022-02-20 21:57:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-02-20 21:57:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-02-20 21:57:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure add_id_to_freelist [2022-02-20 21:57:50,577 INFO L138 BoogieDeclarations]: Found implementation of procedure add_id_to_freelist [2022-02-20 21:57:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_alloc_rx_buffers [2022-02-20 21:57:50,577 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_alloc_rx_buffers [2022-02-20 21:57:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure skb_entry_set_link [2022-02-20 21:57:50,577 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_entry_set_link [2022-02-20 21:57:50,578 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:57:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:57:50,578 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 21:57:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 21:57:50,578 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-02-20 21:57:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-02-20 21:57:50,578 INFO L130 BoogieDeclarations]: Found specification of procedure free_pages [2022-02-20 21:57:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure free_pages [2022-02-20 21:57:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_end_foreign_access_ref [2022-02-20 21:57:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_end_foreign_access_ref [2022-02-20 21:57:50,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:57:50,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:57:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:57:50,581 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-02-20 21:57:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-02-20 21:57:50,582 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_free_grant_references [2022-02-20 21:57:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_free_grant_references [2022-02-20 21:57:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure simple_strtoul [2022-02-20 21:57:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure simple_strtoul [2022-02-20 21:57:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-02-20 21:57:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-02-20 21:57:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 21:57:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 21:57:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:57:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure unbind_from_irqhandler [2022-02-20 21:57:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure unbind_from_irqhandler [2022-02-20 21:57:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure get_zeroed_page [2022-02-20 21:57:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure get_zeroed_page [2022-02-20 21:57:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure netback_changed [2022-02-20 21:57:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure netback_changed [2022-02-20 21:57:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_poll_controller [2022-02-20 21:57:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_poll_controller [2022-02-20 21:57:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_insert [2022-02-20 21:57:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_insert [2022-02-20 21:57:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:57:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-02-20 21:57:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-02-20 21:57:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-02-20 21:57:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-02-20 21:57:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure skb_frag_page [2022-02-20 21:57:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_frag_page [2022-02-20 21:57:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:57:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:57:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_select_queue [2022-02-20 21:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_select_queue [2022-02-20 21:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_end_access [2022-02-20 21:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_end_access [2022-02-20 21:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure skb_get [2022-02-20 21:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_get [2022-02-20 21:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-02-20 21:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-02-20 21:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_get_rx_ref [2022-02-20 21:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_get_rx_ref [2022-02-20 21:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:57:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2022-02-20 21:57:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2022-02-20 21:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure skb_add_rx_frag [2022-02-20 21:57:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_add_rx_frag [2022-02-20 21:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure net_ratelimit [2022-02-20 21:57:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure net_ratelimit [2022-02-20 21:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-02-20 21:57:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-02-20 21:57:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:57:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:57:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure get_id_from_freelist [2022-02-20 21:57:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure get_id_from_freelist [2022-02-20 21:57:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_dequeue [2022-02-20 21:57:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_dequeue [2022-02-20 21:57:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_fix_features [2022-02-20 21:57:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_fix_features [2022-02-20 21:57:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:57:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-02-20 21:57:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-02-20 21:57:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:57:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-02-20 21:57:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-02-20 21:57:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_next [2022-02-20 21:57:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_next [2022-02-20 21:57:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:57:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-02-20 21:57:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-02-20 21:57:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headlen [2022-02-20 21:57:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headlen [2022-02-20 21:57:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-02-20 21:57:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-02-20 21:57:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2022-02-20 21:57:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2022-02-20 21:57:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_lock [2022-02-20 21:57:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_lock [2022-02-20 21:57:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure skb_is_gso [2022-02-20 21:57:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_is_gso [2022-02-20 21:57:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-02-20 21:57:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-02-20 21:57:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_len [2022-02-20 21:57:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_len [2022-02-20 21:57:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_grant_foreign_access_ref [2022-02-20 21:57:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_grant_foreign_access_ref [2022-02-20 21:57:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 21:57:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 21:57:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_set_features [2022-02-20 21:57:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_set_features [2022-02-20 21:57:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure skb_frag_size [2022-02-20 21:57:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_frag_size [2022-02-20 21:57:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 21:57:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 21:57:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:57:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-02-20 21:57:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-02-20 21:57:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-02-20 21:57:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-02-20 21:57:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_free_evtchn [2022-02-20 21:57:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_free_evtchn [2022-02-20 21:57:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_get_rx_skb [2022-02-20 21:57:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_get_rx_skb [2022-02-20 21:57:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:57:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:57:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_tx_buf_gc [2022-02-20 21:57:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_tx_buf_gc [2022-02-20 21:57:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-02-20 21:57:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-02-20 21:57:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 21:57:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 21:57:51,205 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:57:51,208 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:57:51,967 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:57:59,087 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:57:59,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:57:59,107 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:57:59,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:57:59 BoogieIcfgContainer [2022-02-20 21:57:59,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:57:59,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:57:59,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:57:59,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:57:59,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:57:47" (1/3) ... [2022-02-20 21:57:59,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57101eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:57:59, skipping insertion in model container [2022-02-20 21:57:59,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:50" (2/3) ... [2022-02-20 21:57:59,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57101eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:57:59, skipping insertion in model container [2022-02-20 21:57:59,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:57:59" (3/3) ... [2022-02-20 21:57:59,132 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i [2022-02-20 21:57:59,137 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:57:59,137 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:57:59,213 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:57:59,225 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 21:57:59,225 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:57:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 1624 states, 1148 states have (on average 1.318815331010453) internal successors, (1514), 1178 states have internal predecessors, (1514), 367 states have call successors, (367), 108 states have call predecessors, (367), 107 states have return successors, (362), 360 states have call predecessors, (362), 362 states have call successors, (362) [2022-02-20 21:57:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-02-20 21:57:59,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:57:59,325 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:59,326 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:57:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:57:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1904983006, now seen corresponding path program 1 times [2022-02-20 21:57:59,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:57:59,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616830005] [2022-02-20 21:57:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:57:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:57:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:57:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3771#return; {1627#true} is VALID [2022-02-20 21:57:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:57:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3773#return; {1627#true} is VALID [2022-02-20 21:57:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:57:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3775#return; {1627#true} is VALID [2022-02-20 21:57:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:57:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3777#return; {1627#true} is VALID [2022-02-20 21:57:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:57:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3779#return; {1627#true} is VALID [2022-02-20 21:57:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:57:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3781#return; {1627#true} is VALID [2022-02-20 21:57:59,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:57:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3783#return; {1627#true} is VALID [2022-02-20 21:57:59,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:57:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:59,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:57:59,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:57:59,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:57:59,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3785#return; {1627#true} is VALID [2022-02-20 21:57:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:58:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3787#return; {1627#true} is VALID [2022-02-20 21:58:00,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:58:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {1723#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {1627#true} is VALID [2022-02-20 21:58:00,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {1627#true} is VALID [2022-02-20 21:58:00,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1627#true} is VALID [2022-02-20 21:58:00,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3789#return; {1627#true} is VALID [2022-02-20 21:58:00,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-20 21:58:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {1723#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {1627#true} is VALID [2022-02-20 21:58:00,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {1627#true} is VALID [2022-02-20 21:58:00,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1627#true} is VALID [2022-02-20 21:58:00,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3791#return; {1627#true} is VALID [2022-02-20 21:58:00,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:58:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {1723#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {1627#true} is VALID [2022-02-20 21:58:00,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {1627#true} is VALID [2022-02-20 21:58:00,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1627#true} is VALID [2022-02-20 21:58:00,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #3793#return; {1627#true} is VALID [2022-02-20 21:58:00,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-02-20 21:58:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {1627#true} is VALID [2022-02-20 21:58:00,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1628#false} #3835#return; {1628#false} is VALID [2022-02-20 21:58:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-20 21:58:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1628#false} #3837#return; {1628#false} is VALID [2022-02-20 21:58:00,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-20 21:58:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {1627#true} is VALID [2022-02-20 21:58:00,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1628#false} #3839#return; {1628#false} is VALID [2022-02-20 21:58:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-02-20 21:58:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset; {1627#true} is VALID [2022-02-20 21:58:00,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1628#false} #3841#return; {1628#false} is VALID [2022-02-20 21:58:00,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-02-20 21:58:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:58:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {1627#true} is VALID [2022-02-20 21:58:00,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1627#true} #4131#return; {1627#true} is VALID [2022-02-20 21:58:00,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~lock#1.base, ~lock#1.offset := #in~lock#1.base, #in~lock#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,105 INFO L272 TraceCheckUtils]: 1: Hoare triple {1627#true} call ldv_spin_lock(); {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 21:58:00,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {1627#true} is VALID [2022-02-20 21:58:00,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,105 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1627#true} {1627#true} #4131#return; {1627#true} is VALID [2022-02-20 21:58:00,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {1627#true} assume { :begin_inline_ldv_spin_lock_bh_2 } true;ldv_spin_lock_bh_2_#in~lock#1.base, ldv_spin_lock_bh_2_#in~lock#1.offset := ~lock#1.base, ~lock#1.offset;havoc ldv_spin_lock_bh_2_~lock#1.base, ldv_spin_lock_bh_2_~lock#1.offset;ldv_spin_lock_bh_2_~lock#1.base, ldv_spin_lock_bh_2_~lock#1.offset := ldv_spin_lock_bh_2_#in~lock#1.base, ldv_spin_lock_bh_2_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock_bh } true;_raw_spin_lock_bh_#in~arg0#1.base, _raw_spin_lock_bh_#in~arg0#1.offset := ldv_spin_lock_bh_2_~lock#1.base, ldv_spin_lock_bh_2_~lock#1.offset;havoc _raw_spin_lock_bh_~arg0#1.base, _raw_spin_lock_bh_~arg0#1.offset;_raw_spin_lock_bh_~arg0#1.base, _raw_spin_lock_bh_~arg0#1.offset := _raw_spin_lock_bh_#in~arg0#1.base, _raw_spin_lock_bh_#in~arg0#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {1627#true} assume { :end_inline__raw_spin_lock_bh } true; {1627#true} is VALID [2022-02-20 21:58:00,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {1627#true} assume { :end_inline_ldv_spin_lock_bh_2 } true; {1627#true} is VALID [2022-02-20 21:58:00,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,106 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1627#true} {1628#false} #3843#return; {1628#false} is VALID [2022-02-20 21:58:00,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-02-20 21:58:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:58:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1627#true} #3647#return; {1627#true} is VALID [2022-02-20 21:58:00,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~tmp~35; {1627#true} is VALID [2022-02-20 21:58:00,142 INFO L272 TraceCheckUtils]: 1: Hoare triple {1627#true} call #t~ret203 := constant_test_bit(2, ~dev.base, 68 + ~dev.offset); {1627#true} is VALID [2022-02-20 21:58:00,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,142 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1627#true} {1627#true} #3647#return; {1627#true} is VALID [2022-02-20 21:58:00,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {1627#true} assume -2147483648 <= #t~ret203 && #t~ret203 <= 2147483647;~tmp~35 := #t~ret203;havoc #t~ret203;#res := (if 0 == (if 0 == ~tmp~35 then 1 else 0) then 0 else 1); {1627#true} is VALID [2022-02-20 21:58:00,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,143 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1627#true} {1628#false} #3845#return; {1628#false} is VALID [2022-02-20 21:58:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-02-20 21:58:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:58:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1627#true} #3647#return; {1627#true} is VALID [2022-02-20 21:58:00,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~tmp~35; {1627#true} is VALID [2022-02-20 21:58:00,175 INFO L272 TraceCheckUtils]: 1: Hoare triple {1627#true} call #t~ret203 := constant_test_bit(2, ~dev.base, 68 + ~dev.offset); {1627#true} is VALID [2022-02-20 21:58:00,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,175 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1627#true} {1627#true} #3647#return; {1627#true} is VALID [2022-02-20 21:58:00,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1627#true} assume -2147483648 <= #t~ret203 && #t~ret203 <= 2147483647;~tmp~35 := #t~ret203;havoc #t~ret203;#res := (if 0 == (if 0 == ~tmp~35 then 1 else 0) then 0 else 1); {1627#true} is VALID [2022-02-20 21:58:00,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,176 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1627#true} {1628#false} #3711#return; {1628#false} is VALID [2022-02-20 21:58:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-02-20 21:58:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {1627#true} is VALID [2022-02-20 21:58:00,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1628#false} #3713#return; {1628#false} is VALID [2022-02-20 21:58:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-02-20 21:58:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:00,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} ~list_.base, ~list_.offset := #in~list_.base, #in~list_.offset;call #t~mem130 := read~int(~list_.base, 16 + ~list_.offset, 4);#res := #t~mem130;havoc #t~mem130; {1627#true} is VALID [2022-02-20 21:58:00,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1628#false} #3715#return; {1628#false} is VALID [2022-02-20 21:58:00,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#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(96, 2);call #Ultimate.allocInit(24, 3);call #Ultimate.allocInit(48, 4);call #Ultimate.allocInit(22, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(26, 7);call #Ultimate.allocInit(77, 8);call #Ultimate.allocInit(68, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(63, 11);call #Ultimate.allocInit(55, 12);call #Ultimate.allocInit(20, 13);call #Ultimate.allocInit(24, 14);call #Ultimate.allocInit(26, 15);call #Ultimate.allocInit(24, 16);call #Ultimate.allocInit(17, 17);call #Ultimate.allocInit(16, 18);call #Ultimate.allocInit(42, 19);call #Ultimate.allocInit(32, 20);call #Ultimate.allocInit(11, 21);call #Ultimate.allocInit(3, 22);call write~init~int(37, 22, 0, 1);call write~init~int(100, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(26, 23);call #Ultimate.allocInit(3, 24);call write~init~int(37, 24, 0, 1);call write~init~int(100, 24, 1, 1);call write~init~int(0, 24, 2, 1);call #Ultimate.allocInit(18, 25);call #Ultimate.allocInit(3, 26);call write~init~int(37, 26, 0, 1);call write~init~int(100, 26, 1, 1);call write~init~int(0, 26, 2, 1);call #Ultimate.allocInit(18, 27);call #Ultimate.allocInit(3, 28);call write~init~int(37, 28, 0, 1);call write~init~int(100, 28, 1, 1);call write~init~int(0, 28, 2, 1);call #Ultimate.allocInit(35, 29);call #Ultimate.allocInit(16, 30);call #Ultimate.allocInit(43, 31);call #Ultimate.allocInit(15, 32);call #Ultimate.allocInit(44, 33);call #Ultimate.allocInit(15, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(16, 36);call #Ultimate.allocInit(218, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(4, 40);call write~init~int(109, 40, 0, 1);call write~init~int(97, 40, 1, 1);call write~init~int(99, 40, 2, 1);call write~init~int(0, 40, 3, 1);call #Ultimate.allocInit(6, 41);call write~init~int(37, 41, 0, 1);call write~init~int(115, 41, 1, 1);call write~init~int(45, 41, 2, 1);call write~init~int(116, 41, 3, 1);call write~init~int(120, 41, 4, 1);call write~init~int(0, 41, 5, 1);call #Ultimate.allocInit(6, 42);call write~init~int(37, 42, 0, 1);call write~init~int(115, 42, 1, 1);call write~init~int(45, 42, 2, 1);call write~init~int(114, 42, 3, 1);call write~init~int(120, 42, 4, 1);call write~init~int(0, 42, 5, 1);call #Ultimate.allocInit(24, 43);call #Ultimate.allocInit(24, 44);call #Ultimate.allocInit(26, 45);call #Ultimate.allocInit(26, 46);call #Ultimate.allocInit(7, 47);call write~init~int(37, 47, 0, 1);call write~init~int(115, 47, 1, 1);call write~init~int(45, 47, 2, 1);call write~init~int(113, 47, 3, 1);call write~init~int(37, 47, 4, 1);call write~init~int(117, 47, 5, 1);call write~init~int(0, 47, 6, 1);call #Ultimate.allocInit(42, 48);call #Ultimate.allocInit(42, 49);call #Ultimate.allocInit(44, 50);call #Ultimate.allocInit(12, 51);call #Ultimate.allocInit(12, 52);call #Ultimate.allocInit(3, 53);call write~init~int(37, 53, 0, 1);call write~init~int(117, 53, 1, 1);call write~init~int(0, 53, 2, 1);call #Ultimate.allocInit(20, 54);call #Ultimate.allocInit(12, 55);call #Ultimate.allocInit(3, 56);call write~init~int(37, 56, 0, 1);call write~init~int(117, 56, 1, 1);call write~init~int(0, 56, 2, 1);call #Ultimate.allocInit(20, 57);call #Ultimate.allocInit(14, 58);call #Ultimate.allocInit(3, 59);call write~init~int(37, 59, 0, 1);call write~init~int(117, 59, 1, 1);call write~init~int(0, 59, 2, 1);call #Ultimate.allocInit(22, 60);call #Ultimate.allocInit(17, 61);call #Ultimate.allocInit(3, 62);call write~init~int(37, 62, 0, 1);call write~init~int(117, 62, 1, 1);call write~init~int(0, 62, 2, 1);call #Ultimate.allocInit(25, 63);call #Ultimate.allocInit(17, 64);call #Ultimate.allocInit(3, 65);call write~init~int(37, 65, 0, 1);call write~init~int(117, 65, 1, 1);call write~init~int(0, 65, 2, 1);call #Ultimate.allocInit(25, 66);call #Ultimate.allocInit(3, 67);call write~init~int(37, 67, 0, 1);call write~init~int(115, 67, 1, 1);call write~init~int(0, 67, 2, 1);call #Ultimate.allocInit(23, 68);call #Ultimate.allocInit(3, 69);call write~init~int(37, 69, 0, 1);call write~init~int(117, 69, 1, 1);call write~init~int(0, 69, 2, 1);call #Ultimate.allocInit(29, 70);call #Ultimate.allocInit(3, 71);call write~init~int(37, 71, 0, 1);call write~init~int(117, 71, 1, 1);call write~init~int(0, 71, 2, 1);call #Ultimate.allocInit(15, 72);call #Ultimate.allocInit(21, 73);call #Ultimate.allocInit(23, 74);call #Ultimate.allocInit(3, 75);call write~init~int(37, 75, 0, 1);call write~init~int(117, 75, 1, 1);call write~init~int(0, 75, 2, 1);call #Ultimate.allocInit(31, 76);call #Ultimate.allocInit(16, 77);call #Ultimate.allocInit(3, 78);call write~init~int(37, 78, 0, 1);call write~init~int(117, 78, 1, 1);call write~init~int(0, 78, 2, 1);call #Ultimate.allocInit(24, 79);call #Ultimate.allocInit(18, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(100, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(26, 82);call #Ultimate.allocInit(11, 83);call #Ultimate.allocInit(3, 84);call write~init~int(37, 84, 0, 1);call write~init~int(100, 84, 1, 1);call write~init~int(0, 84, 2, 1);call #Ultimate.allocInit(19, 85);call #Ultimate.allocInit(18, 86);call #Ultimate.allocInit(3, 87);call write~init~int(37, 87, 0, 1);call write~init~int(100, 87, 1, 1);call write~init~int(0, 87, 2, 1);call #Ultimate.allocInit(26, 88);call #Ultimate.allocInit(18, 89);call #Ultimate.allocInit(2, 90);call write~init~int(49, 90, 0, 1);call write~init~int(0, 90, 1, 1);call #Ultimate.allocInit(26, 91);call #Ultimate.allocInit(26, 92);call #Ultimate.allocInit(2, 93);call write~init~int(49, 93, 0, 1);call write~init~int(0, 93, 1, 1);call #Ultimate.allocInit(34, 94);call #Ultimate.allocInit(23, 95);call #Ultimate.allocInit(3, 96);call write~init~int(37, 96, 0, 1);call write~init~int(115, 96, 1, 1);call write~init~int(0, 96, 2, 1);call #Ultimate.allocInit(16, 97);call #Ultimate.allocInit(3, 98);call write~init~int(37, 98, 0, 1);call write~init~int(117, 98, 1, 1);call write~init~int(0, 98, 2, 1);call #Ultimate.allocInit(47, 99);call #Ultimate.allocInit(13, 100);call #Ultimate.allocInit(16, 101);call #Ultimate.allocInit(218, 102);call #Ultimate.allocInit(4, 103);call write~init~int(37, 103, 0, 1);call write~init~int(115, 103, 1, 1);call write~init~int(10, 103, 2, 1);call write~init~int(0, 103, 3, 1);call #Ultimate.allocInit(4, 104);call write~init~int(37, 104, 0, 1);call write~init~int(115, 104, 1, 1);call write~init~int(10, 104, 2, 1);call write~init~int(0, 104, 3, 1);call #Ultimate.allocInit(4, 105);call write~init~int(37, 105, 0, 1);call write~init~int(117, 105, 1, 1);call write~init~int(10, 105, 2, 1);call write~init~int(0, 105, 3, 1);call #Ultimate.allocInit(4, 106);call write~init~int(37, 106, 0, 1);call write~init~int(117, 106, 1, 1);call write~init~int(10, 106, 2, 1);call write~init~int(0, 106, 3, 1);call #Ultimate.allocInit(4, 107);call write~init~int(37, 107, 0, 1);call write~init~int(117, 107, 1, 1);call write~init~int(10, 107, 2, 1);call write~init~int(0, 107, 3, 1);call #Ultimate.allocInit(4, 108);call write~init~int(37, 108, 0, 1);call write~init~int(117, 108, 1, 1);call write~init~int(10, 108, 2, 1);call write~init~int(0, 108, 3, 1);call #Ultimate.allocInit(4, 109);call write~init~int(37, 109, 0, 1);call write~init~int(117, 109, 1, 1);call write~init~int(10, 109, 2, 1);call write~init~int(0, 109, 3, 1);call #Ultimate.allocInit(3, 110);call write~init~int(48, 110, 0, 1);call write~init~int(10, 110, 1, 1);call write~init~int(0, 110, 2, 1);call #Ultimate.allocInit(10, 111);call #Ultimate.allocInit(10, 112);call #Ultimate.allocInit(10, 113);call #Ultimate.allocInit(13, 114);call #Ultimate.allocInit(14, 115);call #Ultimate.allocInit(218, 116);call #Ultimate.allocInit(4, 117);call write~init~int(37, 117, 0, 1);call write~init~int(115, 117, 1, 1);call write~init~int(10, 117, 2, 1);call write~init~int(0, 117, 3, 1);call #Ultimate.allocInit(4, 118);call write~init~int(37, 118, 0, 1);call write~init~int(115, 118, 1, 1);call write~init~int(10, 118, 2, 1);call write~init~int(0, 118, 3, 1);call #Ultimate.allocInit(57, 119);~LDV_IN_INTERRUPT~0 := 1;~xennet_ethtool_ops_group0~0.base, ~xennet_ethtool_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~netfront_driver_group0~0.base, ~netfront_driver_group0~0.offset := 0, 0;~xennet_netdev_ops_group1~0.base, ~xennet_netdev_ops_group1~0.offset := 0, 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~xennet_max_queues~0 := 0;~#xennet_netdev_ops~0.base, ~#xennet_netdev_ops~0.offset := 120, 0;call #Ultimate.allocInit(480, 120);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_uninit.base, #funAddr~xennet_uninit.offset, ~#xennet_netdev_ops~0.base, 8 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_open.base, #funAddr~xennet_open.offset, ~#xennet_netdev_ops~0.base, 16 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_close.base, #funAddr~xennet_close.offset, ~#xennet_netdev_ops~0.base, 24 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_start_xmit.base, #funAddr~xennet_start_xmit.offset, ~#xennet_netdev_ops~0.base, 32 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_select_queue.base, #funAddr~xennet_select_queue.offset, ~#xennet_netdev_ops~0.base, 40 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 48 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 56 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~eth_mac_addr.base, #funAddr~eth_mac_addr.offset, ~#xennet_netdev_ops~0.base, 64 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~eth_validate_addr.base, #funAddr~eth_validate_addr.offset, ~#xennet_netdev_ops~0.base, 72 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 80 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 88 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_change_mtu.base, #funAddr~xennet_change_mtu.offset, ~#xennet_netdev_ops~0.base, 96 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 104 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 112 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_stats64.base, #funAddr~xennet_get_stats64.offset, ~#xennet_netdev_ops~0.base, 120 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 128 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 136 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 144 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_poll_controller.base, #funAddr~xennet_poll_controller.offset, ~#xennet_netdev_ops~0.base, 152 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 160 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 168 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 176 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 184 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 192 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 200 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 208 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 216 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 224 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 232 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 240 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 248 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 256 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 264 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 272 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 280 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 288 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 296 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 304 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 312 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 320 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 328 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_fix_features.base, #funAddr~xennet_fix_features.offset, ~#xennet_netdev_ops~0.base, 336 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_set_features.base, #funAddr~xennet_set_features.offset, ~#xennet_netdev_ops~0.base, 344 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 352 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 360 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 368 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 376 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 384 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 392 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 400 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 408 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 416 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 424 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 432 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 440 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 448 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 456 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 464 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 472 + ~#xennet_netdev_ops~0.offset, 8);~#xennet_stats~0.base, ~#xennet_stats~0.offset := 121, 0;call #Ultimate.allocInit(34, 121);call write~init~int(114, ~#xennet_stats~0.base, ~#xennet_stats~0.offset, 1);call write~init~int(120, ~#xennet_stats~0.base, 1 + ~#xennet_stats~0.offset, 1);call write~init~int(95, ~#xennet_stats~0.base, 2 + ~#xennet_stats~0.offset, 1);call write~init~int(103, ~#xennet_stats~0.base, 3 + ~#xennet_stats~0.offset, 1);call write~init~int(115, ~#xennet_stats~0.base, 4 + ~#xennet_stats~0.offset, 1);call write~init~int(111, ~#xennet_stats~0.base, 5 + ~#xennet_stats~0.offset, 1);call write~init~int(95, ~#xennet_stats~0.base, 6 + ~#xennet_stats~0.offset, 1);call write~init~int(99, ~#xennet_stats~0.base, 7 + ~#xennet_stats~0.offset, 1);call write~init~int(104, ~#xennet_stats~0.base, 8 + ~#xennet_stats~0.offset, 1);call write~init~int(101, ~#xennet_stats~0.base, 9 + ~#xennet_stats~0.offset, 1);call write~init~int(99, ~#xennet_stats~0.base, 10 + ~#xennet_stats~0.offset, 1);call write~init~int(107, ~#xennet_stats~0.base, 11 + ~#xennet_stats~0.offset, 1);call write~init~int(115, ~#xennet_stats~0.base, 12 + ~#xennet_stats~0.offset, 1);call write~init~int(117, ~#xennet_stats~0.base, 13 + ~#xennet_stats~0.offset, 1);call write~init~int(109, ~#xennet_stats~0.base, 14 + ~#xennet_stats~0.offset, 1);call write~init~int(95, ~#xennet_stats~0.base, 15 + ~#xennet_stats~0.offset, 1);call write~init~int(102, ~#xennet_stats~0.base, 16 + ~#xennet_stats~0.offset, 1);call write~init~int(105, ~#xennet_stats~0.base, 17 + ~#xennet_stats~0.offset, 1);call write~init~int(120, ~#xennet_stats~0.base, 18 + ~#xennet_stats~0.offset, 1);call write~init~int(117, ~#xennet_stats~0.base, 19 + ~#xennet_stats~0.offset, 1);call write~init~int(112, ~#xennet_stats~0.base, 20 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 21 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 22 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 23 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 24 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 25 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 26 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 27 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 28 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 29 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 30 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 31 + ~#xennet_stats~0.offset, 1);call write~init~int(48, ~#xennet_stats~0.base, 32 + ~#xennet_stats~0.offset, 2);~#xennet_ethtool_ops~0.base, ~#xennet_ethtool_ops~0.offset := 122, 0;call #Ultimate.allocInit(376, 122);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 8 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 16 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 24 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 32 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 40 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 48 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 56 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 64 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 72 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ethtool_op_get_link.base, #funAddr~ethtool_op_get_link.offset, ~#xennet_ethtool_ops~0.base, 80 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 88 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 96 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 104 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 112 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 120 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 128 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 136 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 144 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 152 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 160 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_strings.base, #funAddr~xennet_get_strings.offset, ~#xennet_ethtool_ops~0.base, 168 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 176 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_ethtool_stats.base, #funAddr~xennet_get_ethtool_stats.offset, ~#xennet_ethtool_ops~0.base, 184 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 192 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 200 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 208 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 216 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_sset_count.base, #funAddr~xennet_get_sset_count.offset, ~#xennet_ethtool_ops~0.base, 224 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 232 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 240 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 248 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 256 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 264 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 272 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 280 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 288 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 296 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 304 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 312 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 320 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 328 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 336 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 344 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 352 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 360 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 368 + ~#xennet_ethtool_ops~0.offset, 8);~#xennet_attrs~0.base, ~#xennet_attrs~0.offset := 123, 0;call #Ultimate.allocInit(129, 123);call write~init~$Pointer$(111, 0, ~#xennet_attrs~0.base, ~#xennet_attrs~0.offset, 8);call write~init~int(420, ~#xennet_attrs~0.base, 8 + ~#xennet_attrs~0.offset, 2);call write~init~int(0, ~#xennet_attrs~0.base, 10 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 11 + ~#xennet_attrs~0.offset, 8);call write~init~int(0, ~#xennet_attrs~0.base, 19 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 20 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 21 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 22 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 23 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 24 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 25 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 26 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(#funAddr~show_rxbuf_min.base, #funAddr~show_rxbuf_min.offset, ~#xennet_attrs~0.base, 27 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(#funAddr~store_rxbuf_min.base, #funAddr~store_rxbuf_min.offset, ~#xennet_attrs~0.base, 35 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(112, 0, ~#xennet_attrs~0.base, 43 + ~#xennet_attrs~0.offset, 8);call write~init~int(420, ~#xennet_attrs~0.base, 51 + ~#xennet_attrs~0.offset, 2);call write~init~int(0, ~#xennet_attrs~0.base, 53 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 54 + ~#xennet_attrs~0.offset, 8);call write~init~int(0, ~#xennet_attrs~0.base, 62 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 63 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 64 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 65 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 66 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 67 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 68 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 69 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(#funAddr~show_rxbuf_max.base, #funAddr~show_rxbuf_max.offset, ~#xennet_attrs~0.base, 70 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(#funAddr~store_rxbuf_max.base, #funAddr~store_rxbuf_max.offset, ~#xennet_attrs~0.base, 78 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(113, 0, ~#xennet_attrs~0.base, 86 + ~#xennet_attrs~0.offset, 8);call write~init~int(292, ~#xennet_attrs~0.base, 94 + ~#xennet_attrs~0.offset, 2);call write~init~int(0, ~#xennet_attrs~0.base, 96 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 97 + ~#xennet_attrs~0.offset, 8);call write~init~int(0, ~#xennet_attrs~0.base, 105 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 106 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 107 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 108 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 109 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 110 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 111 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 112 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(#funAddr~show_rxbuf_cur.base, #funAddr~show_rxbuf_cur.offset, ~#xennet_attrs~0.base, 113 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 121 + ~#xennet_attrs~0.offset, 8);~#netfront_ids~0.base, ~#netfront_ids~0.offset := 124, 0;call #Ultimate.allocInit(64, 124);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#netfront_ids~0.base);call write~unchecked~int(118, ~#netfront_ids~0.base, ~#netfront_ids~0.offset, 1);call write~unchecked~int(105, ~#netfront_ids~0.base, 1 + ~#netfront_ids~0.offset, 1);call write~unchecked~int(102, ~#netfront_ids~0.base, 2 + ~#netfront_ids~0.offset, 1);call write~unchecked~int(0, ~#netfront_ids~0.base, 3 + ~#netfront_ids~0.offset, 1);call write~unchecked~int(0, ~#netfront_ids~0.base, 32 + ~#netfront_ids~0.offset, 1);~#netfront_driver~0.base, ~#netfront_driver~0.offset := 125, 0;call #Ultimate.allocInit(185, 125);call write~init~$Pointer$(~#netfront_ids~0.base, ~#netfront_ids~0.offset, ~#netfront_driver~0.base, ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~netfront_probe.base, #funAddr~netfront_probe.offset, ~#netfront_driver~0.base, 8 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~netback_changed.base, #funAddr~netback_changed.offset, ~#netfront_driver~0.base, 16 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_remove.base, #funAddr~xennet_remove.offset, ~#netfront_driver~0.base, 24 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 32 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~netfront_resume.base, #funAddr~netfront_resume.offset, ~#netfront_driver~0.base, 40 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 48 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(~#netfront_ids~0.base, ~#netfront_ids~0.offset, ~#netfront_driver~0.base, 56 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 64 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#netfront_driver~0.base, 72 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 80 + ~#netfront_driver~0.offset, 8);call write~init~int(0, ~#netfront_driver~0.base, 88 + ~#netfront_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 89 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 97 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 105 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 113 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 121 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 129 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 137 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 145 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 153 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 161 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 169 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 177 + ~#netfront_driver~0.offset, 8);~ldv_retval_2~0 := 0;~ldvarg6~0.base, ~ldvarg6~0.offset := 0, 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_spin~0 := 0; {1627#true} is VALID [2022-02-20 21:58:00,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1099#1.base, main_#t~ret1099#1.offset, main_#t~ret1100#1.base, main_#t~ret1100#1.offset, main_#t~ret1101#1.base, main_#t~ret1101#1.offset, main_#t~ret1102#1.base, main_#t~ret1102#1.offset, main_#t~ret1103#1.base, main_#t~ret1103#1.offset, main_#t~nondet1104#1, main_#t~ret1105#1.base, main_#t~ret1105#1.offset, main_#t~nondet1106#1, main_#t~ret1107#1, main_#t~ret1108#1.base, main_#t~ret1108#1.offset, main_#t~ret1109#1.base, main_#t~ret1109#1.offset, main_#t~ret1110#1.base, main_#t~ret1110#1.offset, main_#t~memset~res1111#1.base, main_#t~memset~res1111#1.offset, main_#t~memset~res1112#1.base, main_#t~memset~res1112#1.offset, main_#t~memset~res1113#1.base, main_#t~memset~res1113#1.offset, main_#t~nondet1114#1, main_#t~switch1115#1, main_#t~nondet1116#1, main_#t~switch1117#1, main_#t~ret1118#1, main_#t~ret1119#1, main_#t~ret1120#1, main_#t~ret1121#1, main_#t~ret1122#1, main_#t~ret1123#1, main_#t~ret1124#1, main_#t~mem1125#1, main_#t~ret1126#1, main_#t~mem1127#1, main_#t~ret1128#1, main_#t~mem1129#1, main_#t~ret1130#1, main_#t~ret1131#1, main_#t~ret1132#1, main_#t~ret1133#1, main_#t~ret1134#1, main_#t~mem1135#1, main_#t~ret1136#1, main_#t~mem1137#1, main_#t~ret1138#1, main_#t~mem1139#1, main_#t~ret1140#1, main_#t~ret1141#1, main_#t~ret1142#1, main_#t~ret1143#1, main_#t~ret1144#1.base, main_#t~ret1144#1.offset, main_#t~ret1145#1.base, main_#t~ret1145#1.offset, main_#t~ret1146#1.base, main_#t~ret1146#1.offset, main_#t~ret1147#1, main_#t~nondet1148#1, main_#t~switch1149#1, main_#t~ret1150#1, main_#t~nondet1151#1, main_#t~switch1152#1, main_#t~ret1153#1, main_#t~ret1154#1, main_#t~nondet1155#1, main_#t~switch1156#1, main_#t~ret1157#1, main_#t~mem1158#1, main_#t~mem1159#1, main_#t~mem1160#1, main_#t~ret1161#1, main_#t~ret1162#1, main_#t~ret1163#1, main_#t~ret1164#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~88#1.base, main_~tmp~88#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset, main_~ldvarg4~0#1, main_~tmp___4~12#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg11~0#1.base, main_~ldvarg11~0#1.offset, main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset, main_~ldvarg13~0#1, main_~tmp___6~7#1, main_~ldvarg10~0#1, main_~tmp___7~5#1, main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset, main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset, main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset, main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset, main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset, main_~tmp___11~3#1, main_~tmp___12~3#1, main_~tmp___13~3#1, main_~tmp___14~2#1, main_~tmp___15~2#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~88#1.base, main_~tmp~88#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset;call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___4~12#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg11~0#1.base, main_~ldvarg11~0#1.offset;havoc main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset;havoc main_~ldvarg13~0#1;havoc main_~tmp___6~7#1;havoc main_~ldvarg10~0#1;havoc main_~tmp___7~5#1;havoc main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset;havoc main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset;call main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset;havoc main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset;havoc main_~tmp___11~3#1;havoc main_~tmp___12~3#1;havoc main_~tmp___13~3#1;havoc main_~tmp___14~2#1;havoc main_~tmp___15~2#1; {1627#true} is VALID [2022-02-20 21:58:00,193 INFO L272 TraceCheckUtils]: 2: Hoare triple {1627#true} call main_#t~ret1099#1.base, main_#t~ret1099#1.offset := ldv_zalloc(1); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,194 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1627#true} {1627#true} #3771#return; {1627#true} is VALID [2022-02-20 21:58:00,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {1627#true} main_~tmp~88#1.base, main_~tmp~88#1.offset := main_#t~ret1099#1.base, main_#t~ret1099#1.offset;havoc main_#t~ret1099#1.base, main_#t~ret1099#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~88#1.base, main_~tmp~88#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,195 INFO L272 TraceCheckUtils]: 8: Hoare triple {1627#true} call main_#t~ret1100#1.base, main_#t~ret1100#1.offset := ldv_zalloc(232); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,196 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1627#true} {1627#true} #3773#return; {1627#true} is VALID [2022-02-20 21:58:00,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {1627#true} main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset := main_#t~ret1100#1.base, main_#t~ret1100#1.offset;havoc main_#t~ret1100#1.base, main_#t~ret1100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,196 INFO L272 TraceCheckUtils]: 14: Hoare triple {1627#true} call main_#t~ret1101#1.base, main_#t~ret1101#1.offset := ldv_zalloc(184); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,197 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1627#true} {1627#true} #3775#return; {1627#true} is VALID [2022-02-20 21:58:00,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {1627#true} main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset := main_#t~ret1101#1.base, main_#t~ret1101#1.offset;havoc main_#t~ret1101#1.base, main_#t~ret1101#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,198 INFO L272 TraceCheckUtils]: 20: Hoare triple {1627#true} call main_#t~ret1102#1.base, main_#t~ret1102#1.offset := ldv_zalloc(1); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,199 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1627#true} {1627#true} #3777#return; {1627#true} is VALID [2022-02-20 21:58:00,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {1627#true} main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset := main_#t~ret1102#1.base, main_#t~ret1102#1.offset;havoc main_#t~ret1102#1.base, main_#t~ret1102#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,199 INFO L272 TraceCheckUtils]: 26: Hoare triple {1627#true} call main_#t~ret1103#1.base, main_#t~ret1103#1.offset := ldv_zalloc(232); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,200 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1627#true} {1627#true} #3779#return; {1627#true} is VALID [2022-02-20 21:58:00,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {1627#true} main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset := main_#t~ret1103#1.base, main_#t~ret1103#1.offset;havoc main_#t~ret1103#1.base, main_#t~ret1103#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset;assume -2147483648 <= main_#t~nondet1104#1 && main_#t~nondet1104#1 <= 2147483647;main_~tmp___4~12#1 := main_#t~nondet1104#1;havoc main_#t~nondet1104#1;main_~ldvarg4~0#1 := main_~tmp___4~12#1; {1627#true} is VALID [2022-02-20 21:58:00,201 INFO L272 TraceCheckUtils]: 32: Hoare triple {1627#true} call main_#t~ret1105#1.base, main_#t~ret1105#1.offset := ldv_zalloc(8); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,202 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1627#true} {1627#true} #3781#return; {1627#true} is VALID [2022-02-20 21:58:00,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {1627#true} main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset := main_#t~ret1105#1.base, main_#t~ret1105#1.offset;havoc main_#t~ret1105#1.base, main_#t~ret1105#1.offset;main_~ldvarg11~0#1.base, main_~ldvarg11~0#1.offset := main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset;assume -2147483648 <= main_#t~nondet1106#1 && main_#t~nondet1106#1 <= 2147483647;main_~tmp___6~7#1 := main_#t~nondet1106#1;havoc main_#t~nondet1106#1;main_~ldvarg13~0#1 := main_~tmp___6~7#1;call main_#t~ret1107#1 := __VERIFIER_nondet_u32();main_~tmp___7~5#1 := main_#t~ret1107#1;havoc main_#t~ret1107#1;main_~ldvarg10~0#1 := main_~tmp___7~5#1; {1627#true} is VALID [2022-02-20 21:58:00,202 INFO L272 TraceCheckUtils]: 38: Hoare triple {1627#true} call main_#t~ret1108#1.base, main_#t~ret1108#1.offset := ldv_zalloc(8); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,203 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1627#true} {1627#true} #3783#return; {1627#true} is VALID [2022-02-20 21:58:00,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {1627#true} main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset := main_#t~ret1108#1.base, main_#t~ret1108#1.offset;havoc main_#t~ret1108#1.base, main_#t~ret1108#1.offset;main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset := main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,204 INFO L272 TraceCheckUtils]: 44: Hoare triple {1627#true} call main_#t~ret1109#1.base, main_#t~ret1109#1.offset := ldv_zalloc(1); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,205 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1627#true} {1627#true} #3785#return; {1627#true} is VALID [2022-02-20 21:58:00,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {1627#true} main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset := main_#t~ret1109#1.base, main_#t~ret1109#1.offset;havoc main_#t~ret1109#1.base, main_#t~ret1109#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,205 INFO L272 TraceCheckUtils]: 50: Hoare triple {1627#true} call main_#t~ret1110#1.base, main_#t~ret1110#1.offset := ldv_zalloc(32); {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:00,206 INFO L290 TraceCheckUtils]: 51: Hoare triple {1722#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {1627#true} is VALID [2022-02-20 21:58:00,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {1627#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {1627#true} is VALID [2022-02-20 21:58:00,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,206 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {1627#true} {1627#true} #3787#return; {1627#true} is VALID [2022-02-20 21:58:00,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {1627#true} main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset := main_#t~ret1110#1.base, main_#t~ret1110#1.offset;havoc main_#t~ret1110#1.base, main_#t~ret1110#1.offset;main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset := main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset;assume { :begin_inline_ldv_initialize } true; {1627#true} is VALID [2022-02-20 21:58:00,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {1627#true} assume { :end_inline_ldv_initialize } true; {1627#true} is VALID [2022-02-20 21:58:00,207 INFO L272 TraceCheckUtils]: 57: Hoare triple {1627#true} call main_#t~memset~res1111#1.base, main_#t~memset~res1111#1.offset := #Ultimate.C_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 8); {1723#(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 21:58:00,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {1723#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {1627#true} is VALID [2022-02-20 21:58:00,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {1627#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {1627#true} is VALID [2022-02-20 21:58:00,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {1627#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1627#true} is VALID [2022-02-20 21:58:00,208 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1627#true} {1627#true} #3789#return; {1627#true} is VALID [2022-02-20 21:58:00,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {1627#true} havoc main_#t~memset~res1111#1.base, main_#t~memset~res1111#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,209 INFO L272 TraceCheckUtils]: 63: Hoare triple {1627#true} call main_#t~memset~res1112#1.base, main_#t~memset~res1112#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 8); {1723#(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 21:58:00,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {1723#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {1627#true} is VALID [2022-02-20 21:58:00,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {1627#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {1627#true} is VALID [2022-02-20 21:58:00,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {1627#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1627#true} is VALID [2022-02-20 21:58:00,210 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {1627#true} {1627#true} #3791#return; {1627#true} is VALID [2022-02-20 21:58:00,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {1627#true} havoc main_#t~memset~res1112#1.base, main_#t~memset~res1112#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,211 INFO L272 TraceCheckUtils]: 69: Hoare triple {1627#true} call main_#t~memset~res1113#1.base, main_#t~memset~res1113#1.offset := #Ultimate.C_memset(main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset, 0, 4); {1723#(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 21:58:00,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {1723#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {1627#true} is VALID [2022-02-20 21:58:00,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {1627#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {1627#true} is VALID [2022-02-20 21:58:00,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {1627#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1627#true} is VALID [2022-02-20 21:58:00,212 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {1627#true} {1627#true} #3793#return; {1627#true} is VALID [2022-02-20 21:58:00,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {1627#true} havoc main_#t~memset~res1113#1.base, main_#t~memset~res1113#1.offset;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {1677#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 21:58:00,213 INFO L290 TraceCheckUtils]: 75: Hoare triple {1677#(= ~ldv_state_variable_4~0 0)} assume -2147483648 <= main_#t~nondet1114#1 && main_#t~nondet1114#1 <= 2147483647;main_~tmp___11~3#1 := main_#t~nondet1114#1;havoc main_#t~nondet1114#1;main_#t~switch1115#1 := 0 == main_~tmp___11~3#1; {1677#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 21:58:00,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {1677#(= ~ldv_state_variable_4~0 0)} assume main_#t~switch1115#1; {1677#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 21:58:00,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {1677#(= ~ldv_state_variable_4~0 0)} assume 0 != ~ldv_state_variable_4~0;assume -2147483648 <= main_#t~nondet1116#1 && main_#t~nondet1116#1 <= 2147483647;main_~tmp___12~3#1 := main_#t~nondet1116#1;havoc main_#t~nondet1116#1;main_#t~switch1117#1 := 0 == main_~tmp___12~3#1; {1628#false} is VALID [2022-02-20 21:58:00,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {1628#false} assume !main_#t~switch1117#1;main_#t~switch1117#1 := main_#t~switch1117#1 || 1 == main_~tmp___12~3#1; {1628#false} is VALID [2022-02-20 21:58:00,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {1628#false} assume !main_#t~switch1117#1;main_#t~switch1117#1 := main_#t~switch1117#1 || 2 == main_~tmp___12~3#1; {1628#false} is VALID [2022-02-20 21:58:00,214 INFO L290 TraceCheckUtils]: 80: Hoare triple {1628#false} assume !main_#t~switch1117#1;main_#t~switch1117#1 := main_#t~switch1117#1 || 3 == main_~tmp___12~3#1; {1628#false} is VALID [2022-02-20 21:58:00,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {1628#false} assume !main_#t~switch1117#1;main_#t~switch1117#1 := main_#t~switch1117#1 || 4 == main_~tmp___12~3#1; {1628#false} is VALID [2022-02-20 21:58:00,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {1628#false} assume !main_#t~switch1117#1;main_#t~switch1117#1 := main_#t~switch1117#1 || 5 == main_~tmp___12~3#1; {1628#false} is VALID [2022-02-20 21:58:00,215 INFO L290 TraceCheckUtils]: 83: Hoare triple {1628#false} assume !main_#t~switch1117#1;main_#t~switch1117#1 := main_#t~switch1117#1 || 6 == main_~tmp___12~3#1; {1628#false} is VALID [2022-02-20 21:58:00,215 INFO L290 TraceCheckUtils]: 84: Hoare triple {1628#false} assume main_#t~switch1117#1; {1628#false} is VALID [2022-02-20 21:58:00,215 INFO L290 TraceCheckUtils]: 85: Hoare triple {1628#false} assume 2 == ~ldv_state_variable_4~0;assume { :begin_inline_xennet_open } true;xennet_open_#in~dev#1.base, xennet_open_#in~dev#1.offset := ~xennet_netdev_ops_group1~0.base, ~xennet_netdev_ops_group1~0.offset;havoc xennet_open_#res#1;havoc xennet_open_#t~ret365#1.base, xennet_open_#t~ret365#1.offset, xennet_open_#t~mem366#1, xennet_open_#t~mem367#1.base, xennet_open_#t~mem367#1.offset, xennet_open_#t~ret368#1, xennet_open_#t~mem369#1.base, xennet_open_#t~mem369#1.offset, xennet_open_#t~mem370#1, xennet_open_#t~mem371#1.base, xennet_open_#t~mem371#1.offset, xennet_open_#t~mem372#1, xennet_open_#t~mem373#1, xennet_open_~dev#1.base, xennet_open_~dev#1.offset, xennet_open_~np~0#1.base, xennet_open_~np~0#1.offset, xennet_open_~tmp~43#1.base, xennet_open_~tmp~43#1.offset, xennet_open_~num_queues~0#1, xennet_open_~i~5#1, xennet_open_~queue~1#1.base, xennet_open_~queue~1#1.offset, xennet_open_~tmp___0~12#1;xennet_open_~dev#1.base, xennet_open_~dev#1.offset := xennet_open_#in~dev#1.base, xennet_open_#in~dev#1.offset;havoc xennet_open_~np~0#1.base, xennet_open_~np~0#1.offset;havoc xennet_open_~tmp~43#1.base, xennet_open_~tmp~43#1.offset;havoc xennet_open_~num_queues~0#1;havoc xennet_open_~i~5#1;havoc xennet_open_~queue~1#1.base, xennet_open_~queue~1#1.offset;havoc xennet_open_~tmp___0~12#1; {1628#false} is VALID [2022-02-20 21:58:00,215 INFO L272 TraceCheckUtils]: 86: Hoare triple {1628#false} call xennet_open_#t~ret365#1.base, xennet_open_#t~ret365#1.offset := netdev_priv(xennet_open_~dev#1.base, xennet_open_~dev#1.offset); {1627#true} is VALID [2022-02-20 21:58:00,215 INFO L290 TraceCheckUtils]: 87: Hoare triple {1627#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {1627#true} is VALID [2022-02-20 21:58:00,216 INFO L290 TraceCheckUtils]: 88: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,216 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {1627#true} {1628#false} #3835#return; {1628#false} is VALID [2022-02-20 21:58:00,216 INFO L290 TraceCheckUtils]: 90: Hoare triple {1628#false} xennet_open_~tmp~43#1.base, xennet_open_~tmp~43#1.offset := xennet_open_#t~ret365#1.base, xennet_open_#t~ret365#1.offset;havoc xennet_open_#t~ret365#1.base, xennet_open_#t~ret365#1.offset;xennet_open_~np~0#1.base, xennet_open_~np~0#1.offset := xennet_open_~tmp~43#1.base, xennet_open_~tmp~43#1.offset;call xennet_open_#t~mem366#1 := read~int(xennet_open_~dev#1.base, 897 + xennet_open_~dev#1.offset, 4);xennet_open_~num_queues~0#1 := xennet_open_#t~mem366#1;havoc xennet_open_#t~mem366#1;xennet_open_~i~5#1 := 0;xennet_open_~queue~1#1.base, xennet_open_~queue~1#1.offset := 0, 0;xennet_open_~i~5#1 := 0; {1628#false} is VALID [2022-02-20 21:58:00,216 INFO L290 TraceCheckUtils]: 91: Hoare triple {1628#false} assume xennet_open_~i~5#1 % 4294967296 < xennet_open_~num_queues~0#1 % 4294967296; {1628#false} is VALID [2022-02-20 21:58:00,216 INFO L290 TraceCheckUtils]: 92: Hoare triple {1628#false} call xennet_open_#t~mem367#1.base, xennet_open_#t~mem367#1.offset := read~$Pointer$(xennet_open_~np~0#1.base, 32 + xennet_open_~np~0#1.offset, 8);xennet_open_~queue~1#1.base, xennet_open_~queue~1#1.offset := xennet_open_#t~mem367#1.base, xennet_open_#t~mem367#1.offset + 31476 * (if xennet_open_~i~5#1 % 4294967296 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then xennet_open_~i~5#1 % 4294967296 % 18446744073709551616 % 18446744073709551616 else xennet_open_~i~5#1 % 4294967296 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc xennet_open_#t~mem367#1.base, xennet_open_#t~mem367#1.offset;assume { :begin_inline_napi_enable } true;napi_enable_#in~n#1.base, napi_enable_#in~n#1.offset := xennet_open_~queue~1#1.base, 34 + xennet_open_~queue~1#1.offset;havoc napi_enable_#t~ret173#1, napi_enable_#t~ret174#1, napi_enable_~n#1.base, napi_enable_~n#1.offset, napi_enable_~tmp~28#1, napi_enable_~tmp___0~6#1;napi_enable_~n#1.base, napi_enable_~n#1.offset := napi_enable_#in~n#1.base, napi_enable_#in~n#1.offset;havoc napi_enable_~tmp~28#1;havoc napi_enable_~tmp___0~6#1; {1628#false} is VALID [2022-02-20 21:58:00,216 INFO L272 TraceCheckUtils]: 93: Hoare triple {1628#false} call napi_enable_#t~ret173#1 := constant_test_bit(0, napi_enable_~n#1.base, 16 + napi_enable_~n#1.offset); {1627#true} is VALID [2022-02-20 21:58:00,217 INFO L290 TraceCheckUtils]: 94: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,217 INFO L290 TraceCheckUtils]: 95: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,217 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {1627#true} {1628#false} #3837#return; {1628#false} is VALID [2022-02-20 21:58:00,217 INFO L290 TraceCheckUtils]: 97: Hoare triple {1628#false} assume -2147483648 <= napi_enable_#t~ret173#1 && napi_enable_#t~ret173#1 <= 2147483647;napi_enable_~tmp~28#1 := napi_enable_#t~ret173#1;havoc napi_enable_#t~ret173#1; {1628#false} is VALID [2022-02-20 21:58:00,217 INFO L272 TraceCheckUtils]: 98: Hoare triple {1628#false} call napi_enable_#t~ret174#1 := ldv__builtin_expect((if 0 == napi_enable_~tmp~28#1 then 1 else 0), 0); {1627#true} is VALID [2022-02-20 21:58:00,218 INFO L290 TraceCheckUtils]: 99: Hoare triple {1627#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {1627#true} is VALID [2022-02-20 21:58:00,218 INFO L290 TraceCheckUtils]: 100: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,218 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {1627#true} {1628#false} #3839#return; {1628#false} is VALID [2022-02-20 21:58:00,218 INFO L290 TraceCheckUtils]: 102: Hoare triple {1628#false} assume -9223372036854775808 <= napi_enable_#t~ret174#1 && napi_enable_#t~ret174#1 <= 9223372036854775807;napi_enable_~tmp___0~6#1 := napi_enable_#t~ret174#1;havoc napi_enable_#t~ret174#1; {1628#false} is VALID [2022-02-20 21:58:00,218 INFO L290 TraceCheckUtils]: 103: Hoare triple {1628#false} assume !(0 != napi_enable_~tmp___0~6#1); {1628#false} is VALID [2022-02-20 21:58:00,218 INFO L272 TraceCheckUtils]: 104: Hoare triple {1628#false} call clear_bit(0, napi_enable_~n#1.base, 16 + napi_enable_~n#1.offset); {1627#true} is VALID [2022-02-20 21:58:00,219 INFO L290 TraceCheckUtils]: 105: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset; {1627#true} is VALID [2022-02-20 21:58:00,219 INFO L290 TraceCheckUtils]: 106: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,219 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {1627#true} {1628#false} #3841#return; {1628#false} is VALID [2022-02-20 21:58:00,219 INFO L290 TraceCheckUtils]: 108: Hoare triple {1628#false} assume { :end_inline_napi_enable } true; {1628#false} is VALID [2022-02-20 21:58:00,219 INFO L272 TraceCheckUtils]: 109: Hoare triple {1628#false} call spin_lock_bh(xennet_open_~queue~1#1.base, 5492 + xennet_open_~queue~1#1.offset); {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 21:58:00,220 INFO L290 TraceCheckUtils]: 110: Hoare triple {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~lock#1.base, ~lock#1.offset := #in~lock#1.base, #in~lock#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,220 INFO L272 TraceCheckUtils]: 111: Hoare triple {1627#true} call ldv_spin_lock(); {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 21:58:00,220 INFO L290 TraceCheckUtils]: 112: Hoare triple {1724#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {1627#true} is VALID [2022-02-20 21:58:00,220 INFO L290 TraceCheckUtils]: 113: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,221 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {1627#true} {1627#true} #4131#return; {1627#true} is VALID [2022-02-20 21:58:00,221 INFO L290 TraceCheckUtils]: 115: Hoare triple {1627#true} assume { :begin_inline_ldv_spin_lock_bh_2 } true;ldv_spin_lock_bh_2_#in~lock#1.base, ldv_spin_lock_bh_2_#in~lock#1.offset := ~lock#1.base, ~lock#1.offset;havoc ldv_spin_lock_bh_2_~lock#1.base, ldv_spin_lock_bh_2_~lock#1.offset;ldv_spin_lock_bh_2_~lock#1.base, ldv_spin_lock_bh_2_~lock#1.offset := ldv_spin_lock_bh_2_#in~lock#1.base, ldv_spin_lock_bh_2_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock_bh } true;_raw_spin_lock_bh_#in~arg0#1.base, _raw_spin_lock_bh_#in~arg0#1.offset := ldv_spin_lock_bh_2_~lock#1.base, ldv_spin_lock_bh_2_~lock#1.offset;havoc _raw_spin_lock_bh_~arg0#1.base, _raw_spin_lock_bh_~arg0#1.offset;_raw_spin_lock_bh_~arg0#1.base, _raw_spin_lock_bh_~arg0#1.offset := _raw_spin_lock_bh_#in~arg0#1.base, _raw_spin_lock_bh_#in~arg0#1.offset; {1627#true} is VALID [2022-02-20 21:58:00,221 INFO L290 TraceCheckUtils]: 116: Hoare triple {1627#true} assume { :end_inline__raw_spin_lock_bh } true; {1627#true} is VALID [2022-02-20 21:58:00,221 INFO L290 TraceCheckUtils]: 117: Hoare triple {1627#true} assume { :end_inline_ldv_spin_lock_bh_2 } true; {1627#true} is VALID [2022-02-20 21:58:00,221 INFO L290 TraceCheckUtils]: 118: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,221 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {1627#true} {1628#false} #3843#return; {1628#false} is VALID [2022-02-20 21:58:00,222 INFO L272 TraceCheckUtils]: 120: Hoare triple {1628#false} call xennet_open_#t~ret368#1 := netif_carrier_ok(xennet_open_~dev#1.base, xennet_open_~dev#1.offset); {1627#true} is VALID [2022-02-20 21:58:00,222 INFO L290 TraceCheckUtils]: 121: Hoare triple {1627#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~tmp~35; {1627#true} is VALID [2022-02-20 21:58:00,222 INFO L272 TraceCheckUtils]: 122: Hoare triple {1627#true} call #t~ret203 := constant_test_bit(2, ~dev.base, 68 + ~dev.offset); {1627#true} is VALID [2022-02-20 21:58:00,222 INFO L290 TraceCheckUtils]: 123: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,222 INFO L290 TraceCheckUtils]: 124: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,223 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {1627#true} {1627#true} #3647#return; {1627#true} is VALID [2022-02-20 21:58:00,223 INFO L290 TraceCheckUtils]: 126: Hoare triple {1627#true} assume -2147483648 <= #t~ret203 && #t~ret203 <= 2147483647;~tmp~35 := #t~ret203;havoc #t~ret203;#res := (if 0 == (if 0 == ~tmp~35 then 1 else 0) then 0 else 1); {1627#true} is VALID [2022-02-20 21:58:00,223 INFO L290 TraceCheckUtils]: 127: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,223 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {1627#true} {1628#false} #3845#return; {1628#false} is VALID [2022-02-20 21:58:00,223 INFO L290 TraceCheckUtils]: 129: Hoare triple {1628#false} xennet_open_~tmp___0~12#1 := xennet_open_#t~ret368#1;havoc xennet_open_#t~ret368#1; {1628#false} is VALID [2022-02-20 21:58:00,223 INFO L290 TraceCheckUtils]: 130: Hoare triple {1628#false} assume 0 != xennet_open_~tmp___0~12#1 % 256; {1628#false} is VALID [2022-02-20 21:58:00,224 INFO L272 TraceCheckUtils]: 131: Hoare triple {1628#false} call xennet_alloc_rx_buffers(xennet_open_~queue~1#1.base, xennet_open_~queue~1#1.offset); {1628#false} is VALID [2022-02-20 21:58:00,224 INFO L290 TraceCheckUtils]: 132: Hoare triple {1628#false} ~queue#1.base, ~queue#1.offset := #in~queue#1.base, #in~queue#1.offset;havoc ~id~1#1;havoc ~skb~4#1.base, ~skb~4#1.offset;havoc ~page~0#1.base, ~page~0#1.offset;havoc ~i~4#1;havoc ~batch_target~0#1;havoc ~notify~0#1;havoc ~req_prod~0#1;havoc ~ref~1#1;havoc ~pfn~0#1;havoc ~vaddr~0#1.base, ~vaddr~0#1.offset;havoc ~req~0#1.base, ~req~0#1.offset;havoc ~tmp~42#1;havoc ~tmp___0~11#1;havoc ~tmp___1~6#1;havoc ~tmp___2~5#1;havoc ~tmp___3~4#1;havoc ~tmp___4~3#1;havoc ~tmp___5~1#1;havoc ~tmp___6~0#1;havoc ~tmp___7~0#1;havoc ~tmp___8~0#1;havoc ~tmp___9~0#1.base, ~tmp___9~0#1.offset;havoc ~tmp___10~0#1.base, ~tmp___10~0#1.offset;havoc ~tmp___11~0#1.base, ~tmp___11~0#1.offset;havoc ~tmp___12~0#1.base, ~tmp___12~0#1.offset;havoc ~tmp___13~0#1;havoc ~__old~0#1;havoc ~__new~0#1;call #t~mem316#1 := read~int(~queue#1.base, 5560 + ~queue#1.offset, 4);~req_prod~0#1 := #t~mem316#1;havoc #t~mem316#1;call #t~mem317#1.base, #t~mem317#1.offset := read~$Pointer$(~queue#1.base, 26 + ~queue#1.offset, 8);call #t~mem318#1.base, #t~mem318#1.offset := read~$Pointer$(#t~mem317#1.base, 16 + #t~mem317#1.offset, 8); {1628#false} is VALID [2022-02-20 21:58:00,224 INFO L272 TraceCheckUtils]: 133: Hoare triple {1628#false} call #t~ret319#1 := netif_carrier_ok(#t~mem318#1.base, #t~mem318#1.offset); {1627#true} is VALID [2022-02-20 21:58:00,224 INFO L290 TraceCheckUtils]: 134: Hoare triple {1627#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~tmp~35; {1627#true} is VALID [2022-02-20 21:58:00,224 INFO L272 TraceCheckUtils]: 135: Hoare triple {1627#true} call #t~ret203 := constant_test_bit(2, ~dev.base, 68 + ~dev.offset); {1627#true} is VALID [2022-02-20 21:58:00,224 INFO L290 TraceCheckUtils]: 136: Hoare triple {1627#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {1627#true} is VALID [2022-02-20 21:58:00,225 INFO L290 TraceCheckUtils]: 137: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,225 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {1627#true} {1627#true} #3647#return; {1627#true} is VALID [2022-02-20 21:58:00,225 INFO L290 TraceCheckUtils]: 139: Hoare triple {1627#true} assume -2147483648 <= #t~ret203 && #t~ret203 <= 2147483647;~tmp~35 := #t~ret203;havoc #t~ret203;#res := (if 0 == (if 0 == ~tmp~35 then 1 else 0) then 0 else 1); {1627#true} is VALID [2022-02-20 21:58:00,225 INFO L290 TraceCheckUtils]: 140: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,225 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {1627#true} {1628#false} #3711#return; {1628#false} is VALID [2022-02-20 21:58:00,226 INFO L290 TraceCheckUtils]: 142: Hoare triple {1628#false} ~tmp~42#1 := #t~ret319#1;havoc #t~mem317#1.base, #t~mem317#1.offset;havoc #t~mem318#1.base, #t~mem318#1.offset;havoc #t~ret319#1; {1628#false} is VALID [2022-02-20 21:58:00,226 INFO L290 TraceCheckUtils]: 143: Hoare triple {1628#false} assume 0 != ~tmp~42#1 % 256;~tmp___0~11#1 := 0; {1628#false} is VALID [2022-02-20 21:58:00,226 INFO L272 TraceCheckUtils]: 144: Hoare triple {1628#false} call #t~ret320#1 := ldv__builtin_expect(~tmp___0~11#1, 0); {1627#true} is VALID [2022-02-20 21:58:00,226 INFO L290 TraceCheckUtils]: 145: Hoare triple {1627#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {1627#true} is VALID [2022-02-20 21:58:00,226 INFO L290 TraceCheckUtils]: 146: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,226 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {1627#true} {1628#false} #3713#return; {1628#false} is VALID [2022-02-20 21:58:00,227 INFO L290 TraceCheckUtils]: 148: Hoare triple {1628#false} assume -9223372036854775808 <= #t~ret320#1 && #t~ret320#1 <= 9223372036854775807;~tmp___1~6#1 := #t~ret320#1;havoc #t~ret320#1; {1628#false} is VALID [2022-02-20 21:58:00,227 INFO L290 TraceCheckUtils]: 149: Hoare triple {1628#false} assume !(0 != ~tmp___1~6#1);call #t~mem322#1 := read~int(~queue#1.base, 5592 + ~queue#1.offset, 4);call #t~mem321#1 := read~int(~queue#1.base, 5564 + ~queue#1.offset, 4);~batch_target~0#1 := (if (#t~mem322#1 + (#t~mem321#1 - ~req_prod~0#1)) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem322#1 + (#t~mem321#1 - ~req_prod~0#1)) % 4294967296 % 4294967296 else (#t~mem322#1 + (#t~mem321#1 - ~req_prod~0#1)) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem322#1;havoc #t~mem321#1; {1628#false} is VALID [2022-02-20 21:58:00,227 INFO L272 TraceCheckUtils]: 150: Hoare triple {1628#false} call #t~ret323#1 := skb_queue_len(~queue#1.base, 5596 + ~queue#1.offset); {1627#true} is VALID [2022-02-20 21:58:00,227 INFO L290 TraceCheckUtils]: 151: Hoare triple {1627#true} ~list_.base, ~list_.offset := #in~list_.base, #in~list_.offset;call #t~mem130 := read~int(~list_.base, 16 + ~list_.offset, 4);#res := #t~mem130;havoc #t~mem130; {1627#true} is VALID [2022-02-20 21:58:00,227 INFO L290 TraceCheckUtils]: 152: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 21:58:00,227 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {1627#true} {1628#false} #3715#return; {1628#false} is VALID [2022-02-20 21:58:00,228 INFO L290 TraceCheckUtils]: 154: Hoare triple {1628#false} ~tmp___2~5#1 := #t~ret323#1;havoc #t~ret323#1;~i~4#1 := (if ~tmp___2~5#1 % 4294967296 % 4294967296 <= 2147483647 then ~tmp___2~5#1 % 4294967296 % 4294967296 else ~tmp___2~5#1 % 4294967296 % 4294967296 - 4294967296); {1628#false} is VALID [2022-02-20 21:58:00,228 INFO L290 TraceCheckUtils]: 155: Hoare triple {1628#false} assume ~i~4#1 < ~batch_target~0#1; {1628#false} is VALID [2022-02-20 21:58:00,228 INFO L290 TraceCheckUtils]: 156: Hoare triple {1628#false} call #t~mem324#1.base, #t~mem324#1.offset := read~$Pointer$(~queue#1.base, 26 + ~queue#1.offset, 8);call #t~mem325#1.base, #t~mem325#1.offset := read~$Pointer$(#t~mem324#1.base, 16 + #t~mem324#1.offset, 8);assume { :begin_inline_ldv___netdev_alloc_skb_35 } true;ldv___netdev_alloc_skb_35_#in~ldv_func_arg1#1.base, ldv___netdev_alloc_skb_35_#in~ldv_func_arg1#1.offset, ldv___netdev_alloc_skb_35_#in~ldv_func_arg2#1, ldv___netdev_alloc_skb_35_#in~flags#1 := #t~mem325#1.base, #t~mem325#1.offset, 256, 544;havoc ldv___netdev_alloc_skb_35_#res#1.base, ldv___netdev_alloc_skb_35_#res#1.offset;havoc ldv___netdev_alloc_skb_35_#t~ret1177#1.base, ldv___netdev_alloc_skb_35_#t~ret1177#1.offset, ldv___netdev_alloc_skb_35_~ldv_func_arg1#1.base, ldv___netdev_alloc_skb_35_~ldv_func_arg1#1.offset, ldv___netdev_alloc_skb_35_~ldv_func_arg2#1, ldv___netdev_alloc_skb_35_~flags#1, ldv___netdev_alloc_skb_35_~tmp~99#1.base, ldv___netdev_alloc_skb_35_~tmp~99#1.offset;ldv___netdev_alloc_skb_35_~ldv_func_arg1#1.base, ldv___netdev_alloc_skb_35_~ldv_func_arg1#1.offset := ldv___netdev_alloc_skb_35_#in~ldv_func_arg1#1.base, ldv___netdev_alloc_skb_35_#in~ldv_func_arg1#1.offset;ldv___netdev_alloc_skb_35_~ldv_func_arg2#1 := ldv___netdev_alloc_skb_35_#in~ldv_func_arg2#1;ldv___netdev_alloc_skb_35_~flags#1 := ldv___netdev_alloc_skb_35_#in~flags#1;havoc ldv___netdev_alloc_skb_35_~tmp~99#1.base, ldv___netdev_alloc_skb_35_~tmp~99#1.offset; {1628#false} is VALID [2022-02-20 21:58:00,228 INFO L272 TraceCheckUtils]: 157: Hoare triple {1628#false} call ldv_check_alloc_flags(ldv___netdev_alloc_skb_35_~flags#1); {1628#false} is VALID [2022-02-20 21:58:00,228 INFO L290 TraceCheckUtils]: 158: Hoare triple {1628#false} ~flags := #in~flags; {1628#false} is VALID [2022-02-20 21:58:00,229 INFO L290 TraceCheckUtils]: 159: Hoare triple {1628#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {1628#false} is VALID [2022-02-20 21:58:00,229 INFO L272 TraceCheckUtils]: 160: Hoare triple {1628#false} call ldv_error(); {1628#false} is VALID [2022-02-20 21:58:00,229 INFO L290 TraceCheckUtils]: 161: Hoare triple {1628#false} assume !false; {1628#false} is VALID [2022-02-20 21:58:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-02-20 21:58:00,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:00,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616830005] [2022-02-20 21:58:00,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616830005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:00,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:00,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:58:00,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166396089] [2022-02-20 21:58:00,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2022-02-20 21:58:00,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:00,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-02-20 21:58:00,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:00,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:58:00,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:00,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:58:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:58:00,378 INFO L87 Difference]: Start difference. First operand has 1624 states, 1148 states have (on average 1.318815331010453) internal successors, (1514), 1178 states have internal predecessors, (1514), 367 states have call successors, (367), 108 states have call predecessors, (367), 107 states have return successors, (362), 360 states have call predecessors, (362), 362 states have call successors, (362) Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-02-20 21:58:19,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:58:21,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:58:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:30,536 INFO L93 Difference]: Finished difference Result 4638 states and 6504 transitions. [2022-02-20 21:58:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 21:58:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2022-02-20 21:58:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-02-20 21:58:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6504 transitions. [2022-02-20 21:58:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-02-20 21:58:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6504 transitions. [2022-02-20 21:58:30,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 6504 transitions. [2022-02-20 21:58:36,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6504 edges. 6504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:36,538 INFO L225 Difference]: With dead ends: 4638 [2022-02-20 21:58:36,538 INFO L226 Difference]: Without dead ends: 2971 [2022-02-20 21:58:36,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:58:36,553 INFO L933 BasicCegarLoop]: 2202 mSDtfsCounter, 3985 mSDsluCounter, 3216 mSDsCounter, 0 mSdLazyCounter, 4049 mSolverCounterSat, 2790 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4209 SdHoareTripleChecker+Valid, 5418 SdHoareTripleChecker+Invalid, 6841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2790 IncrementalHoareTripleChecker+Valid, 4049 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:36,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4209 Valid, 5418 Invalid, 6841 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2790 Valid, 4049 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2022-02-20 21:58:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2022-02-20 21:58:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2587. [2022-02-20 21:58:36,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:36,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2971 states. Second operand has 2587 states, 1825 states have (on average 1.2772602739726027) internal successors, (2331), 1867 states have internal predecessors, (2331), 569 states have call successors, (569), 193 states have call predecessors, (569), 192 states have return successors, (571), 559 states have call predecessors, (571), 568 states have call successors, (571) [2022-02-20 21:58:36,744 INFO L74 IsIncluded]: Start isIncluded. First operand 2971 states. Second operand has 2587 states, 1825 states have (on average 1.2772602739726027) internal successors, (2331), 1867 states have internal predecessors, (2331), 569 states have call successors, (569), 193 states have call predecessors, (569), 192 states have return successors, (571), 559 states have call predecessors, (571), 568 states have call successors, (571) [2022-02-20 21:58:36,749 INFO L87 Difference]: Start difference. First operand 2971 states. Second operand has 2587 states, 1825 states have (on average 1.2772602739726027) internal successors, (2331), 1867 states have internal predecessors, (2331), 569 states have call successors, (569), 193 states have call predecessors, (569), 192 states have return successors, (571), 559 states have call predecessors, (571), 568 states have call successors, (571) [2022-02-20 21:58:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:37,015 INFO L93 Difference]: Finished difference Result 2971 states and 4073 transitions. [2022-02-20 21:58:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4073 transitions. [2022-02-20 21:58:37,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:37,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:37,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 2587 states, 1825 states have (on average 1.2772602739726027) internal successors, (2331), 1867 states have internal predecessors, (2331), 569 states have call successors, (569), 193 states have call predecessors, (569), 192 states have return successors, (571), 559 states have call predecessors, (571), 568 states have call successors, (571) Second operand 2971 states. [2022-02-20 21:58:37,040 INFO L87 Difference]: Start difference. First operand has 2587 states, 1825 states have (on average 1.2772602739726027) internal successors, (2331), 1867 states have internal predecessors, (2331), 569 states have call successors, (569), 193 states have call predecessors, (569), 192 states have return successors, (571), 559 states have call predecessors, (571), 568 states have call successors, (571) Second operand 2971 states. [2022-02-20 21:58:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:37,320 INFO L93 Difference]: Finished difference Result 2971 states and 4073 transitions. [2022-02-20 21:58:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4073 transitions. [2022-02-20 21:58:37,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:37,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:37,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:37,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 1825 states have (on average 1.2772602739726027) internal successors, (2331), 1867 states have internal predecessors, (2331), 569 states have call successors, (569), 193 states have call predecessors, (569), 192 states have return successors, (571), 559 states have call predecessors, (571), 568 states have call successors, (571) [2022-02-20 21:58:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3471 transitions. [2022-02-20 21:58:37,669 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3471 transitions. Word has length 162 [2022-02-20 21:58:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:37,670 INFO L470 AbstractCegarLoop]: Abstraction has 2587 states and 3471 transitions. [2022-02-20 21:58:37,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-02-20 21:58:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3471 transitions. [2022-02-20 21:58:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-20 21:58:37,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:37,679 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:37,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:58:37,679 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash 841610551, now seen corresponding path program 1 times [2022-02-20 21:58:37,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:37,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151239715] [2022-02-20 21:58:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:58:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3771#return; {18093#true} is VALID [2022-02-20 21:58:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:58:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3773#return; {18093#true} is VALID [2022-02-20 21:58:37,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:58:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3775#return; {18093#true} is VALID [2022-02-20 21:58:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:58:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3777#return; {18093#true} is VALID [2022-02-20 21:58:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:58:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3779#return; {18093#true} is VALID [2022-02-20 21:58:37,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:58:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3781#return; {18093#true} is VALID [2022-02-20 21:58:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:58:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3783#return; {18093#true} is VALID [2022-02-20 21:58:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:58:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3785#return; {18093#true} is VALID [2022-02-20 21:58:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:58:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:37,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:37,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:37,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3787#return; {18093#true} is VALID [2022-02-20 21:58:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:58:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {18169#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {18093#true} is VALID [2022-02-20 21:58:37,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {18093#true} is VALID [2022-02-20 21:58:37,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18093#true} is VALID [2022-02-20 21:58:37,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3789#return; {18093#true} is VALID [2022-02-20 21:58:37,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-20 21:58:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {18169#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {18093#true} is VALID [2022-02-20 21:58:37,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {18093#true} is VALID [2022-02-20 21:58:37,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18093#true} is VALID [2022-02-20 21:58:37,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3791#return; {18093#true} is VALID [2022-02-20 21:58:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:58:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:37,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {18169#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {18093#true} is VALID [2022-02-20 21:58:37,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {18093#true} is VALID [2022-02-20 21:58:37,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18093#true} is VALID [2022-02-20 21:58:37,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18093#true} #3793#return; {18093#true} is VALID [2022-02-20 21:58:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-02-20 21:58:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:38,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~dev.base, 489 + ~dev.offset, 8);#res.base, #res.offset := #t~mem95.base, #t~mem95.offset;havoc #t~mem95.base, #t~mem95.offset; {18093#true} is VALID [2022-02-20 21:58:38,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18093#true} {18094#false} #3401#return; {18094#false} is VALID [2022-02-20 21:58:38,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-02-20 21:58:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:38,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {18093#true} is VALID [2022-02-20 21:58:38,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18093#true} {18094#false} #3403#return; {18094#false} is VALID [2022-02-20 21:58:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-02-20 21:58:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:38,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {18093#true} is VALID [2022-02-20 21:58:38,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18093#true} {18094#false} #3407#return; {18094#false} is VALID [2022-02-20 21:58:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-02-20 21:58:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:38,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {18170#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~10.base, ~tmp~10.offset;havoc ~tmp___0~2;assume -2147483648 <= #t~nondet83 && #t~nondet83 <= 2147483647;~tmp___0~2 := #t~nondet83;havoc #t~nondet83; {18093#true} is VALID [2022-02-20 21:58:38,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 != ~tmp___0~2;#res.base, #res.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18093#true} {18094#false} #3409#return; {18094#false} is VALID [2022-02-20 21:58:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-02-20 21:58:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:58:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:38,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {18093#true} is VALID [2022-02-20 21:58:38,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18093#true} {18093#true} #4133#return; {18093#true} is VALID [2022-02-20 21:58:38,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~6; {18093#true} is VALID [2022-02-20 21:58:38,038 INFO L272 TraceCheckUtils]: 1: Hoare triple {18093#true} call #t~ret47 := ldv__builtin_expect((if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 18446744073709547520 then 1 else 0), 0); {18093#true} is VALID [2022-02-20 21:58:38,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {18093#true} is VALID [2022-02-20 21:58:38,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,039 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18093#true} {18093#true} #4133#return; {18093#true} is VALID [2022-02-20 21:58:38,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {18093#true} assume -9223372036854775808 <= #t~ret47 && #t~ret47 <= 9223372036854775807;~tmp~6 := #t~ret47;havoc #t~ret47;#res := (if 0 == (if 0 != ~tmp~6 then 1 else 0) then 0 else 1); {18093#true} is VALID [2022-02-20 21:58:38,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,039 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18093#true} {18094#false} #3411#return; {18094#false} is VALID [2022-02-20 21:58:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-02-20 21:58:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:38,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := ~ptr.base + ~ptr.offset; {18093#true} is VALID [2022-02-20 21:58:38,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18093#true} {18094#false} #3413#return; {18094#false} is VALID [2022-02-20 21:58:38,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#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(96, 2);call #Ultimate.allocInit(24, 3);call #Ultimate.allocInit(48, 4);call #Ultimate.allocInit(22, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(26, 7);call #Ultimate.allocInit(77, 8);call #Ultimate.allocInit(68, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(63, 11);call #Ultimate.allocInit(55, 12);call #Ultimate.allocInit(20, 13);call #Ultimate.allocInit(24, 14);call #Ultimate.allocInit(26, 15);call #Ultimate.allocInit(24, 16);call #Ultimate.allocInit(17, 17);call #Ultimate.allocInit(16, 18);call #Ultimate.allocInit(42, 19);call #Ultimate.allocInit(32, 20);call #Ultimate.allocInit(11, 21);call #Ultimate.allocInit(3, 22);call write~init~int(37, 22, 0, 1);call write~init~int(100, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(26, 23);call #Ultimate.allocInit(3, 24);call write~init~int(37, 24, 0, 1);call write~init~int(100, 24, 1, 1);call write~init~int(0, 24, 2, 1);call #Ultimate.allocInit(18, 25);call #Ultimate.allocInit(3, 26);call write~init~int(37, 26, 0, 1);call write~init~int(100, 26, 1, 1);call write~init~int(0, 26, 2, 1);call #Ultimate.allocInit(18, 27);call #Ultimate.allocInit(3, 28);call write~init~int(37, 28, 0, 1);call write~init~int(100, 28, 1, 1);call write~init~int(0, 28, 2, 1);call #Ultimate.allocInit(35, 29);call #Ultimate.allocInit(16, 30);call #Ultimate.allocInit(43, 31);call #Ultimate.allocInit(15, 32);call #Ultimate.allocInit(44, 33);call #Ultimate.allocInit(15, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(16, 36);call #Ultimate.allocInit(218, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(4, 40);call write~init~int(109, 40, 0, 1);call write~init~int(97, 40, 1, 1);call write~init~int(99, 40, 2, 1);call write~init~int(0, 40, 3, 1);call #Ultimate.allocInit(6, 41);call write~init~int(37, 41, 0, 1);call write~init~int(115, 41, 1, 1);call write~init~int(45, 41, 2, 1);call write~init~int(116, 41, 3, 1);call write~init~int(120, 41, 4, 1);call write~init~int(0, 41, 5, 1);call #Ultimate.allocInit(6, 42);call write~init~int(37, 42, 0, 1);call write~init~int(115, 42, 1, 1);call write~init~int(45, 42, 2, 1);call write~init~int(114, 42, 3, 1);call write~init~int(120, 42, 4, 1);call write~init~int(0, 42, 5, 1);call #Ultimate.allocInit(24, 43);call #Ultimate.allocInit(24, 44);call #Ultimate.allocInit(26, 45);call #Ultimate.allocInit(26, 46);call #Ultimate.allocInit(7, 47);call write~init~int(37, 47, 0, 1);call write~init~int(115, 47, 1, 1);call write~init~int(45, 47, 2, 1);call write~init~int(113, 47, 3, 1);call write~init~int(37, 47, 4, 1);call write~init~int(117, 47, 5, 1);call write~init~int(0, 47, 6, 1);call #Ultimate.allocInit(42, 48);call #Ultimate.allocInit(42, 49);call #Ultimate.allocInit(44, 50);call #Ultimate.allocInit(12, 51);call #Ultimate.allocInit(12, 52);call #Ultimate.allocInit(3, 53);call write~init~int(37, 53, 0, 1);call write~init~int(117, 53, 1, 1);call write~init~int(0, 53, 2, 1);call #Ultimate.allocInit(20, 54);call #Ultimate.allocInit(12, 55);call #Ultimate.allocInit(3, 56);call write~init~int(37, 56, 0, 1);call write~init~int(117, 56, 1, 1);call write~init~int(0, 56, 2, 1);call #Ultimate.allocInit(20, 57);call #Ultimate.allocInit(14, 58);call #Ultimate.allocInit(3, 59);call write~init~int(37, 59, 0, 1);call write~init~int(117, 59, 1, 1);call write~init~int(0, 59, 2, 1);call #Ultimate.allocInit(22, 60);call #Ultimate.allocInit(17, 61);call #Ultimate.allocInit(3, 62);call write~init~int(37, 62, 0, 1);call write~init~int(117, 62, 1, 1);call write~init~int(0, 62, 2, 1);call #Ultimate.allocInit(25, 63);call #Ultimate.allocInit(17, 64);call #Ultimate.allocInit(3, 65);call write~init~int(37, 65, 0, 1);call write~init~int(117, 65, 1, 1);call write~init~int(0, 65, 2, 1);call #Ultimate.allocInit(25, 66);call #Ultimate.allocInit(3, 67);call write~init~int(37, 67, 0, 1);call write~init~int(115, 67, 1, 1);call write~init~int(0, 67, 2, 1);call #Ultimate.allocInit(23, 68);call #Ultimate.allocInit(3, 69);call write~init~int(37, 69, 0, 1);call write~init~int(117, 69, 1, 1);call write~init~int(0, 69, 2, 1);call #Ultimate.allocInit(29, 70);call #Ultimate.allocInit(3, 71);call write~init~int(37, 71, 0, 1);call write~init~int(117, 71, 1, 1);call write~init~int(0, 71, 2, 1);call #Ultimate.allocInit(15, 72);call #Ultimate.allocInit(21, 73);call #Ultimate.allocInit(23, 74);call #Ultimate.allocInit(3, 75);call write~init~int(37, 75, 0, 1);call write~init~int(117, 75, 1, 1);call write~init~int(0, 75, 2, 1);call #Ultimate.allocInit(31, 76);call #Ultimate.allocInit(16, 77);call #Ultimate.allocInit(3, 78);call write~init~int(37, 78, 0, 1);call write~init~int(117, 78, 1, 1);call write~init~int(0, 78, 2, 1);call #Ultimate.allocInit(24, 79);call #Ultimate.allocInit(18, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(100, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(26, 82);call #Ultimate.allocInit(11, 83);call #Ultimate.allocInit(3, 84);call write~init~int(37, 84, 0, 1);call write~init~int(100, 84, 1, 1);call write~init~int(0, 84, 2, 1);call #Ultimate.allocInit(19, 85);call #Ultimate.allocInit(18, 86);call #Ultimate.allocInit(3, 87);call write~init~int(37, 87, 0, 1);call write~init~int(100, 87, 1, 1);call write~init~int(0, 87, 2, 1);call #Ultimate.allocInit(26, 88);call #Ultimate.allocInit(18, 89);call #Ultimate.allocInit(2, 90);call write~init~int(49, 90, 0, 1);call write~init~int(0, 90, 1, 1);call #Ultimate.allocInit(26, 91);call #Ultimate.allocInit(26, 92);call #Ultimate.allocInit(2, 93);call write~init~int(49, 93, 0, 1);call write~init~int(0, 93, 1, 1);call #Ultimate.allocInit(34, 94);call #Ultimate.allocInit(23, 95);call #Ultimate.allocInit(3, 96);call write~init~int(37, 96, 0, 1);call write~init~int(115, 96, 1, 1);call write~init~int(0, 96, 2, 1);call #Ultimate.allocInit(16, 97);call #Ultimate.allocInit(3, 98);call write~init~int(37, 98, 0, 1);call write~init~int(117, 98, 1, 1);call write~init~int(0, 98, 2, 1);call #Ultimate.allocInit(47, 99);call #Ultimate.allocInit(13, 100);call #Ultimate.allocInit(16, 101);call #Ultimate.allocInit(218, 102);call #Ultimate.allocInit(4, 103);call write~init~int(37, 103, 0, 1);call write~init~int(115, 103, 1, 1);call write~init~int(10, 103, 2, 1);call write~init~int(0, 103, 3, 1);call #Ultimate.allocInit(4, 104);call write~init~int(37, 104, 0, 1);call write~init~int(115, 104, 1, 1);call write~init~int(10, 104, 2, 1);call write~init~int(0, 104, 3, 1);call #Ultimate.allocInit(4, 105);call write~init~int(37, 105, 0, 1);call write~init~int(117, 105, 1, 1);call write~init~int(10, 105, 2, 1);call write~init~int(0, 105, 3, 1);call #Ultimate.allocInit(4, 106);call write~init~int(37, 106, 0, 1);call write~init~int(117, 106, 1, 1);call write~init~int(10, 106, 2, 1);call write~init~int(0, 106, 3, 1);call #Ultimate.allocInit(4, 107);call write~init~int(37, 107, 0, 1);call write~init~int(117, 107, 1, 1);call write~init~int(10, 107, 2, 1);call write~init~int(0, 107, 3, 1);call #Ultimate.allocInit(4, 108);call write~init~int(37, 108, 0, 1);call write~init~int(117, 108, 1, 1);call write~init~int(10, 108, 2, 1);call write~init~int(0, 108, 3, 1);call #Ultimate.allocInit(4, 109);call write~init~int(37, 109, 0, 1);call write~init~int(117, 109, 1, 1);call write~init~int(10, 109, 2, 1);call write~init~int(0, 109, 3, 1);call #Ultimate.allocInit(3, 110);call write~init~int(48, 110, 0, 1);call write~init~int(10, 110, 1, 1);call write~init~int(0, 110, 2, 1);call #Ultimate.allocInit(10, 111);call #Ultimate.allocInit(10, 112);call #Ultimate.allocInit(10, 113);call #Ultimate.allocInit(13, 114);call #Ultimate.allocInit(14, 115);call #Ultimate.allocInit(218, 116);call #Ultimate.allocInit(4, 117);call write~init~int(37, 117, 0, 1);call write~init~int(115, 117, 1, 1);call write~init~int(10, 117, 2, 1);call write~init~int(0, 117, 3, 1);call #Ultimate.allocInit(4, 118);call write~init~int(37, 118, 0, 1);call write~init~int(115, 118, 1, 1);call write~init~int(10, 118, 2, 1);call write~init~int(0, 118, 3, 1);call #Ultimate.allocInit(57, 119);~LDV_IN_INTERRUPT~0 := 1;~xennet_ethtool_ops_group0~0.base, ~xennet_ethtool_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~netfront_driver_group0~0.base, ~netfront_driver_group0~0.offset := 0, 0;~xennet_netdev_ops_group1~0.base, ~xennet_netdev_ops_group1~0.offset := 0, 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~xennet_max_queues~0 := 0;~#xennet_netdev_ops~0.base, ~#xennet_netdev_ops~0.offset := 120, 0;call #Ultimate.allocInit(480, 120);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_uninit.base, #funAddr~xennet_uninit.offset, ~#xennet_netdev_ops~0.base, 8 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_open.base, #funAddr~xennet_open.offset, ~#xennet_netdev_ops~0.base, 16 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_close.base, #funAddr~xennet_close.offset, ~#xennet_netdev_ops~0.base, 24 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_start_xmit.base, #funAddr~xennet_start_xmit.offset, ~#xennet_netdev_ops~0.base, 32 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_select_queue.base, #funAddr~xennet_select_queue.offset, ~#xennet_netdev_ops~0.base, 40 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 48 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 56 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~eth_mac_addr.base, #funAddr~eth_mac_addr.offset, ~#xennet_netdev_ops~0.base, 64 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~eth_validate_addr.base, #funAddr~eth_validate_addr.offset, ~#xennet_netdev_ops~0.base, 72 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 80 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 88 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_change_mtu.base, #funAddr~xennet_change_mtu.offset, ~#xennet_netdev_ops~0.base, 96 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 104 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 112 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_stats64.base, #funAddr~xennet_get_stats64.offset, ~#xennet_netdev_ops~0.base, 120 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 128 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 136 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 144 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_poll_controller.base, #funAddr~xennet_poll_controller.offset, ~#xennet_netdev_ops~0.base, 152 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 160 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 168 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 176 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 184 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 192 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 200 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 208 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 216 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 224 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 232 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 240 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 248 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 256 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 264 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 272 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 280 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 288 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 296 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 304 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 312 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 320 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 328 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_fix_features.base, #funAddr~xennet_fix_features.offset, ~#xennet_netdev_ops~0.base, 336 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_set_features.base, #funAddr~xennet_set_features.offset, ~#xennet_netdev_ops~0.base, 344 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 352 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 360 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 368 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 376 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 384 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 392 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 400 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 408 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 416 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 424 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 432 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 440 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 448 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 456 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 464 + ~#xennet_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_netdev_ops~0.base, 472 + ~#xennet_netdev_ops~0.offset, 8);~#xennet_stats~0.base, ~#xennet_stats~0.offset := 121, 0;call #Ultimate.allocInit(34, 121);call write~init~int(114, ~#xennet_stats~0.base, ~#xennet_stats~0.offset, 1);call write~init~int(120, ~#xennet_stats~0.base, 1 + ~#xennet_stats~0.offset, 1);call write~init~int(95, ~#xennet_stats~0.base, 2 + ~#xennet_stats~0.offset, 1);call write~init~int(103, ~#xennet_stats~0.base, 3 + ~#xennet_stats~0.offset, 1);call write~init~int(115, ~#xennet_stats~0.base, 4 + ~#xennet_stats~0.offset, 1);call write~init~int(111, ~#xennet_stats~0.base, 5 + ~#xennet_stats~0.offset, 1);call write~init~int(95, ~#xennet_stats~0.base, 6 + ~#xennet_stats~0.offset, 1);call write~init~int(99, ~#xennet_stats~0.base, 7 + ~#xennet_stats~0.offset, 1);call write~init~int(104, ~#xennet_stats~0.base, 8 + ~#xennet_stats~0.offset, 1);call write~init~int(101, ~#xennet_stats~0.base, 9 + ~#xennet_stats~0.offset, 1);call write~init~int(99, ~#xennet_stats~0.base, 10 + ~#xennet_stats~0.offset, 1);call write~init~int(107, ~#xennet_stats~0.base, 11 + ~#xennet_stats~0.offset, 1);call write~init~int(115, ~#xennet_stats~0.base, 12 + ~#xennet_stats~0.offset, 1);call write~init~int(117, ~#xennet_stats~0.base, 13 + ~#xennet_stats~0.offset, 1);call write~init~int(109, ~#xennet_stats~0.base, 14 + ~#xennet_stats~0.offset, 1);call write~init~int(95, ~#xennet_stats~0.base, 15 + ~#xennet_stats~0.offset, 1);call write~init~int(102, ~#xennet_stats~0.base, 16 + ~#xennet_stats~0.offset, 1);call write~init~int(105, ~#xennet_stats~0.base, 17 + ~#xennet_stats~0.offset, 1);call write~init~int(120, ~#xennet_stats~0.base, 18 + ~#xennet_stats~0.offset, 1);call write~init~int(117, ~#xennet_stats~0.base, 19 + ~#xennet_stats~0.offset, 1);call write~init~int(112, ~#xennet_stats~0.base, 20 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 21 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 22 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 23 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 24 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 25 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 26 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 27 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 28 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 29 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 30 + ~#xennet_stats~0.offset, 1);call write~init~int(0, ~#xennet_stats~0.base, 31 + ~#xennet_stats~0.offset, 1);call write~init~int(48, ~#xennet_stats~0.base, 32 + ~#xennet_stats~0.offset, 2);~#xennet_ethtool_ops~0.base, ~#xennet_ethtool_ops~0.offset := 122, 0;call #Ultimate.allocInit(376, 122);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 8 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 16 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 24 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 32 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 40 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 48 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 56 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 64 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 72 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ethtool_op_get_link.base, #funAddr~ethtool_op_get_link.offset, ~#xennet_ethtool_ops~0.base, 80 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 88 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 96 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 104 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 112 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 120 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 128 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 136 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 144 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 152 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 160 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_strings.base, #funAddr~xennet_get_strings.offset, ~#xennet_ethtool_ops~0.base, 168 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 176 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_ethtool_stats.base, #funAddr~xennet_get_ethtool_stats.offset, ~#xennet_ethtool_ops~0.base, 184 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 192 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 200 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 208 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 216 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_get_sset_count.base, #funAddr~xennet_get_sset_count.offset, ~#xennet_ethtool_ops~0.base, 224 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 232 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 240 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 248 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 256 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 264 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 272 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 280 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 288 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 296 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 304 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 312 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 320 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 328 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 336 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 344 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 352 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 360 + ~#xennet_ethtool_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_ethtool_ops~0.base, 368 + ~#xennet_ethtool_ops~0.offset, 8);~#xennet_attrs~0.base, ~#xennet_attrs~0.offset := 123, 0;call #Ultimate.allocInit(129, 123);call write~init~$Pointer$(111, 0, ~#xennet_attrs~0.base, ~#xennet_attrs~0.offset, 8);call write~init~int(420, ~#xennet_attrs~0.base, 8 + ~#xennet_attrs~0.offset, 2);call write~init~int(0, ~#xennet_attrs~0.base, 10 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 11 + ~#xennet_attrs~0.offset, 8);call write~init~int(0, ~#xennet_attrs~0.base, 19 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 20 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 21 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 22 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 23 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 24 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 25 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 26 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(#funAddr~show_rxbuf_min.base, #funAddr~show_rxbuf_min.offset, ~#xennet_attrs~0.base, 27 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(#funAddr~store_rxbuf_min.base, #funAddr~store_rxbuf_min.offset, ~#xennet_attrs~0.base, 35 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(112, 0, ~#xennet_attrs~0.base, 43 + ~#xennet_attrs~0.offset, 8);call write~init~int(420, ~#xennet_attrs~0.base, 51 + ~#xennet_attrs~0.offset, 2);call write~init~int(0, ~#xennet_attrs~0.base, 53 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 54 + ~#xennet_attrs~0.offset, 8);call write~init~int(0, ~#xennet_attrs~0.base, 62 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 63 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 64 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 65 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 66 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 67 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 68 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 69 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(#funAddr~show_rxbuf_max.base, #funAddr~show_rxbuf_max.offset, ~#xennet_attrs~0.base, 70 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(#funAddr~store_rxbuf_max.base, #funAddr~store_rxbuf_max.offset, ~#xennet_attrs~0.base, 78 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(113, 0, ~#xennet_attrs~0.base, 86 + ~#xennet_attrs~0.offset, 8);call write~init~int(292, ~#xennet_attrs~0.base, 94 + ~#xennet_attrs~0.offset, 2);call write~init~int(0, ~#xennet_attrs~0.base, 96 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 97 + ~#xennet_attrs~0.offset, 8);call write~init~int(0, ~#xennet_attrs~0.base, 105 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 106 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 107 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 108 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 109 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 110 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 111 + ~#xennet_attrs~0.offset, 1);call write~init~int(0, ~#xennet_attrs~0.base, 112 + ~#xennet_attrs~0.offset, 1);call write~init~$Pointer$(#funAddr~show_rxbuf_cur.base, #funAddr~show_rxbuf_cur.offset, ~#xennet_attrs~0.base, 113 + ~#xennet_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xennet_attrs~0.base, 121 + ~#xennet_attrs~0.offset, 8);~#netfront_ids~0.base, ~#netfront_ids~0.offset := 124, 0;call #Ultimate.allocInit(64, 124);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#netfront_ids~0.base);call write~unchecked~int(118, ~#netfront_ids~0.base, ~#netfront_ids~0.offset, 1);call write~unchecked~int(105, ~#netfront_ids~0.base, 1 + ~#netfront_ids~0.offset, 1);call write~unchecked~int(102, ~#netfront_ids~0.base, 2 + ~#netfront_ids~0.offset, 1);call write~unchecked~int(0, ~#netfront_ids~0.base, 3 + ~#netfront_ids~0.offset, 1);call write~unchecked~int(0, ~#netfront_ids~0.base, 32 + ~#netfront_ids~0.offset, 1);~#netfront_driver~0.base, ~#netfront_driver~0.offset := 125, 0;call #Ultimate.allocInit(185, 125);call write~init~$Pointer$(~#netfront_ids~0.base, ~#netfront_ids~0.offset, ~#netfront_driver~0.base, ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~netfront_probe.base, #funAddr~netfront_probe.offset, ~#netfront_driver~0.base, 8 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~netback_changed.base, #funAddr~netback_changed.offset, ~#netfront_driver~0.base, 16 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~xennet_remove.base, #funAddr~xennet_remove.offset, ~#netfront_driver~0.base, 24 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 32 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~netfront_resume.base, #funAddr~netfront_resume.offset, ~#netfront_driver~0.base, 40 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 48 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(~#netfront_ids~0.base, ~#netfront_ids~0.offset, ~#netfront_driver~0.base, 56 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 64 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#netfront_driver~0.base, 72 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 80 + ~#netfront_driver~0.offset, 8);call write~init~int(0, ~#netfront_driver~0.base, 88 + ~#netfront_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 89 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 97 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 105 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 113 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 121 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 129 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 137 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 145 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 153 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 161 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 169 + ~#netfront_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#netfront_driver~0.base, 177 + ~#netfront_driver~0.offset, 8);~ldv_retval_2~0 := 0;~ldvarg6~0.base, ~ldvarg6~0.offset := 0, 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_spin~0 := 0; {18093#true} is VALID [2022-02-20 21:58:38,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1099#1.base, main_#t~ret1099#1.offset, main_#t~ret1100#1.base, main_#t~ret1100#1.offset, main_#t~ret1101#1.base, main_#t~ret1101#1.offset, main_#t~ret1102#1.base, main_#t~ret1102#1.offset, main_#t~ret1103#1.base, main_#t~ret1103#1.offset, main_#t~nondet1104#1, main_#t~ret1105#1.base, main_#t~ret1105#1.offset, main_#t~nondet1106#1, main_#t~ret1107#1, main_#t~ret1108#1.base, main_#t~ret1108#1.offset, main_#t~ret1109#1.base, main_#t~ret1109#1.offset, main_#t~ret1110#1.base, main_#t~ret1110#1.offset, main_#t~memset~res1111#1.base, main_#t~memset~res1111#1.offset, main_#t~memset~res1112#1.base, main_#t~memset~res1112#1.offset, main_#t~memset~res1113#1.base, main_#t~memset~res1113#1.offset, main_#t~nondet1114#1, main_#t~switch1115#1, main_#t~nondet1116#1, main_#t~switch1117#1, main_#t~ret1118#1, main_#t~ret1119#1, main_#t~ret1120#1, main_#t~ret1121#1, main_#t~ret1122#1, main_#t~ret1123#1, main_#t~ret1124#1, main_#t~mem1125#1, main_#t~ret1126#1, main_#t~mem1127#1, main_#t~ret1128#1, main_#t~mem1129#1, main_#t~ret1130#1, main_#t~ret1131#1, main_#t~ret1132#1, main_#t~ret1133#1, main_#t~ret1134#1, main_#t~mem1135#1, main_#t~ret1136#1, main_#t~mem1137#1, main_#t~ret1138#1, main_#t~mem1139#1, main_#t~ret1140#1, main_#t~ret1141#1, main_#t~ret1142#1, main_#t~ret1143#1, main_#t~ret1144#1.base, main_#t~ret1144#1.offset, main_#t~ret1145#1.base, main_#t~ret1145#1.offset, main_#t~ret1146#1.base, main_#t~ret1146#1.offset, main_#t~ret1147#1, main_#t~nondet1148#1, main_#t~switch1149#1, main_#t~ret1150#1, main_#t~nondet1151#1, main_#t~switch1152#1, main_#t~ret1153#1, main_#t~ret1154#1, main_#t~nondet1155#1, main_#t~switch1156#1, main_#t~ret1157#1, main_#t~mem1158#1, main_#t~mem1159#1, main_#t~mem1160#1, main_#t~ret1161#1, main_#t~ret1162#1, main_#t~ret1163#1, main_#t~ret1164#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~88#1.base, main_~tmp~88#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset, main_~ldvarg4~0#1, main_~tmp___4~12#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg11~0#1.base, main_~ldvarg11~0#1.offset, main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset, main_~ldvarg13~0#1, main_~tmp___6~7#1, main_~ldvarg10~0#1, main_~tmp___7~5#1, main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset, main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset, main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset, main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset, main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset, main_~tmp___11~3#1, main_~tmp___12~3#1, main_~tmp___13~3#1, main_~tmp___14~2#1, main_~tmp___15~2#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~88#1.base, main_~tmp~88#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset;call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___4~12#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg11~0#1.base, main_~ldvarg11~0#1.offset;havoc main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset;havoc main_~ldvarg13~0#1;havoc main_~tmp___6~7#1;havoc main_~ldvarg10~0#1;havoc main_~tmp___7~5#1;havoc main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset;havoc main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset;call main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset;havoc main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset;havoc main_~tmp___11~3#1;havoc main_~tmp___12~3#1;havoc main_~tmp___13~3#1;havoc main_~tmp___14~2#1;havoc main_~tmp___15~2#1; {18093#true} is VALID [2022-02-20 21:58:38,046 INFO L272 TraceCheckUtils]: 2: Hoare triple {18093#true} call main_#t~ret1099#1.base, main_#t~ret1099#1.offset := ldv_zalloc(1); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,047 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {18093#true} {18093#true} #3771#return; {18093#true} is VALID [2022-02-20 21:58:38,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {18093#true} main_~tmp~88#1.base, main_~tmp~88#1.offset := main_#t~ret1099#1.base, main_#t~ret1099#1.offset;havoc main_#t~ret1099#1.base, main_#t~ret1099#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~88#1.base, main_~tmp~88#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,048 INFO L272 TraceCheckUtils]: 8: Hoare triple {18093#true} call main_#t~ret1100#1.base, main_#t~ret1100#1.offset := ldv_zalloc(232); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,048 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18093#true} {18093#true} #3773#return; {18093#true} is VALID [2022-02-20 21:58:38,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {18093#true} main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset := main_#t~ret1100#1.base, main_#t~ret1100#1.offset;havoc main_#t~ret1100#1.base, main_#t~ret1100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~48#1.base, main_~tmp___0~48#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,049 INFO L272 TraceCheckUtils]: 14: Hoare triple {18093#true} call main_#t~ret1101#1.base, main_#t~ret1101#1.offset := ldv_zalloc(184); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,050 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18093#true} {18093#true} #3775#return; {18093#true} is VALID [2022-02-20 21:58:38,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {18093#true} main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset := main_#t~ret1101#1.base, main_#t~ret1101#1.offset;havoc main_#t~ret1101#1.base, main_#t~ret1101#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~33#1.base, main_~tmp___1~33#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,050 INFO L272 TraceCheckUtils]: 20: Hoare triple {18093#true} call main_#t~ret1102#1.base, main_#t~ret1102#1.offset := ldv_zalloc(1); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,051 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {18093#true} {18093#true} #3777#return; {18093#true} is VALID [2022-02-20 21:58:38,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {18093#true} main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset := main_#t~ret1102#1.base, main_#t~ret1102#1.offset;havoc main_#t~ret1102#1.base, main_#t~ret1102#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~20#1.base, main_~tmp___2~20#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,051 INFO L272 TraceCheckUtils]: 26: Hoare triple {18093#true} call main_#t~ret1103#1.base, main_#t~ret1103#1.offset := ldv_zalloc(232); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,052 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18093#true} {18093#true} #3779#return; {18093#true} is VALID [2022-02-20 21:58:38,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {18093#true} main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset := main_#t~ret1103#1.base, main_#t~ret1103#1.offset;havoc main_#t~ret1103#1.base, main_#t~ret1103#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___3~17#1.base, main_~tmp___3~17#1.offset;assume -2147483648 <= main_#t~nondet1104#1 && main_#t~nondet1104#1 <= 2147483647;main_~tmp___4~12#1 := main_#t~nondet1104#1;havoc main_#t~nondet1104#1;main_~ldvarg4~0#1 := main_~tmp___4~12#1; {18093#true} is VALID [2022-02-20 21:58:38,053 INFO L272 TraceCheckUtils]: 32: Hoare triple {18093#true} call main_#t~ret1105#1.base, main_#t~ret1105#1.offset := ldv_zalloc(8); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,053 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18093#true} {18093#true} #3781#return; {18093#true} is VALID [2022-02-20 21:58:38,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {18093#true} main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset := main_#t~ret1105#1.base, main_#t~ret1105#1.offset;havoc main_#t~ret1105#1.base, main_#t~ret1105#1.offset;main_~ldvarg11~0#1.base, main_~ldvarg11~0#1.offset := main_~tmp___5~8#1.base, main_~tmp___5~8#1.offset;assume -2147483648 <= main_#t~nondet1106#1 && main_#t~nondet1106#1 <= 2147483647;main_~tmp___6~7#1 := main_#t~nondet1106#1;havoc main_#t~nondet1106#1;main_~ldvarg13~0#1 := main_~tmp___6~7#1;call main_#t~ret1107#1 := __VERIFIER_nondet_u32();main_~tmp___7~5#1 := main_#t~ret1107#1;havoc main_#t~ret1107#1;main_~ldvarg10~0#1 := main_~tmp___7~5#1; {18093#true} is VALID [2022-02-20 21:58:38,054 INFO L272 TraceCheckUtils]: 38: Hoare triple {18093#true} call main_#t~ret1108#1.base, main_#t~ret1108#1.offset := ldv_zalloc(8); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,055 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18093#true} {18093#true} #3783#return; {18093#true} is VALID [2022-02-20 21:58:38,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {18093#true} main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset := main_#t~ret1108#1.base, main_#t~ret1108#1.offset;havoc main_#t~ret1108#1.base, main_#t~ret1108#1.offset;main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset := main_~tmp___8~5#1.base, main_~tmp___8~5#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,055 INFO L272 TraceCheckUtils]: 44: Hoare triple {18093#true} call main_#t~ret1109#1.base, main_#t~ret1109#1.offset := ldv_zalloc(1); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,056 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18093#true} {18093#true} #3785#return; {18093#true} is VALID [2022-02-20 21:58:38,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {18093#true} main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset := main_#t~ret1109#1.base, main_#t~ret1109#1.offset;havoc main_#t~ret1109#1.base, main_#t~ret1109#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___9~4#1.base, main_~tmp___9~4#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,057 INFO L272 TraceCheckUtils]: 50: Hoare triple {18093#true} call main_#t~ret1110#1.base, main_#t~ret1110#1.offset := ldv_zalloc(32); {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {18168#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet86#1 && #t~nondet86#1 <= 2147483647;~tmp___0~3#1 := #t~nondet86#1;havoc #t~nondet86#1; {18093#true} is VALID [2022-02-20 21:58:38,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {18093#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,057 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {18093#true} {18093#true} #3787#return; {18093#true} is VALID [2022-02-20 21:58:38,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {18093#true} main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset := main_#t~ret1110#1.base, main_#t~ret1110#1.offset;havoc main_#t~ret1110#1.base, main_#t~ret1110#1.offset;main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset := main_~tmp___10~4#1.base, main_~tmp___10~4#1.offset;assume { :begin_inline_ldv_initialize } true; {18093#true} is VALID [2022-02-20 21:58:38,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {18093#true} assume { :end_inline_ldv_initialize } true; {18093#true} is VALID [2022-02-20 21:58:38,058 INFO L272 TraceCheckUtils]: 57: Hoare triple {18093#true} call main_#t~memset~res1111#1.base, main_#t~memset~res1111#1.offset := #Ultimate.C_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 8); {18169#(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 21:58:38,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {18169#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {18093#true} is VALID [2022-02-20 21:58:38,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {18093#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {18093#true} is VALID [2022-02-20 21:58:38,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {18093#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18093#true} is VALID [2022-02-20 21:58:38,059 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {18093#true} {18093#true} #3789#return; {18093#true} is VALID [2022-02-20 21:58:38,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {18093#true} havoc main_#t~memset~res1111#1.base, main_#t~memset~res1111#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,060 INFO L272 TraceCheckUtils]: 63: Hoare triple {18093#true} call main_#t~memset~res1112#1.base, main_#t~memset~res1112#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 8); {18169#(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 21:58:38,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {18169#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {18093#true} is VALID [2022-02-20 21:58:38,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {18093#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {18093#true} is VALID [2022-02-20 21:58:38,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {18093#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18093#true} is VALID [2022-02-20 21:58:38,060 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {18093#true} {18093#true} #3791#return; {18093#true} is VALID [2022-02-20 21:58:38,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {18093#true} havoc main_#t~memset~res1112#1.base, main_#t~memset~res1112#1.offset; {18093#true} is VALID [2022-02-20 21:58:38,061 INFO L272 TraceCheckUtils]: 69: Hoare triple {18093#true} call main_#t~memset~res1113#1.base, main_#t~memset~res1113#1.offset := #Ultimate.C_memset(main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset, 0, 4); {18169#(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 21:58:38,061 INFO L290 TraceCheckUtils]: 70: Hoare triple {18169#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1245 := 0; {18093#true} is VALID [2022-02-20 21:58:38,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {18093#true} assume !(#t~loopctr1245 % 18446744073709551616 < #amount % 18446744073709551616); {18093#true} is VALID [2022-02-20 21:58:38,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {18093#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18093#true} is VALID [2022-02-20 21:58:38,062 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18093#true} {18093#true} #3793#return; {18093#true} is VALID [2022-02-20 21:58:38,062 INFO L290 TraceCheckUtils]: 74: Hoare triple {18093#true} havoc main_#t~memset~res1113#1.base, main_#t~memset~res1113#1.offset;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {18143#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:58:38,062 INFO L290 TraceCheckUtils]: 75: Hoare triple {18143#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet1114#1 && main_#t~nondet1114#1 <= 2147483647;main_~tmp___11~3#1 := main_#t~nondet1114#1;havoc main_#t~nondet1114#1;main_#t~switch1115#1 := 0 == main_~tmp___11~3#1; {18143#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:58:38,063 INFO L290 TraceCheckUtils]: 76: Hoare triple {18143#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch1115#1;main_#t~switch1115#1 := main_#t~switch1115#1 || 1 == main_~tmp___11~3#1; {18143#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:58:38,063 INFO L290 TraceCheckUtils]: 77: Hoare triple {18143#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch1115#1;main_#t~switch1115#1 := main_#t~switch1115#1 || 2 == main_~tmp___11~3#1; {18143#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:58:38,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {18143#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch1115#1;main_#t~switch1115#1 := main_#t~switch1115#1 || 3 == main_~tmp___11~3#1; {18143#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:58:38,064 INFO L290 TraceCheckUtils]: 79: Hoare triple {18143#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch1115#1;main_#t~switch1115#1 := main_#t~switch1115#1 || 4 == main_~tmp___11~3#1; {18143#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:58:38,064 INFO L290 TraceCheckUtils]: 80: Hoare triple {18143#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch1115#1; {18143#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:58:38,064 INFO L290 TraceCheckUtils]: 81: Hoare triple {18143#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet1155#1 && main_#t~nondet1155#1 <= 2147483647;main_~tmp___15~2#1 := main_#t~nondet1155#1;havoc main_#t~nondet1155#1;main_#t~switch1156#1 := 0 == main_~tmp___15~2#1; {18094#false} is VALID [2022-02-20 21:58:38,065 INFO L290 TraceCheckUtils]: 82: Hoare triple {18094#false} assume !main_#t~switch1156#1;main_#t~switch1156#1 := main_#t~switch1156#1 || 1 == main_~tmp___15~2#1; {18094#false} is VALID [2022-02-20 21:58:38,065 INFO L290 TraceCheckUtils]: 83: Hoare triple {18094#false} assume main_#t~switch1156#1; {18094#false} is VALID [2022-02-20 21:58:38,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {18094#false} assume !(1 == ~ldv_state_variable_2~0); {18094#false} is VALID [2022-02-20 21:58:38,065 INFO L290 TraceCheckUtils]: 85: Hoare triple {18094#false} assume !(3 == ~ldv_state_variable_2~0); {18094#false} is VALID [2022-02-20 21:58:38,065 INFO L290 TraceCheckUtils]: 86: Hoare triple {18094#false} assume 2 == ~ldv_state_variable_2~0;call main_#t~mem1160#1 := read~int(main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset, 4); {18094#false} is VALID [2022-02-20 21:58:38,065 INFO L272 TraceCheckUtils]: 87: Hoare triple {18094#false} call netback_changed(~netfront_driver_group0~0.base, ~netfront_driver_group0~0.offset, main_#t~mem1160#1); {18094#false} is VALID [2022-02-20 21:58:38,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {18094#false} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~backend_state#1 := #in~backend_state#1;havoc ~np~9#1.base, ~np~9#1.offset;havoc ~tmp~76#1.base, ~tmp~76#1.offset;havoc ~netdev~2#1.base, ~netdev~2#1.offset;call ~#descriptor~1#1.base, ~#descriptor~1#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp___0~39#1.base, ~tmp___0~39#1.offset;havoc ~tmp___1~26#1;havoc ~tmp___2~19#1; {18094#false} is VALID [2022-02-20 21:58:38,066 INFO L272 TraceCheckUtils]: 89: Hoare triple {18094#false} call #t~ret1014#1.base, #t~ret1014#1.offset := dev_get_drvdata(~dev#1.base, 60 + ~dev#1.offset); {18093#true} is VALID [2022-02-20 21:58:38,066 INFO L290 TraceCheckUtils]: 90: Hoare triple {18093#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~dev.base, 489 + ~dev.offset, 8);#res.base, #res.offset := #t~mem95.base, #t~mem95.offset;havoc #t~mem95.base, #t~mem95.offset; {18093#true} is VALID [2022-02-20 21:58:38,066 INFO L290 TraceCheckUtils]: 91: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,066 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18093#true} {18094#false} #3401#return; {18094#false} is VALID [2022-02-20 21:58:38,066 INFO L290 TraceCheckUtils]: 93: Hoare triple {18094#false} ~tmp~76#1.base, ~tmp~76#1.offset := #t~ret1014#1.base, #t~ret1014#1.offset;havoc #t~ret1014#1.base, #t~ret1014#1.offset;~np~9#1.base, ~np~9#1.offset := ~tmp~76#1.base, ~tmp~76#1.offset;call #t~mem1015#1.base, #t~mem1015#1.offset := read~$Pointer$(~np~9#1.base, 16 + ~np~9#1.offset, 8);~netdev~2#1.base, ~netdev~2#1.offset := #t~mem1015#1.base, #t~mem1015#1.offset;havoc #t~mem1015#1.base, #t~mem1015#1.offset;call write~$Pointer$(100, 0, ~#descriptor~1#1.base, ~#descriptor~1#1.offset, 8);call write~$Pointer$(101, 0, ~#descriptor~1#1.base, 8 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(102, 0, ~#descriptor~1#1.base, 16 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(103, 0, ~#descriptor~1#1.base, 24 + ~#descriptor~1#1.offset, 8);call write~int(2111, ~#descriptor~1#1.base, 32 + ~#descriptor~1#1.offset, 4);call write~int(0, ~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1);call #t~mem1016#1 := read~int(~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1); {18094#false} is VALID [2022-02-20 21:58:38,066 INFO L272 TraceCheckUtils]: 94: Hoare triple {18094#false} call #t~ret1017#1 := ldv__builtin_expect(#t~mem1016#1 % 256, 0); {18093#true} is VALID [2022-02-20 21:58:38,067 INFO L290 TraceCheckUtils]: 95: Hoare triple {18093#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {18093#true} is VALID [2022-02-20 21:58:38,067 INFO L290 TraceCheckUtils]: 96: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,067 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {18093#true} {18094#false} #3403#return; {18094#false} is VALID [2022-02-20 21:58:38,067 INFO L290 TraceCheckUtils]: 98: Hoare triple {18094#false} assume -9223372036854775808 <= #t~ret1017#1 && #t~ret1017#1 <= 9223372036854775807;~tmp___1~26#1 := #t~ret1017#1;havoc #t~mem1016#1;havoc #t~ret1017#1; {18094#false} is VALID [2022-02-20 21:58:38,067 INFO L290 TraceCheckUtils]: 99: Hoare triple {18094#false} assume !(0 != ~tmp___1~26#1); {18094#false} is VALID [2022-02-20 21:58:38,067 INFO L290 TraceCheckUtils]: 100: Hoare triple {18094#false} #t~switch1020#1 := 1 == ~backend_state#1; {18094#false} is VALID [2022-02-20 21:58:38,067 INFO L290 TraceCheckUtils]: 101: Hoare triple {18094#false} assume #t~switch1020#1; {18094#false} is VALID [2022-02-20 21:58:38,068 INFO L290 TraceCheckUtils]: 102: Hoare triple {18094#false} #t~switch1020#1 := #t~switch1020#1 || 3 == ~backend_state#1; {18094#false} is VALID [2022-02-20 21:58:38,068 INFO L290 TraceCheckUtils]: 103: Hoare triple {18094#false} assume #t~switch1020#1; {18094#false} is VALID [2022-02-20 21:58:38,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {18094#false} #t~switch1020#1 := #t~switch1020#1 || 7 == ~backend_state#1; {18094#false} is VALID [2022-02-20 21:58:38,068 INFO L290 TraceCheckUtils]: 105: Hoare triple {18094#false} assume #t~switch1020#1; {18094#false} is VALID [2022-02-20 21:58:38,068 INFO L290 TraceCheckUtils]: 106: Hoare triple {18094#false} #t~switch1020#1 := #t~switch1020#1 || 8 == ~backend_state#1; {18094#false} is VALID [2022-02-20 21:58:38,068 INFO L290 TraceCheckUtils]: 107: Hoare triple {18094#false} assume #t~switch1020#1; {18094#false} is VALID [2022-02-20 21:58:38,068 INFO L290 TraceCheckUtils]: 108: Hoare triple {18094#false} #t~switch1020#1 := #t~switch1020#1 || 0 == ~backend_state#1; {18094#false} is VALID [2022-02-20 21:58:38,069 INFO L290 TraceCheckUtils]: 109: Hoare triple {18094#false} assume !#t~switch1020#1;#t~switch1020#1 := #t~switch1020#1 || 2 == ~backend_state#1; {18094#false} is VALID [2022-02-20 21:58:38,069 INFO L290 TraceCheckUtils]: 110: Hoare triple {18094#false} assume #t~switch1020#1;call #t~mem1021#1 := read~int(~dev#1.base, 1405 + ~dev#1.offset, 4); {18094#false} is VALID [2022-02-20 21:58:38,069 INFO L290 TraceCheckUtils]: 111: Hoare triple {18094#false} assume !(1 != #t~mem1021#1 % 4294967296);havoc #t~mem1021#1;assume { :begin_inline_xennet_connect } true;xennet_connect_#in~dev#1.base, xennet_connect_#in~dev#1.offset := ~netdev~2#1.base, ~netdev~2#1.offset;havoc xennet_connect_#res#1;havoc xennet_connect_#t~ret986#1.base, xennet_connect_#t~ret986#1.offset, xennet_connect_#t~nondet987#1, xennet_connect_#t~mem988#1, xennet_connect_#t~mem989#1.base, xennet_connect_#t~mem989#1.offset, xennet_connect_#t~mem990#1.base, xennet_connect_#t~mem990#1.offset, xennet_connect_#t~mem991#1, xennet_connect_#t~nondet992#1, xennet_connect_#t~mem993#1.base, xennet_connect_#t~mem993#1.offset, xennet_connect_#t~ret994#1, xennet_connect_#t~mem995#1, xennet_connect_#t~mem996#1.base, xennet_connect_#t~mem996#1.offset, xennet_connect_#t~mem997#1.base, xennet_connect_#t~mem997#1.offset, xennet_connect_#t~ret998#1.base, xennet_connect_#t~ret998#1.offset, xennet_connect_#t~ret999#1, xennet_connect_#t~mem1001#1.base, xennet_connect_#t~mem1001#1.offset, xennet_connect_#t~mem1000#1, xennet_connect_#t~ret1002#1.base, xennet_connect_#t~ret1002#1.offset, xennet_connect_#t~ret1003#1.base, xennet_connect_#t~ret1003#1.offset, xennet_connect_#t~ret1004#1, xennet_connect_#t~mem1005#1.base, xennet_connect_#t~mem1005#1.offset, xennet_connect_#t~mem1006#1.base, xennet_connect_#t~mem1006#1.offset, xennet_connect_#t~mem1007#1, xennet_connect_#t~mem1008#1.base, xennet_connect_#t~mem1008#1.offset, xennet_connect_#t~mem1009#1.base, xennet_connect_#t~mem1009#1.offset, xennet_connect_#t~mem1010#1, xennet_connect_#t~mem1011#1, xennet_connect_#t~mem1012#1, xennet_connect_#t~mem1013#1, xennet_connect_~dev#1.base, xennet_connect_~dev#1.offset, xennet_connect_~np~8#1.base, xennet_connect_~np~8#1.offset, xennet_connect_~tmp~75#1.base, xennet_connect_~tmp~75#1.offset, xennet_connect_~num_queues~8#1, xennet_connect_~i~19#1, xennet_connect_~requeue_idx~0#1, xennet_connect_~err~11#1, xennet_connect_~skb~12#1.base, xennet_connect_~skb~12#1.offset, xennet_connect_~ref~7#1, xennet_connect_~req~1#1.base, xennet_connect_~req~1#1.offset, xennet_connect_~#feature_rx_copy~0#1.base, xennet_connect_~#feature_rx_copy~0#1.offset, xennet_connect_~j~0#1, xennet_connect_~queue~10#1.base, xennet_connect_~queue~10#1.offset, xennet_connect_~#__constr_expr_0~3#1.base, xennet_connect_~#__constr_expr_0~3#1.offset, xennet_connect_~frag~2#1.base, xennet_connect_~frag~2#1.offset, xennet_connect_~page~3#1.base, xennet_connect_~page~3#1.offset, xennet_connect_~tmp___0~38#1.base, xennet_connect_~tmp___0~38#1.offset, xennet_connect_~tmp___1~25#1, xennet_connect_~tmp___2~18#1.base, xennet_connect_~tmp___2~18#1.offset, xennet_connect_~tmp___3~16#1.base, xennet_connect_~tmp___3~16#1.offset, xennet_connect_~tmp___4~11#1;xennet_connect_~dev#1.base, xennet_connect_~dev#1.offset := xennet_connect_#in~dev#1.base, xennet_connect_#in~dev#1.offset;havoc xennet_connect_~np~8#1.base, xennet_connect_~np~8#1.offset;havoc xennet_connect_~tmp~75#1.base, xennet_connect_~tmp~75#1.offset;havoc xennet_connect_~num_queues~8#1;havoc xennet_connect_~i~19#1;havoc xennet_connect_~requeue_idx~0#1;havoc xennet_connect_~err~11#1;havoc xennet_connect_~skb~12#1.base, xennet_connect_~skb~12#1.offset;havoc xennet_connect_~ref~7#1;havoc xennet_connect_~req~1#1.base, xennet_connect_~req~1#1.offset;call xennet_connect_~#feature_rx_copy~0#1.base, xennet_connect_~#feature_rx_copy~0#1.offset := #Ultimate.allocOnStack(4);havoc xennet_connect_~j~0#1;havoc xennet_connect_~queue~10#1.base, xennet_connect_~queue~10#1.offset;call xennet_connect_~#__constr_expr_0~3#1.base, xennet_connect_~#__constr_expr_0~3#1.offset := #Ultimate.allocOnStack(4);havoc xennet_connect_~frag~2#1.base, xennet_connect_~frag~2#1.offset;havoc xennet_connect_~page~3#1.base, xennet_connect_~page~3#1.offset;havoc xennet_connect_~tmp___0~38#1.base, xennet_connect_~tmp___0~38#1.offset;havoc xennet_connect_~tmp___1~25#1;havoc xennet_connect_~tmp___2~18#1.base, xennet_connect_~tmp___2~18#1.offset;havoc xennet_connect_~tmp___3~16#1.base, xennet_connect_~tmp___3~16#1.offset;havoc xennet_connect_~tmp___4~11#1; {18094#false} is VALID [2022-02-20 21:58:38,069 INFO L272 TraceCheckUtils]: 112: Hoare triple {18094#false} call xennet_connect_#t~ret986#1.base, xennet_connect_#t~ret986#1.offset := netdev_priv(xennet_connect_~dev#1.base, xennet_connect_~dev#1.offset); {18093#true} is VALID [2022-02-20 21:58:38,069 INFO L290 TraceCheckUtils]: 113: Hoare triple {18093#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {18093#true} is VALID [2022-02-20 21:58:38,069 INFO L290 TraceCheckUtils]: 114: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,070 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18093#true} {18094#false} #3407#return; {18094#false} is VALID [2022-02-20 21:58:38,070 INFO L290 TraceCheckUtils]: 116: Hoare triple {18094#false} xennet_connect_~tmp~75#1.base, xennet_connect_~tmp~75#1.offset := xennet_connect_#t~ret986#1.base, xennet_connect_#t~ret986#1.offset;havoc xennet_connect_#t~ret986#1.base, xennet_connect_#t~ret986#1.offset;xennet_connect_~np~8#1.base, xennet_connect_~np~8#1.offset := xennet_connect_~tmp~75#1.base, xennet_connect_~tmp~75#1.offset;xennet_connect_~num_queues~8#1 := 0;xennet_connect_~j~0#1 := 0;xennet_connect_~queue~10#1.base, xennet_connect_~queue~10#1.offset := 0, 0;call write~int(0, xennet_connect_~#__constr_expr_0~3#1.base, xennet_connect_~#__constr_expr_0~3#1.offset, 4);havoc xennet_connect_#t~nondet987#1;call xennet_connect_#t~mem988#1 := read~int(xennet_connect_~#__constr_expr_0~3#1.base, xennet_connect_~#__constr_expr_0~3#1.offset, 4);call xennet_connect_#t~mem989#1.base, xennet_connect_#t~mem989#1.offset := read~$Pointer$(xennet_connect_~np~8#1.base, 24 + xennet_connect_~np~8#1.offset, 8);call xennet_connect_#t~mem990#1.base, xennet_connect_#t~mem990#1.offset := read~$Pointer$(xennet_connect_#t~mem989#1.base, 16 + xennet_connect_#t~mem989#1.offset, 8);xennet_connect_~err~11#1 := xennet_connect_#t~nondet987#1;havoc xennet_connect_#t~mem988#1;havoc xennet_connect_#t~mem989#1.base, xennet_connect_#t~mem989#1.offset;havoc xennet_connect_#t~mem990#1.base, xennet_connect_#t~mem990#1.offset; {18094#false} is VALID [2022-02-20 21:58:38,070 INFO L290 TraceCheckUtils]: 117: Hoare triple {18094#false} assume 1 != xennet_connect_~err~11#1;call write~int(0, xennet_connect_~#feature_rx_copy~0#1.base, xennet_connect_~#feature_rx_copy~0#1.offset, 4); {18094#false} is VALID [2022-02-20 21:58:38,070 INFO L290 TraceCheckUtils]: 118: Hoare triple {18094#false} call xennet_connect_#t~mem991#1 := read~int(xennet_connect_~#feature_rx_copy~0#1.base, xennet_connect_~#feature_rx_copy~0#1.offset, 4); {18094#false} is VALID [2022-02-20 21:58:38,070 INFO L290 TraceCheckUtils]: 119: Hoare triple {18094#false} assume !(0 == xennet_connect_#t~mem991#1 % 4294967296);havoc xennet_connect_#t~mem991#1;call xennet_connect_#t~mem993#1.base, xennet_connect_#t~mem993#1.offset := read~$Pointer$(xennet_connect_~np~8#1.base, 24 + xennet_connect_~np~8#1.offset, 8);assume { :begin_inline_talk_to_netback } true;talk_to_netback_#in~dev#1.base, talk_to_netback_#in~dev#1.offset, talk_to_netback_#in~info#1.base, talk_to_netback_#in~info#1.offset := xennet_connect_#t~mem993#1.base, xennet_connect_#t~mem993#1.offset, xennet_connect_~np~8#1.base, xennet_connect_~np~8#1.offset;havoc talk_to_netback_#res#1;havoc talk_to_netback_#t~mem926#1.base, talk_to_netback_#t~mem926#1.offset, talk_to_netback_#t~nondet927#1, talk_to_netback_#t~mem928#1, talk_to_netback_#t~mem929#1.base, talk_to_netback_#t~mem929#1.offset, talk_to_netback_#t~mem930#1.base, talk_to_netback_#t~mem930#1.offset, talk_to_netback_#t~mem931#1, talk_to_netback_#t~ite932#1, talk_to_netback_#t~nondet933#1, talk_to_netback_#t~mem934#1, talk_to_netback_#t~mem935#1.base, talk_to_netback_#t~mem935#1.offset, talk_to_netback_#t~mem936#1.base, talk_to_netback_#t~mem936#1.offset, talk_to_netback_#t~mem937#1.base, talk_to_netback_#t~mem937#1.offset, talk_to_netback_#t~mem938#1.base, talk_to_netback_#t~mem938#1.offset, talk_to_netback_#t~ret939#1, talk_to_netback_#t~mem940#1.base, talk_to_netback_#t~mem940#1.offset, talk_to_netback_#t~ret941#1.base, talk_to_netback_#t~ret941#1.offset, talk_to_netback_#t~mem942#1.base, talk_to_netback_#t~mem942#1.offset, talk_to_netback_#t~mem943#1.base, talk_to_netback_#t~mem943#1.offset, talk_to_netback_#t~ret944#1, talk_to_netback_#t~mem945#1.base, talk_to_netback_#t~mem945#1.offset, talk_to_netback_#t~ret946#1, talk_to_netback_#t~mem947#1.base, talk_to_netback_#t~mem947#1.offset, talk_to_netback_#t~ret948#1, talk_to_netback_#t~mem949#1, talk_to_netback_#t~ret950#1, talk_to_netback_#t~mem951#1.base, talk_to_netback_#t~mem951#1.offset, talk_to_netback_#t~ret952#1, talk_to_netback_#t~ret953#1, talk_to_netback_#t~mem954#1.base, talk_to_netback_#t~mem954#1.offset, talk_to_netback_#t~ret955#1, talk_to_netback_#t~nondet956#1, talk_to_netback_#t~mem957#1, talk_to_netback_#t~mem958#1.base, talk_to_netback_#t~mem958#1.offset, talk_to_netback_#t~mem959#1.base, talk_to_netback_#t~mem959#1.offset, talk_to_netback_#t~ret960#1, talk_to_netback_#t~nondet961#1, talk_to_netback_#t~mem962#1, talk_to_netback_#t~mem963#1.base, talk_to_netback_#t~mem963#1.offset, talk_to_netback_#t~nondet964#1, talk_to_netback_#t~mem965#1, talk_to_netback_#t~mem966#1.base, talk_to_netback_#t~mem966#1.offset, talk_to_netback_#t~nondet967#1, talk_to_netback_#t~mem968#1, talk_to_netback_#t~mem969#1.base, talk_to_netback_#t~mem969#1.offset, talk_to_netback_#t~nondet970#1, talk_to_netback_#t~mem971#1, talk_to_netback_#t~mem972#1.base, talk_to_netback_#t~mem972#1.offset, talk_to_netback_#t~mem973#1, talk_to_netback_#t~mem974#1.base, talk_to_netback_#t~mem974#1.offset, talk_to_netback_#t~ret975#1, talk_to_netback_#t~mem976#1, talk_to_netback_#t~mem977#1.base, talk_to_netback_#t~mem977#1.offset, talk_to_netback_#t~ret978#1, talk_to_netback_#t~mem979#1, talk_to_netback_#t~ret980#1, talk_to_netback_#t~mem981#1, talk_to_netback_#t~ret982#1, talk_to_netback_#t~mem983#1.base, talk_to_netback_#t~mem983#1.offset, talk_to_netback_#t~mem984#1.base, talk_to_netback_#t~mem984#1.offset, talk_to_netback_#t~ret985#1, talk_to_netback_~dev#1.base, talk_to_netback_~dev#1.offset, talk_to_netback_~info#1.base, talk_to_netback_~info#1.offset, talk_to_netback_~message~1#1.base, talk_to_netback_~message~1#1.offset, talk_to_netback_~#xbt~0#1.base, talk_to_netback_~#xbt~0#1.offset, talk_to_netback_~err~10#1, talk_to_netback_~#feature_split_evtchn~0#1.base, talk_to_netback_~#feature_split_evtchn~0#1.offset, talk_to_netback_~i~18#1, talk_to_netback_~#max_queues~0#1.base, talk_to_netback_~#max_queues~0#1.offset, talk_to_netback_~queue~9#1.base, talk_to_netback_~queue~9#1.offset, talk_to_netback_~num_queues~7#1, talk_to_netback_~#__constr_expr_0~2#1.base, talk_to_netback_~#__constr_expr_0~2#1.offset, talk_to_netback_~_min1~0#1, talk_to_netback_~_min2~0#1, talk_to_netback_~#__constr_expr_1~1#1.base, talk_to_netback_~#__constr_expr_1~1#1.offset, talk_to_netback_~tmp~74#1.base, talk_to_netback_~tmp~74#1.offset;talk_to_netback_~dev#1.base, talk_to_netback_~dev#1.offset := talk_to_netback_#in~dev#1.base, talk_to_netback_#in~dev#1.offset;talk_to_netback_~info#1.base, talk_to_netback_~info#1.offset := talk_to_netback_#in~info#1.base, talk_to_netback_#in~info#1.offset;havoc talk_to_netback_~message~1#1.base, talk_to_netback_~message~1#1.offset;call talk_to_netback_~#xbt~0#1.base, talk_to_netback_~#xbt~0#1.offset := #Ultimate.allocOnStack(4);havoc talk_to_netback_~err~10#1;call talk_to_netback_~#feature_split_evtchn~0#1.base, talk_to_netback_~#feature_split_evtchn~0#1.offset := #Ultimate.allocOnStack(4);havoc talk_to_netback_~i~18#1;call talk_to_netback_~#max_queues~0#1.base, talk_to_netback_~#max_queues~0#1.offset := #Ultimate.allocOnStack(4);havoc talk_to_netback_~queue~9#1.base, talk_to_netback_~queue~9#1.offset;havoc talk_to_netback_~num_queues~7#1;call talk_to_netback_~#__constr_expr_0~2#1.base, talk_to_netback_~#__constr_expr_0~2#1.offset := #Ultimate.allocOnStack(4);havoc talk_to_netback_~_min1~0#1;havoc talk_to_netback_~_min2~0#1;call talk_to_netback_~#__constr_expr_1~1#1.base, talk_to_netback_~#__constr_expr_1~1#1.offset := #Ultimate.allocOnStack(4);havoc talk_to_netback_~tmp~74#1.base, talk_to_netback_~tmp~74#1.offset;talk_to_netback_~i~18#1 := 0;call write~int(0, talk_to_netback_~#max_queues~0#1.base, talk_to_netback_~#max_queues~0#1.offset, 4);talk_to_netback_~queue~9#1.base, talk_to_netback_~queue~9#1.offset := 0, 0;talk_to_netback_~num_queues~7#1 := 1;call talk_to_netback_#t~mem926#1.base, talk_to_netback_#t~mem926#1.offset := read~$Pointer$(talk_to_netback_~info#1.base, 16 + talk_to_netback_~info#1.offset, 8);call write~int(0, talk_to_netback_#t~mem926#1.base, 64 + talk_to_netback_#t~mem926#1.offset, 4);havoc talk_to_netback_#t~mem926#1.base, talk_to_netback_#t~mem926#1.offset;call write~int(0, talk_to_netback_~#__constr_expr_0~2#1.base, talk_to_netback_~#__constr_expr_0~2#1.offset, 4);havoc talk_to_netback_#t~nondet927#1;call talk_to_netback_#t~mem928#1 := read~int(talk_to_netback_~#__constr_expr_0~2#1.base, talk_to_netback_~#__constr_expr_0~2#1.offset, 4);call talk_to_netback_#t~mem929#1.base, talk_to_netback_#t~mem929#1.offset := read~$Pointer$(talk_to_netback_~info#1.base, 24 + talk_to_netback_~info#1.offset, 8);call talk_to_netback_#t~mem930#1.base, talk_to_netback_#t~mem930#1.offset := read~$Pointer$(talk_to_netback_#t~mem929#1.base, 16 + talk_to_netback_#t~mem929#1.offset, 8);talk_to_netback_~err~10#1 := talk_to_netback_#t~nondet927#1;havoc talk_to_netback_#t~mem928#1;havoc talk_to_netback_#t~mem929#1.base, talk_to_netback_#t~mem929#1.offset;havoc talk_to_netback_#t~mem930#1.base, talk_to_netback_#t~mem930#1.offset; {18094#false} is VALID [2022-02-20 21:58:38,070 INFO L290 TraceCheckUtils]: 120: Hoare triple {18094#false} assume talk_to_netback_~err~10#1 < 0;call write~int(1, talk_to_netback_~#max_queues~0#1.base, talk_to_netback_~#max_queues~0#1.offset, 4); {18094#false} is VALID [2022-02-20 21:58:38,071 INFO L290 TraceCheckUtils]: 121: Hoare triple {18094#false} call talk_to_netback_#t~mem931#1 := read~int(talk_to_netback_~#max_queues~0#1.base, talk_to_netback_~#max_queues~0#1.offset, 4);talk_to_netback_~_min1~0#1 := talk_to_netback_#t~mem931#1;havoc talk_to_netback_#t~mem931#1;talk_to_netback_~_min2~0#1 := ~xennet_max_queues~0; {18094#false} is VALID [2022-02-20 21:58:38,071 INFO L290 TraceCheckUtils]: 122: Hoare triple {18094#false} assume talk_to_netback_~_min1~0#1 % 4294967296 < talk_to_netback_~_min2~0#1 % 4294967296;talk_to_netback_#t~ite932#1 := talk_to_netback_~_min1~0#1; {18094#false} is VALID [2022-02-20 21:58:38,071 INFO L290 TraceCheckUtils]: 123: Hoare triple {18094#false} talk_to_netback_~num_queues~7#1 := talk_to_netback_#t~ite932#1;havoc talk_to_netback_#t~ite932#1;call write~int(0, talk_to_netback_~#__constr_expr_1~1#1.base, talk_to_netback_~#__constr_expr_1~1#1.offset, 4);havoc talk_to_netback_#t~nondet933#1;call talk_to_netback_#t~mem934#1 := read~int(talk_to_netback_~#__constr_expr_1~1#1.base, talk_to_netback_~#__constr_expr_1~1#1.offset, 4);call talk_to_netback_#t~mem935#1.base, talk_to_netback_#t~mem935#1.offset := read~$Pointer$(talk_to_netback_~info#1.base, 24 + talk_to_netback_~info#1.offset, 8);call talk_to_netback_#t~mem936#1.base, talk_to_netback_#t~mem936#1.offset := read~$Pointer$(talk_to_netback_#t~mem935#1.base, 16 + talk_to_netback_#t~mem935#1.offset, 8);talk_to_netback_~err~10#1 := talk_to_netback_#t~nondet933#1;havoc talk_to_netback_#t~mem934#1;havoc talk_to_netback_#t~mem935#1.base, talk_to_netback_#t~mem935#1.offset;havoc talk_to_netback_#t~mem936#1.base, talk_to_netback_#t~mem936#1.offset; {18094#false} is VALID [2022-02-20 21:58:38,071 INFO L290 TraceCheckUtils]: 124: Hoare triple {18094#false} assume talk_to_netback_~err~10#1 < 0;call write~int(0, talk_to_netback_~#feature_split_evtchn~0#1.base, talk_to_netback_~#feature_split_evtchn~0#1.offset, 4); {18094#false} is VALID [2022-02-20 21:58:38,071 INFO L290 TraceCheckUtils]: 125: Hoare triple {18094#false} call talk_to_netback_#t~mem937#1.base, talk_to_netback_#t~mem937#1.offset := read~$Pointer$(talk_to_netback_~info#1.base, 16 + talk_to_netback_~info#1.offset, 8);call talk_to_netback_#t~mem938#1.base, talk_to_netback_#t~mem938#1.offset := read~$Pointer$(talk_to_netback_#t~mem937#1.base, 805 + talk_to_netback_#t~mem937#1.offset, 8);assume { :begin_inline_xen_net_read_mac } true;xen_net_read_mac_#in~dev#1.base, xen_net_read_mac_#in~dev#1.offset, xen_net_read_mac_#in~mac#1.base, xen_net_read_mac_#in~mac#1.offset := talk_to_netback_~dev#1.base, talk_to_netback_~dev#1.offset, talk_to_netback_#t~mem938#1.base, talk_to_netback_#t~mem938#1.offset;havoc xen_net_read_mac_#res#1;havoc xen_net_read_mac_#t~mem822#1, xen_net_read_mac_#t~mem823#1.base, xen_net_read_mac_#t~mem823#1.offset, xen_net_read_mac_#t~ret824#1.base, xen_net_read_mac_#t~ret824#1.offset, xen_net_read_mac_#t~ret825#1, xen_net_read_mac_#t~ret826#1, xen_net_read_mac_#t~ret827#1, xen_net_read_mac_#t~mem828#1.base, xen_net_read_mac_#t~mem828#1.offset, xen_net_read_mac_#t~mem829#1.base, xen_net_read_mac_#t~mem829#1.offset, xen_net_read_mac_#t~mem830#1, xen_net_read_mac_#t~ite831#1, xen_net_read_mac_#t~short832#1, xen_net_read_mac_#t~mem833#1.base, xen_net_read_mac_#t~mem833#1.offset, xen_net_read_mac_~dev#1.base, xen_net_read_mac_~dev#1.offset, xen_net_read_mac_~mac#1.base, xen_net_read_mac_~mac#1.offset, xen_net_read_mac_~s~0#1.base, xen_net_read_mac_~s~0#1.offset, xen_net_read_mac_~#e~0#1.base, xen_net_read_mac_~#e~0#1.offset, xen_net_read_mac_~macstr~0#1.base, xen_net_read_mac_~macstr~0#1.offset, xen_net_read_mac_~i~16#1, xen_net_read_mac_~#__constr_expr_0~1#1.base, xen_net_read_mac_~#__constr_expr_0~1#1.offset, xen_net_read_mac_~tmp~69#1.base, xen_net_read_mac_~tmp~69#1.offset, xen_net_read_mac_~tmp___0~34#1, xen_net_read_mac_~tmp___1~23#1, xen_net_read_mac_~tmp___2~16#1;xen_net_read_mac_~dev#1.base, xen_net_read_mac_~dev#1.offset := xen_net_read_mac_#in~dev#1.base, xen_net_read_mac_#in~dev#1.offset;xen_net_read_mac_~mac#1.base, xen_net_read_mac_~mac#1.offset := xen_net_read_mac_#in~mac#1.base, xen_net_read_mac_#in~mac#1.offset;havoc xen_net_read_mac_~s~0#1.base, xen_net_read_mac_~s~0#1.offset;call xen_net_read_mac_~#e~0#1.base, xen_net_read_mac_~#e~0#1.offset := #Ultimate.allocOnStack(8);havoc xen_net_read_mac_~macstr~0#1.base, xen_net_read_mac_~macstr~0#1.offset;havoc xen_net_read_mac_~i~16#1;call xen_net_read_mac_~#__constr_expr_0~1#1.base, xen_net_read_mac_~#__constr_expr_0~1#1.offset := #Ultimate.allocOnStack(4);havoc xen_net_read_mac_~tmp~69#1.base, xen_net_read_mac_~tmp~69#1.offset;havoc xen_net_read_mac_~tmp___0~34#1;havoc xen_net_read_mac_~tmp___1~23#1;havoc xen_net_read_mac_~tmp___2~16#1;call write~int(0, xen_net_read_mac_~#__constr_expr_0~1#1.base, xen_net_read_mac_~#__constr_expr_0~1#1.offset, 4);call xen_net_read_mac_#t~mem822#1 := read~int(xen_net_read_mac_~#__constr_expr_0~1#1.base, xen_net_read_mac_~#__constr_expr_0~1#1.offset, 4);call xen_net_read_mac_#t~mem823#1.base, xen_net_read_mac_#t~mem823#1.offset := read~$Pointer$(xen_net_read_mac_~dev#1.base, 8 + xen_net_read_mac_~dev#1.offset, 8);assume { :begin_inline_xenbus_read } true;xenbus_read_#in~arg0#1.id, xenbus_read_#in~arg1#1.base, xenbus_read_#in~arg1#1.offset, xenbus_read_#in~arg2#1.base, xenbus_read_#in~arg2#1.offset, xenbus_read_#in~arg3#1.base, xenbus_read_#in~arg3#1.offset := xen_net_read_mac_#t~mem822#1, xen_net_read_mac_#t~mem823#1.base, xen_net_read_mac_#t~mem823#1.offset, 40, 0, 0, 0;havoc xenbus_read_#res#1.base, xenbus_read_#res#1.offset;havoc xenbus_read_#t~ret1235#1.base, xenbus_read_#t~ret1235#1.offset, xenbus_read_~arg0#1.id, xenbus_read_~arg1#1.base, xenbus_read_~arg1#1.offset, xenbus_read_~arg2#1.base, xenbus_read_~arg2#1.offset, xenbus_read_~arg3#1.base, xenbus_read_~arg3#1.offset;xenbus_read_~arg0#1.id := xenbus_read_#in~arg0#1.id;xenbus_read_~arg1#1.base, xenbus_read_~arg1#1.offset := xenbus_read_#in~arg1#1.base, xenbus_read_#in~arg1#1.offset;xenbus_read_~arg2#1.base, xenbus_read_~arg2#1.offset := xenbus_read_#in~arg2#1.base, xenbus_read_#in~arg2#1.offset;xenbus_read_~arg3#1.base, xenbus_read_~arg3#1.offset := xenbus_read_#in~arg3#1.base, xenbus_read_#in~arg3#1.offset; {18094#false} is VALID [2022-02-20 21:58:38,071 INFO L272 TraceCheckUtils]: 126: Hoare triple {18094#false} call xenbus_read_#t~ret1235#1.base, xenbus_read_#t~ret1235#1.offset := ldv_malloc(0); {18170#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:38,072 INFO L290 TraceCheckUtils]: 127: Hoare triple {18170#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~10.base, ~tmp~10.offset;havoc ~tmp___0~2;assume -2147483648 <= #t~nondet83 && #t~nondet83 <= 2147483647;~tmp___0~2 := #t~nondet83;havoc #t~nondet83; {18093#true} is VALID [2022-02-20 21:58:38,072 INFO L290 TraceCheckUtils]: 128: Hoare triple {18093#true} assume 0 != ~tmp___0~2;#res.base, #res.offset := 0, 0; {18093#true} is VALID [2022-02-20 21:58:38,072 INFO L290 TraceCheckUtils]: 129: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,072 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {18093#true} {18094#false} #3409#return; {18094#false} is VALID [2022-02-20 21:58:38,072 INFO L290 TraceCheckUtils]: 131: Hoare triple {18094#false} xenbus_read_#res#1.base, xenbus_read_#res#1.offset := xenbus_read_#t~ret1235#1.base, xenbus_read_#t~ret1235#1.offset;havoc xenbus_read_#t~ret1235#1.base, xenbus_read_#t~ret1235#1.offset; {18094#false} is VALID [2022-02-20 21:58:38,072 INFO L290 TraceCheckUtils]: 132: Hoare triple {18094#false} xen_net_read_mac_#t~ret824#1.base, xen_net_read_mac_#t~ret824#1.offset := xenbus_read_#res#1.base, xenbus_read_#res#1.offset;assume { :end_inline_xenbus_read } true;xen_net_read_mac_~tmp~69#1.base, xen_net_read_mac_~tmp~69#1.offset := xen_net_read_mac_#t~ret824#1.base, xen_net_read_mac_#t~ret824#1.offset;havoc xen_net_read_mac_#t~mem822#1;havoc xen_net_read_mac_#t~mem823#1.base, xen_net_read_mac_#t~mem823#1.offset;havoc xen_net_read_mac_#t~ret824#1.base, xen_net_read_mac_#t~ret824#1.offset;xen_net_read_mac_~s~0#1.base, xen_net_read_mac_~s~0#1.offset := xen_net_read_mac_~tmp~69#1.base, xen_net_read_mac_~tmp~69#1.offset;xen_net_read_mac_~macstr~0#1.base, xen_net_read_mac_~macstr~0#1.offset := xen_net_read_mac_~s~0#1.base, xen_net_read_mac_~s~0#1.offset; {18094#false} is VALID [2022-02-20 21:58:38,072 INFO L272 TraceCheckUtils]: 133: Hoare triple {18094#false} call xen_net_read_mac_#t~ret825#1 := IS_ERR(xen_net_read_mac_~macstr~0#1.base, xen_net_read_mac_~macstr~0#1.offset); {18093#true} is VALID [2022-02-20 21:58:38,073 INFO L290 TraceCheckUtils]: 134: Hoare triple {18093#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~6; {18093#true} is VALID [2022-02-20 21:58:38,073 INFO L272 TraceCheckUtils]: 135: Hoare triple {18093#true} call #t~ret47 := ldv__builtin_expect((if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 18446744073709547520 then 1 else 0), 0); {18093#true} is VALID [2022-02-20 21:58:38,073 INFO L290 TraceCheckUtils]: 136: Hoare triple {18093#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {18093#true} is VALID [2022-02-20 21:58:38,073 INFO L290 TraceCheckUtils]: 137: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,073 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {18093#true} {18093#true} #4133#return; {18093#true} is VALID [2022-02-20 21:58:38,073 INFO L290 TraceCheckUtils]: 139: Hoare triple {18093#true} assume -9223372036854775808 <= #t~ret47 && #t~ret47 <= 9223372036854775807;~tmp~6 := #t~ret47;havoc #t~ret47;#res := (if 0 == (if 0 != ~tmp~6 then 1 else 0) then 0 else 1); {18093#true} is VALID [2022-02-20 21:58:38,073 INFO L290 TraceCheckUtils]: 140: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,074 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {18093#true} {18094#false} #3411#return; {18094#false} is VALID [2022-02-20 21:58:38,074 INFO L290 TraceCheckUtils]: 142: Hoare triple {18094#false} xen_net_read_mac_~tmp___1~23#1 := xen_net_read_mac_#t~ret825#1;havoc xen_net_read_mac_#t~ret825#1; {18094#false} is VALID [2022-02-20 21:58:38,074 INFO L290 TraceCheckUtils]: 143: Hoare triple {18094#false} assume 0 != xen_net_read_mac_~tmp___1~23#1 % 256; {18094#false} is VALID [2022-02-20 21:58:38,074 INFO L272 TraceCheckUtils]: 144: Hoare triple {18094#false} call xen_net_read_mac_#t~ret826#1 := PTR_ERR(xen_net_read_mac_~macstr~0#1.base, xen_net_read_mac_~macstr~0#1.offset); {18093#true} is VALID [2022-02-20 21:58:38,074 INFO L290 TraceCheckUtils]: 145: Hoare triple {18093#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := ~ptr.base + ~ptr.offset; {18093#true} is VALID [2022-02-20 21:58:38,074 INFO L290 TraceCheckUtils]: 146: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-20 21:58:38,074 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {18093#true} {18094#false} #3413#return; {18094#false} is VALID [2022-02-20 21:58:38,075 INFO L290 TraceCheckUtils]: 148: Hoare triple {18094#false} assume -9223372036854775808 <= xen_net_read_mac_#t~ret826#1 && xen_net_read_mac_#t~ret826#1 <= 9223372036854775807;xen_net_read_mac_~tmp___0~34#1 := xen_net_read_mac_#t~ret826#1;havoc xen_net_read_mac_#t~ret826#1;xen_net_read_mac_#res#1 := (if xen_net_read_mac_~tmp___0~34#1 % 4294967296 <= 2147483647 then xen_net_read_mac_~tmp___0~34#1 % 4294967296 else xen_net_read_mac_~tmp___0~34#1 % 4294967296 - 4294967296);call ULTIMATE.dealloc(xen_net_read_mac_~#e~0#1.base, xen_net_read_mac_~#e~0#1.offset);havoc xen_net_read_mac_~#e~0#1.base, xen_net_read_mac_~#e~0#1.offset;call ULTIMATE.dealloc(xen_net_read_mac_~#__constr_expr_0~1#1.base, xen_net_read_mac_~#__constr_expr_0~1#1.offset);havoc xen_net_read_mac_~#__constr_expr_0~1#1.base, xen_net_read_mac_~#__constr_expr_0~1#1.offset; {18094#false} is VALID [2022-02-20 21:58:38,075 INFO L290 TraceCheckUtils]: 149: Hoare triple {18094#false} talk_to_netback_#t~ret939#1 := xen_net_read_mac_#res#1;assume { :end_inline_xen_net_read_mac } true;assume -2147483648 <= talk_to_netback_#t~ret939#1 && talk_to_netback_#t~ret939#1 <= 2147483647;talk_to_netback_~err~10#1 := talk_to_netback_#t~ret939#1;havoc talk_to_netback_#t~mem937#1.base, talk_to_netback_#t~mem937#1.offset;havoc talk_to_netback_#t~mem938#1.base, talk_to_netback_#t~mem938#1.offset;havoc talk_to_netback_#t~ret939#1; {18094#false} is VALID [2022-02-20 21:58:38,075 INFO L290 TraceCheckUtils]: 150: Hoare triple {18094#false} assume !(0 != talk_to_netback_~err~10#1);assume { :begin_inline_kcalloc } true;kcalloc_#in~n#1, kcalloc_#in~size#1, kcalloc_#in~flags#1 := talk_to_netback_~num_queues~7#1 % 4294967296, 31616, 208;havoc kcalloc_#res#1.base, kcalloc_#res#1.offset;havoc kcalloc_#t~ret1166#1.base, kcalloc_#t~ret1166#1.offset, kcalloc_~n#1, kcalloc_~size#1, kcalloc_~flags#1;kcalloc_~n#1 := kcalloc_#in~n#1;kcalloc_~size#1 := kcalloc_#in~size#1;kcalloc_~flags#1 := kcalloc_#in~flags#1; {18094#false} is VALID [2022-02-20 21:58:38,075 INFO L272 TraceCheckUtils]: 151: Hoare triple {18094#false} call ldv_check_alloc_flags(kcalloc_~flags#1); {18094#false} is VALID [2022-02-20 21:58:38,075 INFO L290 TraceCheckUtils]: 152: Hoare triple {18094#false} ~flags := #in~flags; {18094#false} is VALID [2022-02-20 21:58:38,075 INFO L290 TraceCheckUtils]: 153: Hoare triple {18094#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {18094#false} is VALID [2022-02-20 21:58:38,076 INFO L272 TraceCheckUtils]: 154: Hoare triple {18094#false} call ldv_error(); {18094#false} is VALID [2022-02-20 21:58:38,076 INFO L290 TraceCheckUtils]: 155: Hoare triple {18094#false} assume !false; {18094#false} is VALID [2022-02-20 21:58:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-02-20 21:58:38,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:38,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151239715] [2022-02-20 21:58:38,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151239715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:38,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:38,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:58:38,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992124194] [2022-02-20 21:58:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:38,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2022-02-20 21:58:38,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:38,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:58:38,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:38,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:58:38,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:38,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:58:38,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:58:38,191 INFO L87 Difference]: Start difference. First operand 2587 states and 3471 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)