./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.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/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.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 6037d9c0da39b47219c2a722405991c574e168b5c260e77abe20cfd9849699bc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:52:52,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:52:52,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:52:52,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:52:52,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:52:52,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:52:52,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:52:52,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:52:52,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:52:52,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:52:52,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:52:52,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:52:52,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:52:52,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:52:52,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:52:52,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:52:52,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:52:52,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:52:52,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:52:52,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:52:52,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:52:52,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:52:52,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:52:52,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:52:52,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:52:52,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:52:52,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:52:52,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:52:52,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:52:52,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:52:52,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:52:52,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:52:52,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:52:52,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:52:52,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:52:52,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:52:52,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:52:52,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:52:52,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:52:52,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:52:52,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:52:52,707 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:52:52,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:52:52,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:52:52,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:52:52,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:52:52,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:52:52,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:52:52,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:52:52,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:52:52,741 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:52:52,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:52:52,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:52:52,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:52:52,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:52:52,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:52:52,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:52:52,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:52:52,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:52:52,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:52:52,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:52:52,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:52:52,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:52:52,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:52:52,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:52:52,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:52:52,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:52:52,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:52:52,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:52:52,745 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:52:52,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:52:52,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:52:52,746 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 -> 6037d9c0da39b47219c2a722405991c574e168b5c260e77abe20cfd9849699bc [2022-02-20 21:52:53,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:52:53,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:52:53,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:52:53,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:52:53,034 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:52:53,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-02-20 21:52:53,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f7b2110/ee545a82fb5240f290f9d1827bee9ad6/FLAG9bd10ac67 [2022-02-20 21:52:53,812 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:52:53,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-02-20 21:52:53,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f7b2110/ee545a82fb5240f290f9d1827bee9ad6/FLAG9bd10ac67 [2022-02-20 21:52:53,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f7b2110/ee545a82fb5240f290f9d1827bee9ad6 [2022-02-20 21:52:53,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:52:53,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:52:53,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:52:53,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:52:53,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:52:53,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:52:53" (1/1) ... [2022-02-20 21:52:53,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4513bebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:53, skipping insertion in model container [2022-02-20 21:52:53,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:52:53" (1/1) ... [2022-02-20 21:52:53,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:52:54,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:52:54,815 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/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i[158583,158596] [2022-02-20 21:52:55,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:52:55,516 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:52:55,692 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/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i[158583,158596] [2022-02-20 21:52:55,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:52:56,029 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:52:56,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56 WrapperNode [2022-02-20 21:52:56,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:52:56,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:52:56,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:52:56,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:52:56,040 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:52:56" (1/1) ... [2022-02-20 21:52:56,130 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:52:56" (1/1) ... [2022-02-20 21:52:56,319 INFO L137 Inliner]: procedures = 220, calls = 1799, calls flagged for inlining = 81, calls inlined = 72, statements flattened = 3230 [2022-02-20 21:52:56,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:52:56,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:52:56,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:52:56,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:52:56,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:52:56,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:52:56,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:52:56,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:52:56,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (1/1) ... [2022-02-20 21:52:56,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:52:56,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:52:56,561 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:52:56,582 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:52:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_u32 [2022-02-20 21:52:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_u32 [2022-02-20 21:52:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_xmit [2022-02-20 21:52:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_xmit [2022-02-20 21:52:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:52:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:52:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:52:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:52:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_u32 [2022-02-20 21:52:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_u32 [2022-02-20 21:52:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_start_tx [2022-02-20 21:52:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_start_tx [2022-02-20 21:52:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:52:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:52:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-02-20 21:52:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-02-20 21:52:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_bits [2022-02-20 21:52:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_bits [2022-02-20 21:52:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-02-20 21:52:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-02-20 21:52:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:52:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:52:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure dump_stack [2022-02-20 21:52:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_stack [2022-02-20 21:52:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:52:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:52:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_4 [2022-02-20 21:52:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_4 [2022-02-20 21:52:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-02-20 21:52:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-02-20 21:52:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2022-02-20 21:52:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2022-02-20 21:52:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:52:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:52:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 21:52:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 21:52:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 21:52:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 21:52:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_fill_info [2022-02-20 21:52:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_fill_info [2022-02-20 21:52:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:52:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 21:52:56,612 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 21:52:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc [2022-02-20 21:52:56,612 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc [2022-02-20 21:52:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_update_aggregation_stats [2022-02-20 21:52:56,612 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_update_aggregation_stats [2022-02-20 21:52:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:52:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:52:56,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:52:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:52:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_frm [2022-02-20 21:52:56,613 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_frm [2022-02-20 21:52:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:52:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 21:52:56,614 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 21:52:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_dequeue [2022-02-20 21:52:56,614 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_dequeue [2022-02-20 21:52:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:52:56,615 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:52:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-02-20 21:52:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-02-20 21:52:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-02-20 21:52:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-02-20 21:52:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc_len [2022-02-20 21:52:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc_len [2022-02-20 21:52:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:52:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:52:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:52:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_queue_len [2022-02-20 21:52:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_queue_len [2022-02-20 21:52:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 21:52:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 21:52:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:52:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-02-20 21:52:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-02-20 21:52:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:52:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_21 [2022-02-20 21:52:56,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_21 [2022-02-20 21:52:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 21:52:56,619 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 21:52:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:52:56,619 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:52:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:52:56,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:52:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:52:56,620 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:52:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_get_size [2022-02-20 21:52:56,620 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_get_size [2022-02-20 21:52:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_netlink_parms [2022-02-20 21:52:56,620 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_netlink_parms [2022-02-20 21:52:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-02-20 21:52:56,621 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-02-20 21:52:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:52:56,622 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:52:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:52:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:52:56,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:52:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:52:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-02-20 21:52:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-02-20 21:52:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-02-20 21:52:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-02-20 21:52:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-02-20 21:52:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-02-20 21:52:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:52:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2022-02-20 21:52:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2022-02-20 21:52:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_changelink [2022-02-20 21:52:56,625 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_changelink [2022-02-20 21:52:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:52:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 21:52:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-02-20 21:52:56,625 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-02-20 21:52:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-02-20 21:52:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-02-20 21:52:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_lock [2022-02-20 21:52:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_lock [2022-02-20 21:52:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_open [2022-02-20 21:52:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_open [2022-02-20 21:52:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_done [2022-02-20 21:52:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_done [2022-02-20 21:52:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 21:52:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 21:52:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_is_locked [2022-02-20 21:52:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_is_locked [2022-02-20 21:52:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-02-20 21:52:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-02-20 21:52:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_can_send_aggregate [2022-02-20 21:52:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_can_send_aggregate [2022-02-20 21:52:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 21:52:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 21:52:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:52:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:52:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-02-20 21:52:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-02-20 21:52:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-02-20 21:52:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-02-20 21:52:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-02-20 21:52:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-02-20 21:52:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 21:52:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 21:52:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_newlink [2022-02-20 21:52:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_newlink [2022-02-20 21:52:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-02-20 21:52:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-02-20 21:52:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:52:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-02-20 21:52:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-02-20 21:52:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_close [2022-02-20 21:52:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_close [2022-02-20 21:52:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-02-20 21:52:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-02-20 21:52:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_abort_tx [2022-02-20 21:52:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_abort_tx [2022-02-20 21:52:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-02-20 21:52:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-02-20 21:52:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:52:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:52:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-02-20 21:52:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-02-20 21:52:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-02-20 21:52:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-02-20 21:52:57,178 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:52:57,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:52:57,917 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:53:00,620 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:53:00,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:53:00,637 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:53:00,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:00 BoogieIcfgContainer [2022-02-20 21:53:00,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:53:00,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:53:00,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:53:00,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:53:00,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:52:53" (1/3) ... [2022-02-20 21:53:00,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbda004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:00, skipping insertion in model container [2022-02-20 21:53:00,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:56" (2/3) ... [2022-02-20 21:53:00,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbda004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:00, skipping insertion in model container [2022-02-20 21:53:00,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:00" (3/3) ... [2022-02-20 21:53:00,647 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-02-20 21:53:00,651 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:53:00,651 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:53:00,695 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:53:00,700 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:53:00,701 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:53:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 1087 states, 758 states have (on average 1.3364116094986807) internal successors, (1013), 777 states have internal predecessors, (1013), 255 states have call successors, (255), 73 states have call predecessors, (255), 72 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) [2022-02-20 21:53:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 21:53:00,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:00,755 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 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:53:00,756 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash 201705276, now seen corresponding path program 1 times [2022-02-20 21:53:00,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:00,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251059973] [2022-02-20 21:53:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {1107#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {1090#true} is VALID [2022-02-20 21:53:01,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1090#true} is VALID [2022-02-20 21:53:01,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-02-20 21:53:01,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #2691#return; {1090#true} is VALID [2022-02-20 21:53:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {1107#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {1090#true} is VALID [2022-02-20 21:53:01,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1090#true} is VALID [2022-02-20 21:53:01,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-02-20 21:53:01,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #2693#return; {1090#true} is VALID [2022-02-20 21:53:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:53:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {1107#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {1090#true} is VALID [2022-02-20 21:53:01,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1090#true} is VALID [2022-02-20 21:53:01,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-02-20 21:53:01,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #2695#return; {1090#true} is VALID [2022-02-20 21:53:01,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {1090#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(102, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(9, 4);call #Ultimate.allocInit(22, 5);call #Ultimate.allocInit(224, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(46, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(5, 8);call write~init~int(37, 8, 0, 1);call write~init~int(115, 8, 1, 1);call write~init~int(46, 8, 2, 1);call write~init~int(10, 8, 3, 1);call write~init~int(0, 8, 4, 1);call #Ultimate.allocInit(22, 9);call #Ultimate.allocInit(9, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(224, 12);call #Ultimate.allocInit(5, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(46, 13, 2, 1);call write~init~int(10, 13, 3, 1);call write~init~int(0, 13, 4, 1);call #Ultimate.allocInit(5, 14);call write~init~int(37, 14, 0, 1);call write~init~int(115, 14, 1, 1);call write~init~int(46, 14, 2, 1);call write~init~int(10, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(17, 15);call #Ultimate.allocInit(35, 16);call #Ultimate.allocInit(17, 17);call #Ultimate.allocInit(26, 18);call #Ultimate.allocInit(17, 19);call #Ultimate.allocInit(40, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(41, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(15, 25);call #Ultimate.allocInit(224, 26);call #Ultimate.allocInit(5, 27);call write~init~int(37, 27, 0, 1);call write~init~int(115, 27, 1, 1);call write~init~int(46, 27, 2, 1);call write~init~int(10, 27, 3, 1);call write~init~int(0, 27, 4, 1);call #Ultimate.allocInit(5, 28);call write~init~int(37, 28, 0, 1);call write~init~int(115, 28, 1, 1);call write~init~int(46, 28, 2, 1);call write~init~int(10, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(15, 29);call #Ultimate.allocInit(224, 30);call #Ultimate.allocInit(18, 31);call #Ultimate.allocInit(15, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(14, 34);call #Ultimate.allocInit(224, 35);call #Ultimate.allocInit(5, 36);call write~init~int(37, 36, 0, 1);call write~init~int(115, 36, 1, 1);call write~init~int(46, 36, 2, 1);call write~init~int(10, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(5, 37);call write~init~int(37, 37, 0, 1);call write~init~int(115, 37, 1, 1);call write~init~int(46, 37, 2, 1);call write~init~int(10, 37, 3, 1);call write~init~int(0, 37, 4, 1);call #Ultimate.allocInit(14, 38);call #Ultimate.allocInit(9, 39);call #Ultimate.allocInit(17, 40);call #Ultimate.allocInit(224, 41);call #Ultimate.allocInit(5, 42);call write~init~int(37, 42, 0, 1);call write~init~int(115, 42, 1, 1);call write~init~int(46, 42, 2, 1);call write~init~int(10, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(5, 43);call write~init~int(37, 43, 0, 1);call write~init~int(115, 43, 1, 1);call write~init~int(46, 43, 2, 1);call write~init~int(10, 43, 3, 1);call write~init~int(0, 43, 4, 1);call #Ultimate.allocInit(17, 44);call #Ultimate.allocInit(25, 45);call #Ultimate.allocInit(14, 46);call #Ultimate.allocInit(21, 47);call #Ultimate.allocInit(14, 48);call #Ultimate.allocInit(21, 49);call #Ultimate.allocInit(14, 50);call #Ultimate.allocInit(36, 51);call #Ultimate.allocInit(12, 52);call #Ultimate.allocInit(224, 53);call #Ultimate.allocInit(39, 54);call #Ultimate.allocInit(14, 55);call #Ultimate.allocInit(36, 56);call #Ultimate.allocInit(44, 57);call #Ultimate.allocInit(224, 58);call #Ultimate.allocInit(25, 59);call #Ultimate.allocInit(13, 60);call #Ultimate.allocInit(21, 61);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(21, 63);call #Ultimate.allocInit(13, 64);call #Ultimate.allocInit(36, 65);call #Ultimate.allocInit(12, 66);call #Ultimate.allocInit(224, 67);call #Ultimate.allocInit(9, 68);call #Ultimate.allocInit(14, 69);call #Ultimate.allocInit(224, 70);call #Ultimate.allocInit(4, 71);call write~init~int(37, 71, 0, 1);call write~init~int(115, 71, 1, 1);call write~init~int(10, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(4, 72);call write~init~int(37, 72, 0, 1);call write~init~int(115, 72, 1, 1);call write~init~int(10, 72, 2, 1);call write~init~int(0, 72, 3, 1);call #Ultimate.allocInit(14, 73);call #Ultimate.allocInit(9, 74);call #Ultimate.allocInit(14, 75);call #Ultimate.allocInit(224, 76);call #Ultimate.allocInit(15, 77);call #Ultimate.allocInit(15, 78);call #Ultimate.allocInit(14, 79);call #Ultimate.allocInit(224, 80);call #Ultimate.allocInit(18, 81);call #Ultimate.allocInit(14, 82);call #Ultimate.allocInit(18, 83);call #Ultimate.allocInit(14, 84);call #Ultimate.allocInit(9, 85);call #Ultimate.allocInit(14, 86);call #Ultimate.allocInit(224, 87);call #Ultimate.allocInit(5, 88);call write~init~int(45, 88, 0, 1);call write~init~int(45, 88, 1, 1);call write~init~int(62, 88, 2, 1);call write~init~int(32, 88, 3, 1);call write~init~int(0, 88, 4, 1);call #Ultimate.allocInit(2, 89);call write~init~int(15, 89, 0, 1);call write~init~int(0, 89, 1, 1);call #Ultimate.allocInit(5, 90);call write~init~int(45, 90, 0, 1);call write~init~int(45, 90, 1, 1);call write~init~int(62, 90, 2, 1);call write~init~int(32, 90, 3, 1);call write~init~int(0, 90, 4, 1);call #Ultimate.allocInit(9, 91);call #Ultimate.allocInit(18, 92);call #Ultimate.allocInit(224, 93);call #Ultimate.allocInit(5, 94);call write~init~int(37, 94, 0, 1);call write~init~int(115, 94, 1, 1);call write~init~int(46, 94, 2, 1);call write~init~int(10, 94, 3, 1);call write~init~int(0, 94, 4, 1);call #Ultimate.allocInit(5, 95);call write~init~int(37, 95, 0, 1);call write~init~int(115, 95, 1, 1);call write~init~int(46, 95, 2, 1);call write~init~int(10, 95, 3, 1);call write~init~int(0, 95, 4, 1);call #Ultimate.allocInit(18, 96);call #Ultimate.allocInit(9, 97);call #Ultimate.allocInit(17, 98);call #Ultimate.allocInit(224, 99);call #Ultimate.allocInit(5, 100);call write~init~int(37, 100, 0, 1);call write~init~int(115, 100, 1, 1);call write~init~int(46, 100, 2, 1);call write~init~int(10, 100, 3, 1);call write~init~int(0, 100, 4, 1);call #Ultimate.allocInit(5, 101);call write~init~int(37, 101, 0, 1);call write~init~int(115, 101, 1, 1);call write~init~int(46, 101, 2, 1);call write~init~int(10, 101, 3, 1);call write~init~int(0, 101, 4, 1);call #Ultimate.allocInit(17, 102);call #Ultimate.allocInit(9, 103);call #Ultimate.allocInit(14, 104);call #Ultimate.allocInit(224, 105);call #Ultimate.allocInit(20, 106);call #Ultimate.allocInit(20, 107);call #Ultimate.allocInit(14, 108);call #Ultimate.allocInit(21, 109);call #Ultimate.allocInit(14, 110);call #Ultimate.allocInit(9, 111);call #Ultimate.allocInit(14, 112);call #Ultimate.allocInit(224, 113);call #Ultimate.allocInit(14, 114);call #Ultimate.allocInit(14, 115);call #Ultimate.allocInit(14, 116);call #Ultimate.allocInit(224, 117);call #Ultimate.allocInit(9, 118);call #Ultimate.allocInit(14, 119);call #Ultimate.allocInit(224, 120);call #Ultimate.allocInit(24, 121);call #Ultimate.allocInit(24, 122);call #Ultimate.allocInit(14, 123);call #Ultimate.allocInit(224, 124);call #Ultimate.allocInit(23, 125);call #Ultimate.allocInit(14, 126);call #Ultimate.allocInit(9, 127);call #Ultimate.allocInit(14, 128);call #Ultimate.allocInit(224, 129);call #Ultimate.allocInit(12, 130);call #Ultimate.allocInit(12, 131);call #Ultimate.allocInit(14, 132);call #Ultimate.allocInit(9, 133);call #Ultimate.allocInit(14, 134);call #Ultimate.allocInit(224, 135);call #Ultimate.allocInit(15, 136);call #Ultimate.allocInit(15, 137);call #Ultimate.allocInit(14, 138);call #Ultimate.allocInit(224, 139);call #Ultimate.allocInit(16, 140);call #Ultimate.allocInit(14, 141);call #Ultimate.allocInit(9, 142);call #Ultimate.allocInit(14, 143);call #Ultimate.allocInit(224, 144);call #Ultimate.allocInit(29, 145);call #Ultimate.allocInit(29, 146);call #Ultimate.allocInit(14, 147);call #Ultimate.allocInit(9, 148);call #Ultimate.allocInit(14, 149);call #Ultimate.allocInit(224, 150);call #Ultimate.allocInit(16, 151);call #Ultimate.allocInit(16, 152);call #Ultimate.allocInit(14, 153);call #Ultimate.allocInit(224, 154);call #Ultimate.allocInit(18, 155);call #Ultimate.allocInit(14, 156);call #Ultimate.allocInit(37, 157);call #Ultimate.allocInit(14, 158);call #Ultimate.allocInit(9, 159);call #Ultimate.allocInit(16, 160);call #Ultimate.allocInit(224, 161);call #Ultimate.allocInit(5, 162);call write~init~int(37, 162, 0, 1);call write~init~int(115, 162, 1, 1);call write~init~int(46, 162, 2, 1);call write~init~int(10, 162, 3, 1);call write~init~int(0, 162, 4, 1);call #Ultimate.allocInit(5, 163);call write~init~int(37, 163, 0, 1);call write~init~int(115, 163, 1, 1);call write~init~int(46, 163, 2, 1);call write~init~int(10, 163, 3, 1);call write~init~int(0, 163, 4, 1);call #Ultimate.allocInit(16, 164);call #Ultimate.allocInit(21, 165);call #Ultimate.allocInit(16, 166);call #Ultimate.allocInit(14, 167);call #Ultimate.allocInit(16, 168);call #Ultimate.allocInit(224, 169);call #Ultimate.allocInit(23, 170);call #Ultimate.allocInit(16, 171);call #Ultimate.allocInit(224, 172);call #Ultimate.allocInit(19, 173);call #Ultimate.allocInit(16, 174);call #Ultimate.allocInit(9, 175);call #Ultimate.allocInit(17, 176);call #Ultimate.allocInit(224, 177);call #Ultimate.allocInit(5, 178);call write~init~int(37, 178, 0, 1);call write~init~int(115, 178, 1, 1);call write~init~int(46, 178, 2, 1);call write~init~int(10, 178, 3, 1);call write~init~int(0, 178, 4, 1);call #Ultimate.allocInit(5, 179);call write~init~int(37, 179, 0, 1);call write~init~int(115, 179, 1, 1);call write~init~int(46, 179, 2, 1);call write~init~int(10, 179, 3, 1);call write~init~int(0, 179, 4, 1);call #Ultimate.allocInit(17, 180);call #Ultimate.allocInit(9, 181);call #Ultimate.allocInit(19, 182);call #Ultimate.allocInit(224, 183);call #Ultimate.allocInit(5, 184);call write~init~int(37, 184, 0, 1);call write~init~int(115, 184, 1, 1);call write~init~int(46, 184, 2, 1);call write~init~int(10, 184, 3, 1);call write~init~int(0, 184, 4, 1);call #Ultimate.allocInit(5, 185);call write~init~int(37, 185, 0, 1);call write~init~int(115, 185, 1, 1);call write~init~int(46, 185, 2, 1);call write~init~int(10, 185, 3, 1);call write~init~int(0, 185, 4, 1);call #Ultimate.allocInit(19, 186);call #Ultimate.allocInit(9, 187);call #Ultimate.allocInit(23, 188);call #Ultimate.allocInit(224, 189);call #Ultimate.allocInit(5, 190);call write~init~int(37, 190, 0, 1);call write~init~int(115, 190, 1, 1);call write~init~int(46, 190, 2, 1);call write~init~int(10, 190, 3, 1);call write~init~int(0, 190, 4, 1);call #Ultimate.allocInit(5, 191);call write~init~int(37, 191, 0, 1);call write~init~int(115, 191, 1, 1);call write~init~int(46, 191, 2, 1);call write~init~int(10, 191, 3, 1);call write~init~int(0, 191, 4, 1);call #Ultimate.allocInit(23, 192);call #Ultimate.allocInit(224, 193);call #Ultimate.allocInit(224, 194);call #Ultimate.allocInit(224, 195);call #Ultimate.allocInit(18, 196);call #Ultimate.allocInit(11, 197);call #Ultimate.allocInit(23, 198);call #Ultimate.allocInit(23, 199);call #Ultimate.allocInit(25, 200);call #Ultimate.allocInit(27, 201);call #Ultimate.allocInit(24, 202);call #Ultimate.allocInit(3, 203);call write~init~int(37, 203, 0, 1);call write~init~int(115, 203, 1, 1);call write~init~int(0, 203, 2, 1);call #Ultimate.allocInit(34, 204);call #Ultimate.allocInit(11, 205);call #Ultimate.allocInit(21, 206);call #Ultimate.allocInit(23, 207);call #Ultimate.allocInit(24, 208);call #Ultimate.allocInit(39, 209);call #Ultimate.allocInit(11, 210);call #Ultimate.allocInit(27, 211);call #Ultimate.allocInit(11, 212);call #Ultimate.allocInit(36, 213);call #Ultimate.allocInit(224, 214);call #Ultimate.allocInit(17, 215);call #Ultimate.allocInit(9, 216);call #Ultimate.allocInit(20, 217);call #Ultimate.allocInit(224, 218);call #Ultimate.allocInit(22, 219);call #Ultimate.allocInit(30, 220);call #Ultimate.allocInit(36, 221);call #Ultimate.allocInit(224, 222);call #Ultimate.allocInit(14, 223);call #Ultimate.allocInit(42, 224);call #Ultimate.allocInit(17, 225);call #Ultimate.allocInit(42, 226);call #Ultimate.allocInit(17, 227);call #Ultimate.allocInit(50, 228);call #Ultimate.allocInit(17, 229);call #Ultimate.allocInit(14, 230);call #Ultimate.allocInit(6, 231);call write~init~int(99, 231, 0, 1);call write~init~int(102, 231, 1, 1);call write~init~int(104, 231, 2, 1);call write~init~int(115, 231, 3, 1);call write~init~int(105, 231, 4, 1);call write~init~int(0, 231, 5, 1);~ldv_timer_list_3~0.base, ~ldv_timer_list_3~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_timer_state_3~0 := 0;~ldv_state_variable_2~0 := 0;~cfhsi_netdevops_group1~0.base, ~cfhsi_netdevops_group1~0.offset := 0, 0;~caif_hsi_link_ops_group1~0.base, ~caif_hsi_link_ops_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~caif_hsi_link_ops_group3~0.base, ~caif_hsi_link_ops_group3~0.offset := 0, 0;~ldv_timer_state_2~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2~0.base, ~ldv_timer_list_2~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ref_cnt~0 := 0;~caif_hsi_link_ops_group2~0.base, ~caif_hsi_link_ops_group2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~caif_hsi_link_ops_group0~0.base, ~caif_hsi_link_ops_group0~0.offset := 0, 0;~#hsi_default_config~0.base, ~#hsi_default_config~0.offset := 232, 0;call #Ultimate.allocInit(24, 232);call write~init~int(250, ~#hsi_default_config~0.base, ~#hsi_default_config~0.offset, 4);call write~init~int(1, ~#hsi_default_config~0.base, 4 + ~#hsi_default_config~0.offset, 4);call write~init~int(4, ~#hsi_default_config~0.base, 8 + ~#hsi_default_config~0.offset, 4);call write~init~int(4, ~#hsi_default_config~0.base, 12 + ~#hsi_default_config~0.offset, 4);call write~init~int(100, ~#hsi_default_config~0.base, 16 + ~#hsi_default_config~0.offset, 4);call write~init~int(50, ~#hsi_default_config~0.base, 20 + ~#hsi_default_config~0.offset, 4);~#cfhsi_list~0.base, ~#cfhsi_list~0.offset := 233, 0;call #Ultimate.allocInit(16, 233);call write~init~$Pointer$(~#cfhsi_list~0.base, ~#cfhsi_list~0.offset, ~#cfhsi_list~0.base, ~#cfhsi_list~0.offset, 8);call write~init~$Pointer$(~#cfhsi_list~0.base, ~#cfhsi_list~0.offset, ~#cfhsi_list~0.base, 8 + ~#cfhsi_list~0.offset, 8);~#cfhsi_netdevops~0.base, ~#cfhsi_netdevops~0.offset := 234, 0;call #Ultimate.allocInit(480, 234);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_uninit.base, #funAddr~cfhsi_uninit.offset, ~#cfhsi_netdevops~0.base, 8 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_open.base, #funAddr~cfhsi_open.offset, ~#cfhsi_netdevops~0.base, 16 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_close.base, #funAddr~cfhsi_close.offset, ~#cfhsi_netdevops~0.base, 24 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_xmit.base, #funAddr~cfhsi_xmit.offset, ~#cfhsi_netdevops~0.base, 32 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 40 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 48 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 56 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 64 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 72 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 80 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 88 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 96 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 104 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 112 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 120 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 128 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 136 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 144 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 152 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 160 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 168 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 176 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 184 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 192 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 200 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 208 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 216 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 224 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 232 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 240 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 248 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 256 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 264 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 272 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 280 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 288 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 296 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 304 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 312 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 320 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 328 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 336 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 344 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 352 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 360 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 368 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 376 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 384 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 392 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 400 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 408 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 416 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 424 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 432 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 440 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 448 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 456 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 464 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 472 + ~#cfhsi_netdevops~0.offset, 8);~#caif_hsi_policy~0.base, ~#caif_hsi_policy~0.offset := 235, 0;call #Ultimate.allocInit(32, 235);call write~init~int(0, ~#caif_hsi_policy~0.base, ~#caif_hsi_policy~0.offset, 2);call write~init~int(0, ~#caif_hsi_policy~0.base, 2 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 4 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 6 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 8 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 10 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 12 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 14 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 16 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 18 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 20 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 22 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 24 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 26 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(0, ~#caif_hsi_policy~0.base, 28 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(0, ~#caif_hsi_policy~0.base, 30 + ~#caif_hsi_policy~0.offset, 2);~#caif_hsi_link_ops~0.base, ~#caif_hsi_link_ops~0.offset := 236, 0;call #Ultimate.allocInit(176, 236);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 8 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(231, 0, ~#caif_hsi_link_ops~0.base, 16 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~int(1560, ~#caif_hsi_link_ops~0.base, 24 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_setup.base, #funAddr~cfhsi_setup.offset, ~#caif_hsi_link_ops~0.base, 32 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~int(7, ~#caif_hsi_link_ops~0.base, 40 + ~#caif_hsi_link_ops~0.offset, 4);call write~init~$Pointer$(~#caif_hsi_policy~0.base, ~#caif_hsi_policy~0.offset, ~#caif_hsi_link_ops~0.base, 44 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 52 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_newlink.base, #funAddr~caif_hsi_newlink.offset, ~#caif_hsi_link_ops~0.base, 60 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_changelink.base, #funAddr~caif_hsi_changelink.offset, ~#caif_hsi_link_ops~0.base, 68 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 76 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_get_size.base, #funAddr~caif_hsi_get_size.offset, ~#caif_hsi_link_ops~0.base, 84 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_fill_info.base, #funAddr~caif_hsi_fill_info.offset, ~#caif_hsi_link_ops~0.base, 92 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 100 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 108 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 116 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 124 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~int(0, ~#caif_hsi_link_ops~0.base, 132 + ~#caif_hsi_link_ops~0.offset, 4);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 136 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 144 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 152 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 160 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 168 + ~#caif_hsi_link_ops~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 237, 0;call #Ultimate.allocInit(120, 237);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {1090#true} is VALID [2022-02-20 21:53:01,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret847#1.base, main_#t~ret847#1.offset, main_#t~ret848#1.base, main_#t~ret848#1.offset, main_#t~ret849#1.base, main_#t~ret849#1.offset, main_#t~nondet850#1, main_#t~switch851#1, main_#t~nondet852#1, main_#t~switch853#1, main_#t~ret854#1, main_#t~ret855#1, main_#t~ret856#1, main_#t~ret857#1, main_#t~ret858#1, main_#t~ret859#1, main_#t~ret860#1, main_#t~ret861#1, main_#t~ret862#1, main_#t~ret863#1, main_#t~ret864#1, main_#t~ret865#1, main_#t~ret866#1, main_#t~ret867#1, main_#t~ret868#1, main_#t~nondet869#1, main_#t~switch870#1, main_#t~ret871#1, main_#t~nondet872#1, main_#t~switch873#1, main_#t~ret874#1, main_#t~ret875#1, main_#t~ret876#1, main_#t~ret877#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~42#1.base, main_~tmp~42#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset, main_~tmp___2~14#1, main_~tmp___3~9#1, main_~tmp___4~7#1, main_~tmp___5~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~42#1.base, main_~tmp~42#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset;havoc main_~tmp___2~14#1;havoc main_~tmp___3~9#1;havoc main_~tmp___4~7#1;havoc main_~tmp___5~5#1; {1090#true} is VALID [2022-02-20 21:53:01,378 INFO L272 TraceCheckUtils]: 2: Hoare triple {1090#true} call main_#t~ret847#1.base, main_#t~ret847#1.offset := ldv_zalloc(232); {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {1107#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {1090#true} is VALID [2022-02-20 21:53:01,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {1090#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1090#true} is VALID [2022-02-20 21:53:01,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-02-20 21:53:01,378 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1090#true} {1090#true} #2691#return; {1090#true} is VALID [2022-02-20 21:53:01,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {1090#true} main_~tmp~42#1.base, main_~tmp~42#1.offset := main_#t~ret847#1.base, main_#t~ret847#1.offset;havoc main_#t~ret847#1.base, main_#t~ret847#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~42#1.base, main_~tmp~42#1.offset; {1090#true} is VALID [2022-02-20 21:53:01,384 INFO L272 TraceCheckUtils]: 8: Hoare triple {1090#true} call main_#t~ret848#1.base, main_#t~ret848#1.offset := ldv_zalloc(7168); {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1107#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {1090#true} is VALID [2022-02-20 21:53:01,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {1090#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1090#true} is VALID [2022-02-20 21:53:01,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-02-20 21:53:01,385 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1090#true} {1090#true} #2693#return; {1090#true} is VALID [2022-02-20 21:53:01,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {1090#true} main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset := main_#t~ret848#1.base, main_#t~ret848#1.offset;havoc main_#t~ret848#1.base, main_#t~ret848#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset; {1090#true} is VALID [2022-02-20 21:53:01,386 INFO L272 TraceCheckUtils]: 14: Hoare triple {1090#true} call main_#t~ret849#1.base, main_#t~ret849#1.offset := ldv_zalloc(232); {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {1107#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {1090#true} is VALID [2022-02-20 21:53:01,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {1090#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1090#true} is VALID [2022-02-20 21:53:01,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-02-20 21:53:01,388 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1090#true} {1090#true} #2695#return; {1090#true} is VALID [2022-02-20 21:53:01,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {1090#true} main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset := main_#t~ret849#1.base, main_#t~ret849#1.offset;havoc main_#t~ret849#1.base, main_#t~ret849#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {1104#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {1104#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~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 := 1;~ldv_state_variable_2~0 := 1;~ldv_state_variable_5~0 := 0; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {1104#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet850#1 && main_#t~nondet850#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet850#1;havoc main_#t~nondet850#1;main_#t~switch851#1 := 0 == main_~tmp___2~14#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {1104#(= ~last_index~0 0)} assume !main_#t~switch851#1;main_#t~switch851#1 := main_#t~switch851#1 || 1 == main_~tmp___2~14#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(= ~last_index~0 0)} assume !main_#t~switch851#1;main_#t~switch851#1 := main_#t~switch851#1 || 2 == main_~tmp___2~14#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {1104#(= ~last_index~0 0)} assume main_#t~switch851#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {1104#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet869#1 && main_#t~nondet869#1 <= 2147483647;main_~tmp___4~7#1 := main_#t~nondet869#1;havoc main_#t~nondet869#1;main_#t~switch870#1 := 0 == main_~tmp___4~7#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {1104#(= ~last_index~0 0)} assume !main_#t~switch870#1;main_#t~switch870#1 := main_#t~switch870#1 || 1 == main_~tmp___4~7#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {1104#(= ~last_index~0 0)} assume main_#t~switch870#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {1104#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cfhsi_init_module } true;havoc cfhsi_init_module_#res#1;havoc cfhsi_init_module_#t~ret826#1, cfhsi_init_module_~tmp~39#1;havoc cfhsi_init_module_~tmp~39#1;assume { :begin_inline_rtnl_link_register } true;rtnl_link_register_#in~arg0#1.base, rtnl_link_register_#in~arg0#1.offset := ~#caif_hsi_link_ops~0.base, ~#caif_hsi_link_ops~0.offset;havoc rtnl_link_register_#res#1;havoc rtnl_link_register_#t~nondet926#1, rtnl_link_register_~arg0#1.base, rtnl_link_register_~arg0#1.offset;rtnl_link_register_~arg0#1.base, rtnl_link_register_~arg0#1.offset := rtnl_link_register_#in~arg0#1.base, rtnl_link_register_#in~arg0#1.offset;assume -2147483648 <= rtnl_link_register_#t~nondet926#1 && rtnl_link_register_#t~nondet926#1 <= 2147483647;rtnl_link_register_#res#1 := rtnl_link_register_#t~nondet926#1;havoc rtnl_link_register_#t~nondet926#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {1104#(= ~last_index~0 0)} cfhsi_init_module_#t~ret826#1 := rtnl_link_register_#res#1;assume { :end_inline_rtnl_link_register } true;assume -2147483648 <= cfhsi_init_module_#t~ret826#1 && cfhsi_init_module_#t~ret826#1 <= 2147483647;cfhsi_init_module_~tmp~39#1 := cfhsi_init_module_#t~ret826#1;havoc cfhsi_init_module_#t~ret826#1;cfhsi_init_module_#res#1 := cfhsi_init_module_~tmp~39#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {1104#(= ~last_index~0 0)} main_#t~ret871#1 := cfhsi_init_module_#res#1;assume { :end_inline_cfhsi_init_module } true;assume -2147483648 <= main_#t~ret871#1 && main_#t~ret871#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret871#1;havoc main_#t~ret871#1; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {1104#(= ~last_index~0 0)} assume !(0 == ~ldv_retval_0~0); {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {1104#(= ~last_index~0 0)} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {1104#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {1104#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret905#1, ldv_check_final_state_~tmp___7~9#1;havoc ldv_check_final_state_~tmp___7~9#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {1105#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} is VALID [2022-02-20 21:53:01,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {1105#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} ldv_check_final_state_#t~ret905#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret905#1 && ldv_check_final_state_#t~ret905#1 <= 2147483647;ldv_check_final_state_~tmp___7~9#1 := ldv_check_final_state_#t~ret905#1;havoc ldv_check_final_state_#t~ret905#1; {1106#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~9#1| 0))} is VALID [2022-02-20 21:53:01,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {1106#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~9#1| 0))} assume !(0 != ldv_check_final_state_~tmp___7~9#1); {1091#false} is VALID [2022-02-20 21:53:01,406 INFO L272 TraceCheckUtils]: 37: Hoare triple {1091#false} call ldv_error(); {1091#false} is VALID [2022-02-20 21:53:01,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2022-02-20 21:53:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 21:53:01,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:01,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251059973] [2022-02-20 21:53:01,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251059973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:01,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:01,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:53:01,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200356918] [2022-02-20 21:53:01,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:01,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-02-20 21:53:01,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:01,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:01,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:01,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:53:01,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:53:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:53:01,535 INFO L87 Difference]: Start difference. First operand has 1087 states, 758 states have (on average 1.3364116094986807) internal successors, (1013), 777 states have internal predecessors, (1013), 255 states have call successors, (255), 73 states have call predecessors, (255), 72 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:21,115 INFO L93 Difference]: Finished difference Result 3554 states and 5253 transitions. [2022-02-20 21:53:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:53:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-02-20 21:53:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 5253 transitions. [2022-02-20 21:53:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 5253 transitions. [2022-02-20 21:53:21,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 5253 transitions. [2022-02-20 21:53:26,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5253 edges. 5253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:26,754 INFO L225 Difference]: With dead ends: 3554 [2022-02-20 21:53:26,754 INFO L226 Difference]: Without dead ends: 2437 [2022-02-20 21:53:26,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:53:26,772 INFO L933 BasicCegarLoop]: 1847 mSDtfsCounter, 2075 mSDsluCounter, 4699 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 6546 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:26,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2268 Valid, 6546 Invalid, 3358 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [730 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-20 21:53:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-02-20 21:53:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2233. [2022-02-20 21:53:26,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:26,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2437 states. Second operand has 2233 states, 1564 states have (on average 1.3241687979539642) internal successors, (2071), 1597 states have internal predecessors, (2071), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) [2022-02-20 21:53:26,990 INFO L74 IsIncluded]: Start isIncluded. First operand 2437 states. Second operand has 2233 states, 1564 states have (on average 1.3241687979539642) internal successors, (2071), 1597 states have internal predecessors, (2071), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) [2022-02-20 21:53:26,997 INFO L87 Difference]: Start difference. First operand 2437 states. Second operand has 2233 states, 1564 states have (on average 1.3241687979539642) internal successors, (2071), 1597 states have internal predecessors, (2071), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) [2022-02-20 21:53:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:27,302 INFO L93 Difference]: Finished difference Result 2437 states and 3535 transitions. [2022-02-20 21:53:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3535 transitions. [2022-02-20 21:53:27,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:27,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:27,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 2233 states, 1564 states have (on average 1.3241687979539642) internal successors, (2071), 1597 states have internal predecessors, (2071), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) Second operand 2437 states. [2022-02-20 21:53:27,338 INFO L87 Difference]: Start difference. First operand has 2233 states, 1564 states have (on average 1.3241687979539642) internal successors, (2071), 1597 states have internal predecessors, (2071), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) Second operand 2437 states. [2022-02-20 21:53:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:27,646 INFO L93 Difference]: Finished difference Result 2437 states and 3535 transitions. [2022-02-20 21:53:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3535 transitions. [2022-02-20 21:53:27,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:27,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:27,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:27,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1564 states have (on average 1.3241687979539642) internal successors, (2071), 1597 states have internal predecessors, (2071), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) [2022-02-20 21:53:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3176 transitions. [2022-02-20 21:53:28,012 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3176 transitions. Word has length 39 [2022-02-20 21:53:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:28,012 INFO L470 AbstractCegarLoop]: Abstraction has 2233 states and 3176 transitions. [2022-02-20 21:53:28,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3176 transitions. [2022-02-20 21:53:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-20 21:53:28,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:28,024 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-02-20 21:53:28,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:53:28,024 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:28,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2097784552, now seen corresponding path program 1 times [2022-02-20 21:53:28,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:28,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825237041] [2022-02-20 21:53:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:28,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14087#true} is VALID [2022-02-20 21:53:28,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:28,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #2691#return; {14087#true} is VALID [2022-02-20 21:53:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:28,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14087#true} is VALID [2022-02-20 21:53:28,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:28,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #2693#return; {14087#true} is VALID [2022-02-20 21:53:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:53:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:28,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14087#true} is VALID [2022-02-20 21:53:28,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:28,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #2695#return; {14087#true} is VALID [2022-02-20 21:53:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:53:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:28,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:28,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14087#true} #2611#return; {14087#true} is VALID [2022-02-20 21:53:28,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:28,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:28,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14087#true} #2465#return; {14087#true} is VALID [2022-02-20 21:53:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:53:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {14087#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; {14087#true} is VALID [2022-02-20 21:53:28,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:28,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14087#true} #2467#return; {14087#true} is VALID [2022-02-20 21:53:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 21:53:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:53:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:29,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} assume true; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} {14087#true} #2603#return; {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} is VALID [2022-02-20 21:53:29,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~5#1.base, ~skb~5#1.offset;havoc ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,015 INFO L272 TraceCheckUtils]: 1: Hoare triple {14087#true} call #t~ret901#1.base, #t~ret901#1.offset := ldv_zalloc(248); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} assume true; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,017 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} {14087#true} #2603#return; {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} is VALID [2022-02-20 21:53:29,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} ~tmp___7~5#1.base, ~tmp___7~5#1.offset := #t~ret901#1.base, #t~ret901#1.offset;havoc #t~ret901#1.base, #t~ret901#1.offset;~skb~5#1.base, ~skb~5#1.offset := ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(~skb~5#1.base == 0 && ~skb~5#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~5#1.base, ~skb~5#1.offset;havoc ldv_set_add_#t~mem896#1.base, ldv_set_add_#t~mem896#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~6#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~6#1;ldv_set_add_~i~6#1 := 0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !false; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(ldv_set_add_~i~6#1 < ~last_index~0); {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~5#1.base, ~skb~5#1.offset; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} assume true; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,023 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} {14087#true} #2625#return; {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} is VALID [2022-02-20 21:53:29,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~i~1#1;~i~1#1 := 0; {14087#true} is VALID [2022-02-20 21:53:29,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume ~i~1#1 <= 3; {14087#true} is VALID [2022-02-20 21:53:29,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume { :begin_inline_ldv_skb_dequeue_14 } true;ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset := ~cfhsi#1.base, 40 + ~cfhsi#1.offset + 88 * (if ~i~1#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~1#1 % 18446744073709551616 % 18446744073709551616 else ~i~1#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset, ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset, ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset;ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset := ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,024 INFO L272 TraceCheckUtils]: 3: Hoare triple {14087#true} call ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset := ldv_skb_alloc(); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~5#1.base, ~skb~5#1.offset;havoc ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,027 INFO L272 TraceCheckUtils]: 5: Hoare triple {14087#true} call #t~ret901#1.base, #t~ret901#1.offset := ldv_zalloc(248); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} assume true; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,029 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} {14087#true} #2603#return; {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} is VALID [2022-02-20 21:53:29,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} ~tmp___7~5#1.base, ~tmp___7~5#1.offset := #t~ret901#1.base, #t~ret901#1.offset;havoc #t~ret901#1.base, #t~ret901#1.offset;~skb~5#1.base, ~skb~5#1.offset := ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(~skb~5#1.base == 0 && ~skb~5#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~5#1.base, ~skb~5#1.offset;havoc ldv_set_add_#t~mem896#1.base, ldv_set_add_#t~mem896#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~6#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~6#1;ldv_set_add_~i~6#1 := 0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !false; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(ldv_set_add_~i~6#1 < ~last_index~0); {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~5#1.base, ~skb~5#1.offset; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} assume true; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,039 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} {14087#true} #2625#return; {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} is VALID [2022-02-20 21:53:29,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset := ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset := ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} #t~ret146#1.base, #t~ret146#1.offset := ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_14 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret146#1.base, #t~ret146#1.offset;havoc #t~ret146#1.base, #t~ret146#1.offset; {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} is VALID [2022-02-20 21:53:29,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} assume 0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616; {14088#false} is VALID [2022-02-20 21:53:29,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {14088#false} #res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,042 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14088#false} {14087#true} #2563#return; {14088#false} is VALID [2022-02-20 21:53:29,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~desc#1.base, ~desc#1.offset := #in~desc#1.base, #in~desc#1.offset;~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~nfrms~0#1;havoc ~pld_len~0#1;havoc ~skb~2#1.base, ~skb~2#1.offset;havoc ~pfrm~0#1.base, ~pfrm~0#1.offset;havoc ~info~1#1.base, ~info~1#1.offset;havoc ~hpad~1#1;havoc ~tpad~1#1;havoc ~pemb~0#1.base, ~pemb~0#1.offset;havoc ~info___0~0#1.base, ~info___0~0#1.offset;havoc ~hpad___0~0#1;havoc ~tpad___0~0#1;havoc ~tmp~15#1;~nfrms~0#1 := 0;~pld_len~0#1 := 0;~pfrm~0#1.base, ~pfrm~0#1.offset := ~desc#1.base, 128 + ~desc#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,045 INFO L272 TraceCheckUtils]: 1: Hoare triple {14087#true} call #t~ret195#1.base, #t~ret195#1.offset := cfhsi_dequeue(~cfhsi#1.base, ~cfhsi#1.offset); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~i~1#1;~i~1#1 := 0; {14087#true} is VALID [2022-02-20 21:53:29,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {14087#true} assume ~i~1#1 <= 3; {14087#true} is VALID [2022-02-20 21:53:29,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {14087#true} assume { :begin_inline_ldv_skb_dequeue_14 } true;ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset := ~cfhsi#1.base, 40 + ~cfhsi#1.offset + 88 * (if ~i~1#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~1#1 % 18446744073709551616 % 18446744073709551616 else ~i~1#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset, ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset, ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset;ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset := ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,048 INFO L272 TraceCheckUtils]: 5: Hoare triple {14087#true} call ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset := ldv_skb_alloc(); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~5#1.base, ~skb~5#1.offset;havoc ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,049 INFO L272 TraceCheckUtils]: 7: Hoare triple {14087#true} call #t~ret901#1.base, #t~ret901#1.offset := ldv_zalloc(248); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} assume true; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,064 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} {14087#true} #2603#return; {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} is VALID [2022-02-20 21:53:29,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} ~tmp___7~5#1.base, ~tmp___7~5#1.offset := #t~ret901#1.base, #t~ret901#1.offset;havoc #t~ret901#1.base, #t~ret901#1.offset;~skb~5#1.base, ~skb~5#1.offset := ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(~skb~5#1.base == 0 && ~skb~5#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~5#1.base, ~skb~5#1.offset;havoc ldv_set_add_#t~mem896#1.base, ldv_set_add_#t~mem896#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~6#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~6#1;ldv_set_add_~i~6#1 := 0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !false; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(ldv_set_add_~i~6#1 < ~last_index~0); {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~5#1.base, ~skb~5#1.offset; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} assume true; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,069 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} {14087#true} #2625#return; {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} is VALID [2022-02-20 21:53:29,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset := ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset := ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} #t~ret146#1.base, #t~ret146#1.offset := ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_14 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret146#1.base, #t~ret146#1.offset;havoc #t~ret146#1.base, #t~ret146#1.offset; {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} is VALID [2022-02-20 21:53:29,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} assume 0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616; {14088#false} is VALID [2022-02-20 21:53:29,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {14088#false} #res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,071 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14088#false} {14087#true} #2563#return; {14088#false} is VALID [2022-02-20 21:53:29,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {14088#false} ~skb~2#1.base, ~skb~2#1.offset := #t~ret195#1.base, #t~ret195#1.offset;havoc #t~ret195#1.base, #t~ret195#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {14088#false} assume 0 == (~skb~2#1.base + ~skb~2#1.offset) % 18446744073709551616;#res#1 := 0; {14088#false} is VALID [2022-02-20 21:53:29,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,072 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14088#false} {14087#true} #2469#return; {14088#false} is VALID [2022-02-20 21:53:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:53:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:29,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {14087#true} #~677.base, #~677.offset := #in~677.base, #in~677.offset;#~678 := #in~678;#~679.base, #~679.offset := #in~679.base, #in~679.offset; {14087#true} is VALID [2022-02-20 21:53:29,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14088#false} #2485#return; {14088#false} is VALID [2022-02-20 21:53:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 21:53:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:29,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14088#false} #2487#return; {14088#false} is VALID [2022-02-20 21:53:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:53:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:29,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14088#false} #2491#return; {14088#false} is VALID [2022-02-20 21:53:29,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {14253#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~desc~0#1.base, ~desc~0#1.offset;havoc ~len~2#1;havoc ~res~0#1;call ~#descriptor~2#1.base, ~#descriptor~2#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~16#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~2#1;havoc ~__ret_warn_on~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;call #t~mem247#1.base, #t~mem247#1.offset := read~$Pointer$(~cfhsi#1.base, 489 + ~cfhsi#1.offset, 8);~desc~0#1.base, ~desc~0#1.offset := #t~mem247#1.base, #t~mem247#1.offset;havoc #t~mem247#1.base, #t~mem247#1.offset;call write~$Pointer$(24, 0, ~#descriptor~2#1.base, ~#descriptor~2#1.offset, 8);call write~$Pointer$(25, 0, ~#descriptor~2#1.base, 8 + ~#descriptor~2#1.offset, 8);call write~$Pointer$(26, 0, ~#descriptor~2#1.base, 16 + ~#descriptor~2#1.offset, 8);call write~$Pointer$(27, 0, ~#descriptor~2#1.base, 24 + ~#descriptor~2#1.offset, 8);call write~int(393, ~#descriptor~2#1.base, 32 + ~#descriptor~2#1.offset, 4);call write~int(1, ~#descriptor~2#1.base, 36 + ~#descriptor~2#1.offset, 1);call #t~mem248#1 := read~int(~#descriptor~2#1.base, 36 + ~#descriptor~2#1.offset, 1); {14087#true} is VALID [2022-02-20 21:53:29,099 INFO L272 TraceCheckUtils]: 1: Hoare triple {14087#true} call #t~ret249#1 := ldv__builtin_expect(#t~mem248#1 % 256, 0); {14087#true} is VALID [2022-02-20 21:53:29,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,100 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14087#true} {14087#true} #2465#return; {14087#true} is VALID [2022-02-20 21:53:29,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} assume -9223372036854775808 <= #t~ret249#1 && #t~ret249#1 <= 9223372036854775807;~tmp~16#1 := #t~ret249#1;havoc #t~mem248#1;havoc #t~ret249#1; {14087#true} is VALID [2022-02-20 21:53:29,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {14087#true} assume 0 != ~tmp~16#1;havoc #t~nondet250#1;call #t~mem251#1.base, #t~mem251#1.offset := read~$Pointer$(~cfhsi#1.base, 24 + ~cfhsi#1.offset, 8);havoc #t~mem251#1.base, #t~mem251#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,100 INFO L272 TraceCheckUtils]: 7: Hoare triple {14087#true} call #t~ret252#1 := constant_test_bit(5, ~cfhsi#1.base, 1465 + ~cfhsi#1.offset); {14087#true} is VALID [2022-02-20 21:53:29,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {14087#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; {14087#true} is VALID [2022-02-20 21:53:29,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14087#true} {14087#true} #2467#return; {14087#true} is VALID [2022-02-20 21:53:29,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {14087#true} assume -2147483648 <= #t~ret252#1 && #t~ret252#1 <= 2147483647;~tmp___0~4#1 := #t~ret252#1;havoc #t~ret252#1; {14087#true} is VALID [2022-02-20 21:53:29,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {14087#true} assume !(0 != ~tmp___0~4#1); {14087#true} is VALID [2022-02-20 21:53:29,102 INFO L272 TraceCheckUtils]: 13: Hoare triple {14087#true} call #t~ret253#1 := cfhsi_tx_frm(~desc~0#1.base, ~desc~0#1.offset, ~cfhsi#1.base, ~cfhsi#1.offset); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~desc#1.base, ~desc#1.offset := #in~desc#1.base, #in~desc#1.offset;~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~nfrms~0#1;havoc ~pld_len~0#1;havoc ~skb~2#1.base, ~skb~2#1.offset;havoc ~pfrm~0#1.base, ~pfrm~0#1.offset;havoc ~info~1#1.base, ~info~1#1.offset;havoc ~hpad~1#1;havoc ~tpad~1#1;havoc ~pemb~0#1.base, ~pemb~0#1.offset;havoc ~info___0~0#1.base, ~info___0~0#1.offset;havoc ~hpad___0~0#1;havoc ~tpad___0~0#1;havoc ~tmp~15#1;~nfrms~0#1 := 0;~pld_len~0#1 := 0;~pfrm~0#1.base, ~pfrm~0#1.offset := ~desc#1.base, 128 + ~desc#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,103 INFO L272 TraceCheckUtils]: 15: Hoare triple {14087#true} call #t~ret195#1.base, #t~ret195#1.offset := cfhsi_dequeue(~cfhsi#1.base, ~cfhsi#1.offset); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~i~1#1;~i~1#1 := 0; {14087#true} is VALID [2022-02-20 21:53:29,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {14087#true} assume ~i~1#1 <= 3; {14087#true} is VALID [2022-02-20 21:53:29,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {14087#true} assume { :begin_inline_ldv_skb_dequeue_14 } true;ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset := ~cfhsi#1.base, 40 + ~cfhsi#1.offset + 88 * (if ~i~1#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~1#1 % 18446744073709551616 % 18446744073709551616 else ~i~1#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset, ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset, ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset;ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset := ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,105 INFO L272 TraceCheckUtils]: 19: Hoare triple {14087#true} call ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset := ldv_skb_alloc(); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~5#1.base, ~skb~5#1.offset;havoc ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,105 INFO L272 TraceCheckUtils]: 21: Hoare triple {14087#true} call #t~ret901#1.base, #t~ret901#1.offset := ldv_zalloc(248); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} assume true; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,107 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} {14087#true} #2603#return; {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} is VALID [2022-02-20 21:53:29,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} ~tmp___7~5#1.base, ~tmp___7~5#1.offset := #t~ret901#1.base, #t~ret901#1.offset;havoc #t~ret901#1.base, #t~ret901#1.offset;~skb~5#1.base, ~skb~5#1.offset := ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(~skb~5#1.base == 0 && ~skb~5#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~5#1.base, ~skb~5#1.offset;havoc ldv_set_add_#t~mem896#1.base, ldv_set_add_#t~mem896#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~6#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~6#1;ldv_set_add_~i~6#1 := 0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !false; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(ldv_set_add_~i~6#1 < ~last_index~0); {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~5#1.base, ~skb~5#1.offset; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} assume true; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,112 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} {14087#true} #2625#return; {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} is VALID [2022-02-20 21:53:29,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset := ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset := ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} #t~ret146#1.base, #t~ret146#1.offset := ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_14 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret146#1.base, #t~ret146#1.offset;havoc #t~ret146#1.base, #t~ret146#1.offset; {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} is VALID [2022-02-20 21:53:29,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} assume 0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616; {14088#false} is VALID [2022-02-20 21:53:29,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {14088#false} #res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,115 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14088#false} {14087#true} #2563#return; {14088#false} is VALID [2022-02-20 21:53:29,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {14088#false} ~skb~2#1.base, ~skb~2#1.offset := #t~ret195#1.base, #t~ret195#1.offset;havoc #t~ret195#1.base, #t~ret195#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {14088#false} assume 0 == (~skb~2#1.base + ~skb~2#1.offset) % 18446744073709551616;#res#1 := 0; {14088#false} is VALID [2022-02-20 21:53:29,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,115 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14088#false} {14087#true} #2469#return; {14088#false} is VALID [2022-02-20 21:53:29,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {14088#false} assume -2147483648 <= #t~ret253#1 && #t~ret253#1 <= 2147483647;~len~2#1 := #t~ret253#1;havoc #t~ret253#1; {14088#false} is VALID [2022-02-20 21:53:29,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {14088#false} assume !(0 == ~len~2#1);call #t~mem263#1.base, #t~mem263#1.offset := read~$Pointer$(~cfhsi#1.base, 489 + ~cfhsi#1.offset, 8);call #t~mem264#1.base, #t~mem264#1.offset := read~$Pointer$(~cfhsi#1.base, 424 + ~cfhsi#1.offset, 8);call #t~mem265#1.base, #t~mem265#1.offset := read~$Pointer$(~cfhsi#1.base, 424 + ~cfhsi#1.offset, 8);call #t~mem266#1.base, #t~mem266#1.offset := read~$Pointer$(#t~mem265#1.base, 16 + #t~mem265#1.offset, 8); {14088#false} is VALID [2022-02-20 21:53:29,116 INFO L272 TraceCheckUtils]: 46: Hoare triple {14088#false} call #t~ret267#1 := ##fun~$Pointer$~X~int~X~$Pointer$~TO~int(#t~mem263#1.base, #t~mem263#1.offset, ~len~2#1, #t~mem264#1.base, #t~mem264#1.offset, #t~mem266#1.base, #t~mem266#1.offset); {14087#true} is VALID [2022-02-20 21:53:29,116 INFO L290 TraceCheckUtils]: 47: Hoare triple {14087#true} #~677.base, #~677.offset := #in~677.base, #in~677.offset;#~678 := #in~678;#~679.base, #~679.offset := #in~679.base, #in~679.offset; {14087#true} is VALID [2022-02-20 21:53:29,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,116 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14087#true} {14088#false} #2485#return; {14088#false} is VALID [2022-02-20 21:53:29,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume -2147483648 <= #t~ret267#1 && #t~ret267#1 <= 2147483647;~res~0#1 := #t~ret267#1;havoc #t~mem263#1.base, #t~mem263#1.offset;havoc #t~mem264#1.base, #t~mem264#1.offset;havoc #t~mem265#1.base, #t~mem265#1.offset;havoc #t~mem266#1.base, #t~mem266#1.offset;havoc #t~ret267#1;~__ret_warn_on~0#1 := (if ~res~0#1 < 0 then 1 else 0); {14088#false} is VALID [2022-02-20 21:53:29,117 INFO L272 TraceCheckUtils]: 51: Hoare triple {14088#false} call #t~ret268#1 := ldv__builtin_expect((if 0 != ~__ret_warn_on~0#1 then 1 else 0), 0); {14087#true} is VALID [2022-02-20 21:53:29,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,117 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14087#true} {14088#false} #2487#return; {14088#false} is VALID [2022-02-20 21:53:29,117 INFO L290 TraceCheckUtils]: 55: Hoare triple {14088#false} assume -9223372036854775808 <= #t~ret268#1 && #t~ret268#1 <= 9223372036854775807;~tmp___3~0#1 := #t~ret268#1;havoc #t~ret268#1; {14088#false} is VALID [2022-02-20 21:53:29,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {14088#false} assume !(0 != ~tmp___3~0#1); {14088#false} is VALID [2022-02-20 21:53:29,118 INFO L272 TraceCheckUtils]: 57: Hoare triple {14088#false} call #t~ret269#1 := ldv__builtin_expect((if 0 != ~__ret_warn_on~0#1 then 1 else 0), 0); {14087#true} is VALID [2022-02-20 21:53:29,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,118 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14087#true} {14088#false} #2491#return; {14088#false} is VALID [2022-02-20 21:53:29,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {14088#false} assume -9223372036854775808 <= #t~ret269#1 && #t~ret269#1 <= 9223372036854775807;~tmp___4~0#1 := #t~ret269#1;havoc #t~ret269#1; {14088#false} is VALID [2022-02-20 21:53:29,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {14088#false} assume 0 != ~tmp___4~0#1;havoc #t~nondet270#1;call #t~mem271#1.base, #t~mem271#1.offset := read~$Pointer$(~cfhsi#1.base, 24 + ~cfhsi#1.offset, 8);havoc #t~mem271#1.base, #t~mem271#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {14088#false} assume !(~res~0#1 < 0); {14088#false} is VALID [2022-02-20 21:53:29,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} call ULTIMATE.dealloc(~#descriptor~2#1.base, ~#descriptor~2#1.offset);havoc ~#descriptor~2#1.base, ~#descriptor~2#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,119 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14088#false} {14087#true} #2613#return; {14088#false} is VALID [2022-02-20 21:53:29,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {14182#(and (= |old(abs_6304)| abs_6304) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(abs_6145)| abs_6145) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} #~840#1 := #in~840#1; {14087#true} is VALID [2022-02-20 21:53:29,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume #in~#fp#1.base == #funAddr~cfhsi_aggregation_tout.base && #in~#fp#1.offset == #funAddr~cfhsi_aggregation_tout.offset;assume { :begin_inline_cfhsi_aggregation_tout } true;cfhsi_aggregation_tout_#in~arg#1 := #~840#1;havoc cfhsi_aggregation_tout_#t~mem648#1, cfhsi_aggregation_tout_#t~ret649#1, cfhsi_aggregation_tout_#t~nondet650#1, cfhsi_aggregation_tout_#t~mem651#1.base, cfhsi_aggregation_tout_#t~mem651#1.offset, cfhsi_aggregation_tout_~arg#1, cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset, cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset, cfhsi_aggregation_tout_~tmp~28#1;cfhsi_aggregation_tout_~arg#1 := cfhsi_aggregation_tout_#in~arg#1;havoc cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset;call cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset := #Ultimate.allocOnStack(37);havoc cfhsi_aggregation_tout_~tmp~28#1;cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset := 0, (if cfhsi_aggregation_tout_~arg#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then cfhsi_aggregation_tout_~arg#1 % 18446744073709551616 % 18446744073709551616 else cfhsi_aggregation_tout_~arg#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);call write~$Pointer$(187, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~$Pointer$(188, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, 8 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~$Pointer$(189, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, 16 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~$Pointer$(190, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, 24 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~int(1066, cfhsi_aggregation_tout_~#descriptor~12#1.base, 32 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 4);call write~int(1, cfhsi_aggregation_tout_~#descriptor~12#1.base, 36 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 1);call cfhsi_aggregation_tout_#t~mem648#1 := read~int(cfhsi_aggregation_tout_~#descriptor~12#1.base, 36 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 1); {14087#true} is VALID [2022-02-20 21:53:29,120 INFO L272 TraceCheckUtils]: 2: Hoare triple {14087#true} call cfhsi_aggregation_tout_#t~ret649#1 := ldv__builtin_expect(cfhsi_aggregation_tout_#t~mem648#1 % 256, 0); {14087#true} is VALID [2022-02-20 21:53:29,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,120 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14087#true} {14087#true} #2611#return; {14087#true} is VALID [2022-02-20 21:53:29,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {14087#true} assume -9223372036854775808 <= cfhsi_aggregation_tout_#t~ret649#1 && cfhsi_aggregation_tout_#t~ret649#1 <= 9223372036854775807;cfhsi_aggregation_tout_~tmp~28#1 := cfhsi_aggregation_tout_#t~ret649#1;havoc cfhsi_aggregation_tout_#t~mem648#1;havoc cfhsi_aggregation_tout_#t~ret649#1; {14087#true} is VALID [2022-02-20 21:53:29,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {14087#true} assume 0 != cfhsi_aggregation_tout_~tmp~28#1;havoc cfhsi_aggregation_tout_#t~nondet650#1;call cfhsi_aggregation_tout_#t~mem651#1.base, cfhsi_aggregation_tout_#t~mem651#1.offset := read~$Pointer$(cfhsi_aggregation_tout_~cfhsi~9#1.base, 24 + cfhsi_aggregation_tout_~cfhsi~9#1.offset, 8);havoc cfhsi_aggregation_tout_#t~mem651#1.base, cfhsi_aggregation_tout_#t~mem651#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,122 INFO L272 TraceCheckUtils]: 8: Hoare triple {14087#true} call cfhsi_start_tx(cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset); {14253#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} is VALID [2022-02-20 21:53:29,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {14253#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~desc~0#1.base, ~desc~0#1.offset;havoc ~len~2#1;havoc ~res~0#1;call ~#descriptor~2#1.base, ~#descriptor~2#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~16#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~2#1;havoc ~__ret_warn_on~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;call #t~mem247#1.base, #t~mem247#1.offset := read~$Pointer$(~cfhsi#1.base, 489 + ~cfhsi#1.offset, 8);~desc~0#1.base, ~desc~0#1.offset := #t~mem247#1.base, #t~mem247#1.offset;havoc #t~mem247#1.base, #t~mem247#1.offset;call write~$Pointer$(24, 0, ~#descriptor~2#1.base, ~#descriptor~2#1.offset, 8);call write~$Pointer$(25, 0, ~#descriptor~2#1.base, 8 + ~#descriptor~2#1.offset, 8);call write~$Pointer$(26, 0, ~#descriptor~2#1.base, 16 + ~#descriptor~2#1.offset, 8);call write~$Pointer$(27, 0, ~#descriptor~2#1.base, 24 + ~#descriptor~2#1.offset, 8);call write~int(393, ~#descriptor~2#1.base, 32 + ~#descriptor~2#1.offset, 4);call write~int(1, ~#descriptor~2#1.base, 36 + ~#descriptor~2#1.offset, 1);call #t~mem248#1 := read~int(~#descriptor~2#1.base, 36 + ~#descriptor~2#1.offset, 1); {14087#true} is VALID [2022-02-20 21:53:29,122 INFO L272 TraceCheckUtils]: 10: Hoare triple {14087#true} call #t~ret249#1 := ldv__builtin_expect(#t~mem248#1 % 256, 0); {14087#true} is VALID [2022-02-20 21:53:29,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,123 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {14087#true} {14087#true} #2465#return; {14087#true} is VALID [2022-02-20 21:53:29,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {14087#true} assume -9223372036854775808 <= #t~ret249#1 && #t~ret249#1 <= 9223372036854775807;~tmp~16#1 := #t~ret249#1;havoc #t~mem248#1;havoc #t~ret249#1; {14087#true} is VALID [2022-02-20 21:53:29,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {14087#true} assume 0 != ~tmp~16#1;havoc #t~nondet250#1;call #t~mem251#1.base, #t~mem251#1.offset := read~$Pointer$(~cfhsi#1.base, 24 + ~cfhsi#1.offset, 8);havoc #t~mem251#1.base, #t~mem251#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,124 INFO L272 TraceCheckUtils]: 16: Hoare triple {14087#true} call #t~ret252#1 := constant_test_bit(5, ~cfhsi#1.base, 1465 + ~cfhsi#1.offset); {14087#true} is VALID [2022-02-20 21:53:29,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {14087#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; {14087#true} is VALID [2022-02-20 21:53:29,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,124 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14087#true} {14087#true} #2467#return; {14087#true} is VALID [2022-02-20 21:53:29,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {14087#true} assume -2147483648 <= #t~ret252#1 && #t~ret252#1 <= 2147483647;~tmp___0~4#1 := #t~ret252#1;havoc #t~ret252#1; {14087#true} is VALID [2022-02-20 21:53:29,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {14087#true} assume !(0 != ~tmp___0~4#1); {14087#true} is VALID [2022-02-20 21:53:29,127 INFO L272 TraceCheckUtils]: 22: Hoare triple {14087#true} call #t~ret253#1 := cfhsi_tx_frm(~desc~0#1.base, ~desc~0#1.offset, ~cfhsi#1.base, ~cfhsi#1.offset); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~desc#1.base, ~desc#1.offset := #in~desc#1.base, #in~desc#1.offset;~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~nfrms~0#1;havoc ~pld_len~0#1;havoc ~skb~2#1.base, ~skb~2#1.offset;havoc ~pfrm~0#1.base, ~pfrm~0#1.offset;havoc ~info~1#1.base, ~info~1#1.offset;havoc ~hpad~1#1;havoc ~tpad~1#1;havoc ~pemb~0#1.base, ~pemb~0#1.offset;havoc ~info___0~0#1.base, ~info___0~0#1.offset;havoc ~hpad___0~0#1;havoc ~tpad___0~0#1;havoc ~tmp~15#1;~nfrms~0#1 := 0;~pld_len~0#1 := 0;~pfrm~0#1.base, ~pfrm~0#1.offset := ~desc#1.base, 128 + ~desc#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,129 INFO L272 TraceCheckUtils]: 24: Hoare triple {14087#true} call #t~ret195#1.base, #t~ret195#1.offset := cfhsi_dequeue(~cfhsi#1.base, ~cfhsi#1.offset); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~i~1#1;~i~1#1 := 0; {14087#true} is VALID [2022-02-20 21:53:29,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {14087#true} assume ~i~1#1 <= 3; {14087#true} is VALID [2022-02-20 21:53:29,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {14087#true} assume { :begin_inline_ldv_skb_dequeue_14 } true;ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset := ~cfhsi#1.base, 40 + ~cfhsi#1.offset + 88 * (if ~i~1#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~1#1 % 18446744073709551616 % 18446744073709551616 else ~i~1#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset, ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset, ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset;ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset := ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,131 INFO L272 TraceCheckUtils]: 28: Hoare triple {14087#true} call ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset := ldv_skb_alloc(); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~5#1.base, ~skb~5#1.offset;havoc ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,137 INFO L272 TraceCheckUtils]: 30: Hoare triple {14087#true} call #t~ret901#1.base, #t~ret901#1.offset := ldv_zalloc(248); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} assume true; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,145 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} {14087#true} #2603#return; {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} is VALID [2022-02-20 21:53:29,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} ~tmp___7~5#1.base, ~tmp___7~5#1.offset := #t~ret901#1.base, #t~ret901#1.offset;havoc #t~ret901#1.base, #t~ret901#1.offset;~skb~5#1.base, ~skb~5#1.offset := ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(~skb~5#1.base == 0 && ~skb~5#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~5#1.base, ~skb~5#1.offset;havoc ldv_set_add_#t~mem896#1.base, ldv_set_add_#t~mem896#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~6#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~6#1;ldv_set_add_~i~6#1 := 0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !false; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(ldv_set_add_~i~6#1 < ~last_index~0); {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~5#1.base, ~skb~5#1.offset; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} assume true; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,150 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} {14087#true} #2625#return; {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} is VALID [2022-02-20 21:53:29,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset := ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset := ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} #t~ret146#1.base, #t~ret146#1.offset := ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_14 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret146#1.base, #t~ret146#1.offset;havoc #t~ret146#1.base, #t~ret146#1.offset; {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} is VALID [2022-02-20 21:53:29,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} assume 0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616; {14088#false} is VALID [2022-02-20 21:53:29,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {14088#false} #res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,153 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14088#false} {14087#true} #2563#return; {14088#false} is VALID [2022-02-20 21:53:29,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {14088#false} ~skb~2#1.base, ~skb~2#1.offset := #t~ret195#1.base, #t~ret195#1.offset;havoc #t~ret195#1.base, #t~ret195#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume 0 == (~skb~2#1.base + ~skb~2#1.offset) % 18446744073709551616;#res#1 := 0; {14088#false} is VALID [2022-02-20 21:53:29,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,154 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14088#false} {14087#true} #2469#return; {14088#false} is VALID [2022-02-20 21:53:29,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {14088#false} assume -2147483648 <= #t~ret253#1 && #t~ret253#1 <= 2147483647;~len~2#1 := #t~ret253#1;havoc #t~ret253#1; {14088#false} is VALID [2022-02-20 21:53:29,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {14088#false} assume !(0 == ~len~2#1);call #t~mem263#1.base, #t~mem263#1.offset := read~$Pointer$(~cfhsi#1.base, 489 + ~cfhsi#1.offset, 8);call #t~mem264#1.base, #t~mem264#1.offset := read~$Pointer$(~cfhsi#1.base, 424 + ~cfhsi#1.offset, 8);call #t~mem265#1.base, #t~mem265#1.offset := read~$Pointer$(~cfhsi#1.base, 424 + ~cfhsi#1.offset, 8);call #t~mem266#1.base, #t~mem266#1.offset := read~$Pointer$(#t~mem265#1.base, 16 + #t~mem265#1.offset, 8); {14088#false} is VALID [2022-02-20 21:53:29,155 INFO L272 TraceCheckUtils]: 55: Hoare triple {14088#false} call #t~ret267#1 := ##fun~$Pointer$~X~int~X~$Pointer$~TO~int(#t~mem263#1.base, #t~mem263#1.offset, ~len~2#1, #t~mem264#1.base, #t~mem264#1.offset, #t~mem266#1.base, #t~mem266#1.offset); {14087#true} is VALID [2022-02-20 21:53:29,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {14087#true} #~677.base, #~677.offset := #in~677.base, #in~677.offset;#~678 := #in~678;#~679.base, #~679.offset := #in~679.base, #in~679.offset; {14087#true} is VALID [2022-02-20 21:53:29,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,155 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14087#true} {14088#false} #2485#return; {14088#false} is VALID [2022-02-20 21:53:29,155 INFO L290 TraceCheckUtils]: 59: Hoare triple {14088#false} assume -2147483648 <= #t~ret267#1 && #t~ret267#1 <= 2147483647;~res~0#1 := #t~ret267#1;havoc #t~mem263#1.base, #t~mem263#1.offset;havoc #t~mem264#1.base, #t~mem264#1.offset;havoc #t~mem265#1.base, #t~mem265#1.offset;havoc #t~mem266#1.base, #t~mem266#1.offset;havoc #t~ret267#1;~__ret_warn_on~0#1 := (if ~res~0#1 < 0 then 1 else 0); {14088#false} is VALID [2022-02-20 21:53:29,155 INFO L272 TraceCheckUtils]: 60: Hoare triple {14088#false} call #t~ret268#1 := ldv__builtin_expect((if 0 != ~__ret_warn_on~0#1 then 1 else 0), 0); {14087#true} is VALID [2022-02-20 21:53:29,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,156 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14087#true} {14088#false} #2487#return; {14088#false} is VALID [2022-02-20 21:53:29,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} assume -9223372036854775808 <= #t~ret268#1 && #t~ret268#1 <= 9223372036854775807;~tmp___3~0#1 := #t~ret268#1;havoc #t~ret268#1; {14088#false} is VALID [2022-02-20 21:53:29,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} assume !(0 != ~tmp___3~0#1); {14088#false} is VALID [2022-02-20 21:53:29,157 INFO L272 TraceCheckUtils]: 66: Hoare triple {14088#false} call #t~ret269#1 := ldv__builtin_expect((if 0 != ~__ret_warn_on~0#1 then 1 else 0), 0); {14087#true} is VALID [2022-02-20 21:53:29,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,157 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14087#true} {14088#false} #2491#return; {14088#false} is VALID [2022-02-20 21:53:29,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {14088#false} assume -9223372036854775808 <= #t~ret269#1 && #t~ret269#1 <= 9223372036854775807;~tmp___4~0#1 := #t~ret269#1;havoc #t~ret269#1; {14088#false} is VALID [2022-02-20 21:53:29,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {14088#false} assume 0 != ~tmp___4~0#1;havoc #t~nondet270#1;call #t~mem271#1.base, #t~mem271#1.offset := read~$Pointer$(~cfhsi#1.base, 24 + ~cfhsi#1.offset, 8);havoc #t~mem271#1.base, #t~mem271#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,158 INFO L290 TraceCheckUtils]: 72: Hoare triple {14088#false} assume !(~res~0#1 < 0); {14088#false} is VALID [2022-02-20 21:53:29,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} call ULTIMATE.dealloc(~#descriptor~2#1.base, ~#descriptor~2#1.offset);havoc ~#descriptor~2#1.base, ~#descriptor~2#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,158 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14088#false} {14087#true} #2613#return; {14088#false} is VALID [2022-02-20 21:53:29,158 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} call ULTIMATE.dealloc(cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset);havoc cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} assume { :end_inline_cfhsi_aggregation_tout } true; {14088#false} is VALID [2022-02-20 21:53:29,159 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,159 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14088#false} {14087#true} #2733#return; {14088#false} is VALID [2022-02-20 21:53:29,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {14087#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(102, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(9, 4);call #Ultimate.allocInit(22, 5);call #Ultimate.allocInit(224, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(46, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(5, 8);call write~init~int(37, 8, 0, 1);call write~init~int(115, 8, 1, 1);call write~init~int(46, 8, 2, 1);call write~init~int(10, 8, 3, 1);call write~init~int(0, 8, 4, 1);call #Ultimate.allocInit(22, 9);call #Ultimate.allocInit(9, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(224, 12);call #Ultimate.allocInit(5, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(46, 13, 2, 1);call write~init~int(10, 13, 3, 1);call write~init~int(0, 13, 4, 1);call #Ultimate.allocInit(5, 14);call write~init~int(37, 14, 0, 1);call write~init~int(115, 14, 1, 1);call write~init~int(46, 14, 2, 1);call write~init~int(10, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(17, 15);call #Ultimate.allocInit(35, 16);call #Ultimate.allocInit(17, 17);call #Ultimate.allocInit(26, 18);call #Ultimate.allocInit(17, 19);call #Ultimate.allocInit(40, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(41, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(15, 25);call #Ultimate.allocInit(224, 26);call #Ultimate.allocInit(5, 27);call write~init~int(37, 27, 0, 1);call write~init~int(115, 27, 1, 1);call write~init~int(46, 27, 2, 1);call write~init~int(10, 27, 3, 1);call write~init~int(0, 27, 4, 1);call #Ultimate.allocInit(5, 28);call write~init~int(37, 28, 0, 1);call write~init~int(115, 28, 1, 1);call write~init~int(46, 28, 2, 1);call write~init~int(10, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(15, 29);call #Ultimate.allocInit(224, 30);call #Ultimate.allocInit(18, 31);call #Ultimate.allocInit(15, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(14, 34);call #Ultimate.allocInit(224, 35);call #Ultimate.allocInit(5, 36);call write~init~int(37, 36, 0, 1);call write~init~int(115, 36, 1, 1);call write~init~int(46, 36, 2, 1);call write~init~int(10, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(5, 37);call write~init~int(37, 37, 0, 1);call write~init~int(115, 37, 1, 1);call write~init~int(46, 37, 2, 1);call write~init~int(10, 37, 3, 1);call write~init~int(0, 37, 4, 1);call #Ultimate.allocInit(14, 38);call #Ultimate.allocInit(9, 39);call #Ultimate.allocInit(17, 40);call #Ultimate.allocInit(224, 41);call #Ultimate.allocInit(5, 42);call write~init~int(37, 42, 0, 1);call write~init~int(115, 42, 1, 1);call write~init~int(46, 42, 2, 1);call write~init~int(10, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(5, 43);call write~init~int(37, 43, 0, 1);call write~init~int(115, 43, 1, 1);call write~init~int(46, 43, 2, 1);call write~init~int(10, 43, 3, 1);call write~init~int(0, 43, 4, 1);call #Ultimate.allocInit(17, 44);call #Ultimate.allocInit(25, 45);call #Ultimate.allocInit(14, 46);call #Ultimate.allocInit(21, 47);call #Ultimate.allocInit(14, 48);call #Ultimate.allocInit(21, 49);call #Ultimate.allocInit(14, 50);call #Ultimate.allocInit(36, 51);call #Ultimate.allocInit(12, 52);call #Ultimate.allocInit(224, 53);call #Ultimate.allocInit(39, 54);call #Ultimate.allocInit(14, 55);call #Ultimate.allocInit(36, 56);call #Ultimate.allocInit(44, 57);call #Ultimate.allocInit(224, 58);call #Ultimate.allocInit(25, 59);call #Ultimate.allocInit(13, 60);call #Ultimate.allocInit(21, 61);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(21, 63);call #Ultimate.allocInit(13, 64);call #Ultimate.allocInit(36, 65);call #Ultimate.allocInit(12, 66);call #Ultimate.allocInit(224, 67);call #Ultimate.allocInit(9, 68);call #Ultimate.allocInit(14, 69);call #Ultimate.allocInit(224, 70);call #Ultimate.allocInit(4, 71);call write~init~int(37, 71, 0, 1);call write~init~int(115, 71, 1, 1);call write~init~int(10, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(4, 72);call write~init~int(37, 72, 0, 1);call write~init~int(115, 72, 1, 1);call write~init~int(10, 72, 2, 1);call write~init~int(0, 72, 3, 1);call #Ultimate.allocInit(14, 73);call #Ultimate.allocInit(9, 74);call #Ultimate.allocInit(14, 75);call #Ultimate.allocInit(224, 76);call #Ultimate.allocInit(15, 77);call #Ultimate.allocInit(15, 78);call #Ultimate.allocInit(14, 79);call #Ultimate.allocInit(224, 80);call #Ultimate.allocInit(18, 81);call #Ultimate.allocInit(14, 82);call #Ultimate.allocInit(18, 83);call #Ultimate.allocInit(14, 84);call #Ultimate.allocInit(9, 85);call #Ultimate.allocInit(14, 86);call #Ultimate.allocInit(224, 87);call #Ultimate.allocInit(5, 88);call write~init~int(45, 88, 0, 1);call write~init~int(45, 88, 1, 1);call write~init~int(62, 88, 2, 1);call write~init~int(32, 88, 3, 1);call write~init~int(0, 88, 4, 1);call #Ultimate.allocInit(2, 89);call write~init~int(15, 89, 0, 1);call write~init~int(0, 89, 1, 1);call #Ultimate.allocInit(5, 90);call write~init~int(45, 90, 0, 1);call write~init~int(45, 90, 1, 1);call write~init~int(62, 90, 2, 1);call write~init~int(32, 90, 3, 1);call write~init~int(0, 90, 4, 1);call #Ultimate.allocInit(9, 91);call #Ultimate.allocInit(18, 92);call #Ultimate.allocInit(224, 93);call #Ultimate.allocInit(5, 94);call write~init~int(37, 94, 0, 1);call write~init~int(115, 94, 1, 1);call write~init~int(46, 94, 2, 1);call write~init~int(10, 94, 3, 1);call write~init~int(0, 94, 4, 1);call #Ultimate.allocInit(5, 95);call write~init~int(37, 95, 0, 1);call write~init~int(115, 95, 1, 1);call write~init~int(46, 95, 2, 1);call write~init~int(10, 95, 3, 1);call write~init~int(0, 95, 4, 1);call #Ultimate.allocInit(18, 96);call #Ultimate.allocInit(9, 97);call #Ultimate.allocInit(17, 98);call #Ultimate.allocInit(224, 99);call #Ultimate.allocInit(5, 100);call write~init~int(37, 100, 0, 1);call write~init~int(115, 100, 1, 1);call write~init~int(46, 100, 2, 1);call write~init~int(10, 100, 3, 1);call write~init~int(0, 100, 4, 1);call #Ultimate.allocInit(5, 101);call write~init~int(37, 101, 0, 1);call write~init~int(115, 101, 1, 1);call write~init~int(46, 101, 2, 1);call write~init~int(10, 101, 3, 1);call write~init~int(0, 101, 4, 1);call #Ultimate.allocInit(17, 102);call #Ultimate.allocInit(9, 103);call #Ultimate.allocInit(14, 104);call #Ultimate.allocInit(224, 105);call #Ultimate.allocInit(20, 106);call #Ultimate.allocInit(20, 107);call #Ultimate.allocInit(14, 108);call #Ultimate.allocInit(21, 109);call #Ultimate.allocInit(14, 110);call #Ultimate.allocInit(9, 111);call #Ultimate.allocInit(14, 112);call #Ultimate.allocInit(224, 113);call #Ultimate.allocInit(14, 114);call #Ultimate.allocInit(14, 115);call #Ultimate.allocInit(14, 116);call #Ultimate.allocInit(224, 117);call #Ultimate.allocInit(9, 118);call #Ultimate.allocInit(14, 119);call #Ultimate.allocInit(224, 120);call #Ultimate.allocInit(24, 121);call #Ultimate.allocInit(24, 122);call #Ultimate.allocInit(14, 123);call #Ultimate.allocInit(224, 124);call #Ultimate.allocInit(23, 125);call #Ultimate.allocInit(14, 126);call #Ultimate.allocInit(9, 127);call #Ultimate.allocInit(14, 128);call #Ultimate.allocInit(224, 129);call #Ultimate.allocInit(12, 130);call #Ultimate.allocInit(12, 131);call #Ultimate.allocInit(14, 132);call #Ultimate.allocInit(9, 133);call #Ultimate.allocInit(14, 134);call #Ultimate.allocInit(224, 135);call #Ultimate.allocInit(15, 136);call #Ultimate.allocInit(15, 137);call #Ultimate.allocInit(14, 138);call #Ultimate.allocInit(224, 139);call #Ultimate.allocInit(16, 140);call #Ultimate.allocInit(14, 141);call #Ultimate.allocInit(9, 142);call #Ultimate.allocInit(14, 143);call #Ultimate.allocInit(224, 144);call #Ultimate.allocInit(29, 145);call #Ultimate.allocInit(29, 146);call #Ultimate.allocInit(14, 147);call #Ultimate.allocInit(9, 148);call #Ultimate.allocInit(14, 149);call #Ultimate.allocInit(224, 150);call #Ultimate.allocInit(16, 151);call #Ultimate.allocInit(16, 152);call #Ultimate.allocInit(14, 153);call #Ultimate.allocInit(224, 154);call #Ultimate.allocInit(18, 155);call #Ultimate.allocInit(14, 156);call #Ultimate.allocInit(37, 157);call #Ultimate.allocInit(14, 158);call #Ultimate.allocInit(9, 159);call #Ultimate.allocInit(16, 160);call #Ultimate.allocInit(224, 161);call #Ultimate.allocInit(5, 162);call write~init~int(37, 162, 0, 1);call write~init~int(115, 162, 1, 1);call write~init~int(46, 162, 2, 1);call write~init~int(10, 162, 3, 1);call write~init~int(0, 162, 4, 1);call #Ultimate.allocInit(5, 163);call write~init~int(37, 163, 0, 1);call write~init~int(115, 163, 1, 1);call write~init~int(46, 163, 2, 1);call write~init~int(10, 163, 3, 1);call write~init~int(0, 163, 4, 1);call #Ultimate.allocInit(16, 164);call #Ultimate.allocInit(21, 165);call #Ultimate.allocInit(16, 166);call #Ultimate.allocInit(14, 167);call #Ultimate.allocInit(16, 168);call #Ultimate.allocInit(224, 169);call #Ultimate.allocInit(23, 170);call #Ultimate.allocInit(16, 171);call #Ultimate.allocInit(224, 172);call #Ultimate.allocInit(19, 173);call #Ultimate.allocInit(16, 174);call #Ultimate.allocInit(9, 175);call #Ultimate.allocInit(17, 176);call #Ultimate.allocInit(224, 177);call #Ultimate.allocInit(5, 178);call write~init~int(37, 178, 0, 1);call write~init~int(115, 178, 1, 1);call write~init~int(46, 178, 2, 1);call write~init~int(10, 178, 3, 1);call write~init~int(0, 178, 4, 1);call #Ultimate.allocInit(5, 179);call write~init~int(37, 179, 0, 1);call write~init~int(115, 179, 1, 1);call write~init~int(46, 179, 2, 1);call write~init~int(10, 179, 3, 1);call write~init~int(0, 179, 4, 1);call #Ultimate.allocInit(17, 180);call #Ultimate.allocInit(9, 181);call #Ultimate.allocInit(19, 182);call #Ultimate.allocInit(224, 183);call #Ultimate.allocInit(5, 184);call write~init~int(37, 184, 0, 1);call write~init~int(115, 184, 1, 1);call write~init~int(46, 184, 2, 1);call write~init~int(10, 184, 3, 1);call write~init~int(0, 184, 4, 1);call #Ultimate.allocInit(5, 185);call write~init~int(37, 185, 0, 1);call write~init~int(115, 185, 1, 1);call write~init~int(46, 185, 2, 1);call write~init~int(10, 185, 3, 1);call write~init~int(0, 185, 4, 1);call #Ultimate.allocInit(19, 186);call #Ultimate.allocInit(9, 187);call #Ultimate.allocInit(23, 188);call #Ultimate.allocInit(224, 189);call #Ultimate.allocInit(5, 190);call write~init~int(37, 190, 0, 1);call write~init~int(115, 190, 1, 1);call write~init~int(46, 190, 2, 1);call write~init~int(10, 190, 3, 1);call write~init~int(0, 190, 4, 1);call #Ultimate.allocInit(5, 191);call write~init~int(37, 191, 0, 1);call write~init~int(115, 191, 1, 1);call write~init~int(46, 191, 2, 1);call write~init~int(10, 191, 3, 1);call write~init~int(0, 191, 4, 1);call #Ultimate.allocInit(23, 192);call #Ultimate.allocInit(224, 193);call #Ultimate.allocInit(224, 194);call #Ultimate.allocInit(224, 195);call #Ultimate.allocInit(18, 196);call #Ultimate.allocInit(11, 197);call #Ultimate.allocInit(23, 198);call #Ultimate.allocInit(23, 199);call #Ultimate.allocInit(25, 200);call #Ultimate.allocInit(27, 201);call #Ultimate.allocInit(24, 202);call #Ultimate.allocInit(3, 203);call write~init~int(37, 203, 0, 1);call write~init~int(115, 203, 1, 1);call write~init~int(0, 203, 2, 1);call #Ultimate.allocInit(34, 204);call #Ultimate.allocInit(11, 205);call #Ultimate.allocInit(21, 206);call #Ultimate.allocInit(23, 207);call #Ultimate.allocInit(24, 208);call #Ultimate.allocInit(39, 209);call #Ultimate.allocInit(11, 210);call #Ultimate.allocInit(27, 211);call #Ultimate.allocInit(11, 212);call #Ultimate.allocInit(36, 213);call #Ultimate.allocInit(224, 214);call #Ultimate.allocInit(17, 215);call #Ultimate.allocInit(9, 216);call #Ultimate.allocInit(20, 217);call #Ultimate.allocInit(224, 218);call #Ultimate.allocInit(22, 219);call #Ultimate.allocInit(30, 220);call #Ultimate.allocInit(36, 221);call #Ultimate.allocInit(224, 222);call #Ultimate.allocInit(14, 223);call #Ultimate.allocInit(42, 224);call #Ultimate.allocInit(17, 225);call #Ultimate.allocInit(42, 226);call #Ultimate.allocInit(17, 227);call #Ultimate.allocInit(50, 228);call #Ultimate.allocInit(17, 229);call #Ultimate.allocInit(14, 230);call #Ultimate.allocInit(6, 231);call write~init~int(99, 231, 0, 1);call write~init~int(102, 231, 1, 1);call write~init~int(104, 231, 2, 1);call write~init~int(115, 231, 3, 1);call write~init~int(105, 231, 4, 1);call write~init~int(0, 231, 5, 1);~ldv_timer_list_3~0.base, ~ldv_timer_list_3~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_timer_state_3~0 := 0;~ldv_state_variable_2~0 := 0;~cfhsi_netdevops_group1~0.base, ~cfhsi_netdevops_group1~0.offset := 0, 0;~caif_hsi_link_ops_group1~0.base, ~caif_hsi_link_ops_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~caif_hsi_link_ops_group3~0.base, ~caif_hsi_link_ops_group3~0.offset := 0, 0;~ldv_timer_state_2~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2~0.base, ~ldv_timer_list_2~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ref_cnt~0 := 0;~caif_hsi_link_ops_group2~0.base, ~caif_hsi_link_ops_group2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~caif_hsi_link_ops_group0~0.base, ~caif_hsi_link_ops_group0~0.offset := 0, 0;~#hsi_default_config~0.base, ~#hsi_default_config~0.offset := 232, 0;call #Ultimate.allocInit(24, 232);call write~init~int(250, ~#hsi_default_config~0.base, ~#hsi_default_config~0.offset, 4);call write~init~int(1, ~#hsi_default_config~0.base, 4 + ~#hsi_default_config~0.offset, 4);call write~init~int(4, ~#hsi_default_config~0.base, 8 + ~#hsi_default_config~0.offset, 4);call write~init~int(4, ~#hsi_default_config~0.base, 12 + ~#hsi_default_config~0.offset, 4);call write~init~int(100, ~#hsi_default_config~0.base, 16 + ~#hsi_default_config~0.offset, 4);call write~init~int(50, ~#hsi_default_config~0.base, 20 + ~#hsi_default_config~0.offset, 4);~#cfhsi_list~0.base, ~#cfhsi_list~0.offset := 233, 0;call #Ultimate.allocInit(16, 233);call write~init~$Pointer$(~#cfhsi_list~0.base, ~#cfhsi_list~0.offset, ~#cfhsi_list~0.base, ~#cfhsi_list~0.offset, 8);call write~init~$Pointer$(~#cfhsi_list~0.base, ~#cfhsi_list~0.offset, ~#cfhsi_list~0.base, 8 + ~#cfhsi_list~0.offset, 8);~#cfhsi_netdevops~0.base, ~#cfhsi_netdevops~0.offset := 234, 0;call #Ultimate.allocInit(480, 234);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_uninit.base, #funAddr~cfhsi_uninit.offset, ~#cfhsi_netdevops~0.base, 8 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_open.base, #funAddr~cfhsi_open.offset, ~#cfhsi_netdevops~0.base, 16 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_close.base, #funAddr~cfhsi_close.offset, ~#cfhsi_netdevops~0.base, 24 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_xmit.base, #funAddr~cfhsi_xmit.offset, ~#cfhsi_netdevops~0.base, 32 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 40 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 48 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 56 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 64 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 72 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 80 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 88 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 96 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 104 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 112 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 120 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 128 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 136 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 144 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 152 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 160 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 168 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 176 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 184 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 192 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 200 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 208 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 216 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 224 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 232 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 240 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 248 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 256 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 264 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 272 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 280 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 288 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 296 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 304 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 312 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 320 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 328 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 336 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 344 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 352 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 360 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 368 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 376 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 384 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 392 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 400 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 408 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 416 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 424 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 432 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 440 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 448 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 456 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 464 + ~#cfhsi_netdevops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cfhsi_netdevops~0.base, 472 + ~#cfhsi_netdevops~0.offset, 8);~#caif_hsi_policy~0.base, ~#caif_hsi_policy~0.offset := 235, 0;call #Ultimate.allocInit(32, 235);call write~init~int(0, ~#caif_hsi_policy~0.base, ~#caif_hsi_policy~0.offset, 2);call write~init~int(0, ~#caif_hsi_policy~0.base, 2 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 4 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 6 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 8 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 10 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 12 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 14 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 16 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 18 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 20 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 22 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(3, ~#caif_hsi_policy~0.base, 24 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(4, ~#caif_hsi_policy~0.base, 26 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(0, ~#caif_hsi_policy~0.base, 28 + ~#caif_hsi_policy~0.offset, 2);call write~init~int(0, ~#caif_hsi_policy~0.base, 30 + ~#caif_hsi_policy~0.offset, 2);~#caif_hsi_link_ops~0.base, ~#caif_hsi_link_ops~0.offset := 236, 0;call #Ultimate.allocInit(176, 236);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 8 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(231, 0, ~#caif_hsi_link_ops~0.base, 16 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~int(1560, ~#caif_hsi_link_ops~0.base, 24 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~cfhsi_setup.base, #funAddr~cfhsi_setup.offset, ~#caif_hsi_link_ops~0.base, 32 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~int(7, ~#caif_hsi_link_ops~0.base, 40 + ~#caif_hsi_link_ops~0.offset, 4);call write~init~$Pointer$(~#caif_hsi_policy~0.base, ~#caif_hsi_policy~0.offset, ~#caif_hsi_link_ops~0.base, 44 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 52 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_newlink.base, #funAddr~caif_hsi_newlink.offset, ~#caif_hsi_link_ops~0.base, 60 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_changelink.base, #funAddr~caif_hsi_changelink.offset, ~#caif_hsi_link_ops~0.base, 68 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 76 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_get_size.base, #funAddr~caif_hsi_get_size.offset, ~#caif_hsi_link_ops~0.base, 84 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~caif_hsi_fill_info.base, #funAddr~caif_hsi_fill_info.offset, ~#caif_hsi_link_ops~0.base, 92 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 100 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 108 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 116 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 124 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~int(0, ~#caif_hsi_link_ops~0.base, 132 + ~#caif_hsi_link_ops~0.offset, 4);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 136 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 144 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 152 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 160 + ~#caif_hsi_link_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#caif_hsi_link_ops~0.base, 168 + ~#caif_hsi_link_ops~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 237, 0;call #Ultimate.allocInit(120, 237);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {14087#true} is VALID [2022-02-20 21:53:29,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret847#1.base, main_#t~ret847#1.offset, main_#t~ret848#1.base, main_#t~ret848#1.offset, main_#t~ret849#1.base, main_#t~ret849#1.offset, main_#t~nondet850#1, main_#t~switch851#1, main_#t~nondet852#1, main_#t~switch853#1, main_#t~ret854#1, main_#t~ret855#1, main_#t~ret856#1, main_#t~ret857#1, main_#t~ret858#1, main_#t~ret859#1, main_#t~ret860#1, main_#t~ret861#1, main_#t~ret862#1, main_#t~ret863#1, main_#t~ret864#1, main_#t~ret865#1, main_#t~ret866#1, main_#t~ret867#1, main_#t~ret868#1, main_#t~nondet869#1, main_#t~switch870#1, main_#t~ret871#1, main_#t~nondet872#1, main_#t~switch873#1, main_#t~ret874#1, main_#t~ret875#1, main_#t~ret876#1, main_#t~ret877#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~42#1.base, main_~tmp~42#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset, main_~tmp___2~14#1, main_~tmp___3~9#1, main_~tmp___4~7#1, main_~tmp___5~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~42#1.base, main_~tmp~42#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset;havoc main_~tmp___2~14#1;havoc main_~tmp___3~9#1;havoc main_~tmp___4~7#1;havoc main_~tmp___5~5#1; {14087#true} is VALID [2022-02-20 21:53:29,161 INFO L272 TraceCheckUtils]: 2: Hoare triple {14087#true} call main_#t~ret847#1.base, main_#t~ret847#1.offset := ldv_zalloc(232); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14087#true} is VALID [2022-02-20 21:53:29,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,162 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14087#true} {14087#true} #2691#return; {14087#true} is VALID [2022-02-20 21:53:29,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {14087#true} main_~tmp~42#1.base, main_~tmp~42#1.offset := main_#t~ret847#1.base, main_#t~ret847#1.offset;havoc main_#t~ret847#1.base, main_#t~ret847#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~42#1.base, main_~tmp~42#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,162 INFO L272 TraceCheckUtils]: 8: Hoare triple {14087#true} call main_#t~ret848#1.base, main_#t~ret848#1.offset := ldv_zalloc(7168); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14087#true} is VALID [2022-02-20 21:53:29,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,163 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14087#true} {14087#true} #2693#return; {14087#true} is VALID [2022-02-20 21:53:29,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {14087#true} main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset := main_#t~ret848#1.base, main_#t~ret848#1.offset;havoc main_#t~ret848#1.base, main_#t~ret848#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,164 INFO L272 TraceCheckUtils]: 14: Hoare triple {14087#true} call main_#t~ret849#1.base, main_#t~ret849#1.offset := ldv_zalloc(232); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14087#true} is VALID [2022-02-20 21:53:29,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,165 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14087#true} {14087#true} #2695#return; {14087#true} is VALID [2022-02-20 21:53:29,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {14087#true} main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset := main_#t~ret849#1.base, main_#t~ret849#1.offset;havoc main_#t~ret849#1.base, main_#t~ret849#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~16#1.base, main_~tmp___1~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {14087#true} is VALID [2022-02-20 21:53:29,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {14087#true} assume { :end_inline_ldv_set_init } true; {14087#true} is VALID [2022-02-20 21:53:29,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {14087#true} assume { :end_inline_ldv_initialize } true;~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 := 1;~ldv_state_variable_2~0 := 1;~ldv_state_variable_5~0 := 0; {14087#true} is VALID [2022-02-20 21:53:29,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {14087#true} assume -2147483648 <= main_#t~nondet850#1 && main_#t~nondet850#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet850#1;havoc main_#t~nondet850#1;main_#t~switch851#1 := 0 == main_~tmp___2~14#1; {14087#true} is VALID [2022-02-20 21:53:29,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {14087#true} assume !main_#t~switch851#1;main_#t~switch851#1 := main_#t~switch851#1 || 1 == main_~tmp___2~14#1; {14087#true} is VALID [2022-02-20 21:53:29,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {14087#true} assume main_#t~switch851#1; {14087#true} is VALID [2022-02-20 21:53:29,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {14087#true} assume 0 != ~ldv_state_variable_1~0;assume { :begin_inline_choose_timer_1 } true;choose_timer_1_#in~timer#1.base, choose_timer_1_#in~timer#1.offset := ~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset;havoc choose_timer_1_#t~mem841#1, choose_timer_1_#t~mem842#1.base, choose_timer_1_#t~mem842#1.offset, choose_timer_1_~timer#1.base, choose_timer_1_~timer#1.offset;choose_timer_1_~timer#1.base, choose_timer_1_~timer#1.offset := choose_timer_1_#in~timer#1.base, choose_timer_1_#in~timer#1.offset;~LDV_IN_INTERRUPT~0 := 2;call choose_timer_1_#t~mem841#1 := read~int(choose_timer_1_~timer#1.base, 40 + choose_timer_1_~timer#1.offset, 8);call choose_timer_1_#t~mem842#1.base, choose_timer_1_#t~mem842#1.offset := read~$Pointer$(choose_timer_1_~timer#1.base, 32 + choose_timer_1_~timer#1.offset, 8); {14087#true} is VALID [2022-02-20 21:53:29,168 INFO L272 TraceCheckUtils]: 26: Hoare triple {14087#true} call ##fun~int~TO~VOID(choose_timer_1_#t~mem841#1, choose_timer_1_#t~mem842#1.base, choose_timer_1_#t~mem842#1.offset); {14182#(and (= |old(abs_6304)| abs_6304) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(abs_6145)| abs_6145) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} is VALID [2022-02-20 21:53:29,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {14182#(and (= |old(abs_6304)| abs_6304) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(abs_6145)| abs_6145) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} #~840#1 := #in~840#1; {14087#true} is VALID [2022-02-20 21:53:29,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {14087#true} assume #in~#fp#1.base == #funAddr~cfhsi_aggregation_tout.base && #in~#fp#1.offset == #funAddr~cfhsi_aggregation_tout.offset;assume { :begin_inline_cfhsi_aggregation_tout } true;cfhsi_aggregation_tout_#in~arg#1 := #~840#1;havoc cfhsi_aggregation_tout_#t~mem648#1, cfhsi_aggregation_tout_#t~ret649#1, cfhsi_aggregation_tout_#t~nondet650#1, cfhsi_aggregation_tout_#t~mem651#1.base, cfhsi_aggregation_tout_#t~mem651#1.offset, cfhsi_aggregation_tout_~arg#1, cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset, cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset, cfhsi_aggregation_tout_~tmp~28#1;cfhsi_aggregation_tout_~arg#1 := cfhsi_aggregation_tout_#in~arg#1;havoc cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset;call cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset := #Ultimate.allocOnStack(37);havoc cfhsi_aggregation_tout_~tmp~28#1;cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset := 0, (if cfhsi_aggregation_tout_~arg#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then cfhsi_aggregation_tout_~arg#1 % 18446744073709551616 % 18446744073709551616 else cfhsi_aggregation_tout_~arg#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);call write~$Pointer$(187, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~$Pointer$(188, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, 8 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~$Pointer$(189, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, 16 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~$Pointer$(190, 0, cfhsi_aggregation_tout_~#descriptor~12#1.base, 24 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 8);call write~int(1066, cfhsi_aggregation_tout_~#descriptor~12#1.base, 32 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 4);call write~int(1, cfhsi_aggregation_tout_~#descriptor~12#1.base, 36 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 1);call cfhsi_aggregation_tout_#t~mem648#1 := read~int(cfhsi_aggregation_tout_~#descriptor~12#1.base, 36 + cfhsi_aggregation_tout_~#descriptor~12#1.offset, 1); {14087#true} is VALID [2022-02-20 21:53:29,168 INFO L272 TraceCheckUtils]: 29: Hoare triple {14087#true} call cfhsi_aggregation_tout_#t~ret649#1 := ldv__builtin_expect(cfhsi_aggregation_tout_#t~mem648#1 % 256, 0); {14087#true} is VALID [2022-02-20 21:53:29,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,169 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14087#true} {14087#true} #2611#return; {14087#true} is VALID [2022-02-20 21:53:29,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {14087#true} assume -9223372036854775808 <= cfhsi_aggregation_tout_#t~ret649#1 && cfhsi_aggregation_tout_#t~ret649#1 <= 9223372036854775807;cfhsi_aggregation_tout_~tmp~28#1 := cfhsi_aggregation_tout_#t~ret649#1;havoc cfhsi_aggregation_tout_#t~mem648#1;havoc cfhsi_aggregation_tout_#t~ret649#1; {14087#true} is VALID [2022-02-20 21:53:29,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {14087#true} assume 0 != cfhsi_aggregation_tout_~tmp~28#1;havoc cfhsi_aggregation_tout_#t~nondet650#1;call cfhsi_aggregation_tout_#t~mem651#1.base, cfhsi_aggregation_tout_#t~mem651#1.offset := read~$Pointer$(cfhsi_aggregation_tout_~cfhsi~9#1.base, 24 + cfhsi_aggregation_tout_~cfhsi~9#1.offset, 8);havoc cfhsi_aggregation_tout_#t~mem651#1.base, cfhsi_aggregation_tout_#t~mem651#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,170 INFO L272 TraceCheckUtils]: 35: Hoare triple {14087#true} call cfhsi_start_tx(cfhsi_aggregation_tout_~cfhsi~9#1.base, cfhsi_aggregation_tout_~cfhsi~9#1.offset); {14253#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} is VALID [2022-02-20 21:53:29,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {14253#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~desc~0#1.base, ~desc~0#1.offset;havoc ~len~2#1;havoc ~res~0#1;call ~#descriptor~2#1.base, ~#descriptor~2#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~16#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~2#1;havoc ~__ret_warn_on~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;call #t~mem247#1.base, #t~mem247#1.offset := read~$Pointer$(~cfhsi#1.base, 489 + ~cfhsi#1.offset, 8);~desc~0#1.base, ~desc~0#1.offset := #t~mem247#1.base, #t~mem247#1.offset;havoc #t~mem247#1.base, #t~mem247#1.offset;call write~$Pointer$(24, 0, ~#descriptor~2#1.base, ~#descriptor~2#1.offset, 8);call write~$Pointer$(25, 0, ~#descriptor~2#1.base, 8 + ~#descriptor~2#1.offset, 8);call write~$Pointer$(26, 0, ~#descriptor~2#1.base, 16 + ~#descriptor~2#1.offset, 8);call write~$Pointer$(27, 0, ~#descriptor~2#1.base, 24 + ~#descriptor~2#1.offset, 8);call write~int(393, ~#descriptor~2#1.base, 32 + ~#descriptor~2#1.offset, 4);call write~int(1, ~#descriptor~2#1.base, 36 + ~#descriptor~2#1.offset, 1);call #t~mem248#1 := read~int(~#descriptor~2#1.base, 36 + ~#descriptor~2#1.offset, 1); {14087#true} is VALID [2022-02-20 21:53:29,171 INFO L272 TraceCheckUtils]: 37: Hoare triple {14087#true} call #t~ret249#1 := ldv__builtin_expect(#t~mem248#1 % 256, 0); {14087#true} is VALID [2022-02-20 21:53:29,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,171 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14087#true} {14087#true} #2465#return; {14087#true} is VALID [2022-02-20 21:53:29,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {14087#true} assume -9223372036854775808 <= #t~ret249#1 && #t~ret249#1 <= 9223372036854775807;~tmp~16#1 := #t~ret249#1;havoc #t~mem248#1;havoc #t~ret249#1; {14087#true} is VALID [2022-02-20 21:53:29,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {14087#true} assume 0 != ~tmp~16#1;havoc #t~nondet250#1;call #t~mem251#1.base, #t~mem251#1.offset := read~$Pointer$(~cfhsi#1.base, 24 + ~cfhsi#1.offset, 8);havoc #t~mem251#1.base, #t~mem251#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,172 INFO L272 TraceCheckUtils]: 43: Hoare triple {14087#true} call #t~ret252#1 := constant_test_bit(5, ~cfhsi#1.base, 1465 + ~cfhsi#1.offset); {14087#true} is VALID [2022-02-20 21:53:29,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {14087#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; {14087#true} is VALID [2022-02-20 21:53:29,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,172 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14087#true} {14087#true} #2467#return; {14087#true} is VALID [2022-02-20 21:53:29,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {14087#true} assume -2147483648 <= #t~ret252#1 && #t~ret252#1 <= 2147483647;~tmp___0~4#1 := #t~ret252#1;havoc #t~ret252#1; {14087#true} is VALID [2022-02-20 21:53:29,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {14087#true} assume !(0 != ~tmp___0~4#1); {14087#true} is VALID [2022-02-20 21:53:29,174 INFO L272 TraceCheckUtils]: 49: Hoare triple {14087#true} call #t~ret253#1 := cfhsi_tx_frm(~desc~0#1.base, ~desc~0#1.offset, ~cfhsi#1.base, ~cfhsi#1.offset); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~desc#1.base, ~desc#1.offset := #in~desc#1.base, #in~desc#1.offset;~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~nfrms~0#1;havoc ~pld_len~0#1;havoc ~skb~2#1.base, ~skb~2#1.offset;havoc ~pfrm~0#1.base, ~pfrm~0#1.offset;havoc ~info~1#1.base, ~info~1#1.offset;havoc ~hpad~1#1;havoc ~tpad~1#1;havoc ~pemb~0#1.base, ~pemb~0#1.offset;havoc ~info___0~0#1.base, ~info___0~0#1.offset;havoc ~hpad___0~0#1;havoc ~tpad___0~0#1;havoc ~tmp~15#1;~nfrms~0#1 := 0;~pld_len~0#1 := 0;~pfrm~0#1.base, ~pfrm~0#1.offset := ~desc#1.base, 128 + ~desc#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,175 INFO L272 TraceCheckUtils]: 51: Hoare triple {14087#true} call #t~ret195#1.base, #t~ret195#1.offset := cfhsi_dequeue(~cfhsi#1.base, ~cfhsi#1.offset); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~cfhsi#1.base, ~cfhsi#1.offset := #in~cfhsi#1.base, #in~cfhsi#1.offset;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~i~1#1;~i~1#1 := 0; {14087#true} is VALID [2022-02-20 21:53:29,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {14087#true} assume ~i~1#1 <= 3; {14087#true} is VALID [2022-02-20 21:53:29,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {14087#true} assume { :begin_inline_ldv_skb_dequeue_14 } true;ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset := ~cfhsi#1.base, 40 + ~cfhsi#1.offset + 88 * (if ~i~1#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~1#1 % 18446744073709551616 % 18446744073709551616 else ~i~1#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset, ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset, ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset;ldv_skb_dequeue_14_~ldv_func_arg1#1.base, ldv_skb_dequeue_14_~ldv_func_arg1#1.offset := ldv_skb_dequeue_14_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_14_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,177 INFO L272 TraceCheckUtils]: 55: Hoare triple {14087#true} call ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset := ldv_skb_alloc(); {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:29,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {14299#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~5#1.base, ~skb~5#1.offset;havoc ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14087#true} is VALID [2022-02-20 21:53:29,178 INFO L272 TraceCheckUtils]: 57: Hoare triple {14087#true} call #t~ret901#1.base, #t~ret901#1.offset := ldv_zalloc(248); {14181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:29,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {14181#(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~5#1.base, ~tmp~5#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet94#1 && #t~nondet94#1 <= 2147483647;~tmp___0~1#1 := #t~nondet94#1;havoc #t~nondet94#1; {14087#true} is VALID [2022-02-20 21:53:29,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {14087#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} assume true; {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,180 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14348#(and (<= 0 (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|)) (<= (+ |ldv_zalloc_#res#1.offset| |ldv_zalloc_#res#1.base|) 0))} {14087#true} #2603#return; {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} is VALID [2022-02-20 21:53:29,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {14345#(and (<= (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|) 0) (<= 0 (+ |ldv_skb_alloc_#t~ret901#1.offset| |ldv_skb_alloc_#t~ret901#1.base|)))} ~tmp___7~5#1.base, ~tmp___7~5#1.offset := #t~ret901#1.base, #t~ret901#1.offset;havoc #t~ret901#1.base, #t~ret901#1.offset;~skb~5#1.base, ~skb~5#1.offset := ~tmp___7~5#1.base, ~tmp___7~5#1.offset; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(~skb~5#1.base == 0 && ~skb~5#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~5#1.base, ~skb~5#1.offset;havoc ldv_set_add_#t~mem896#1.base, ldv_set_add_#t~mem896#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~6#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~6#1;ldv_set_add_~i~6#1 := 0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !false; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume !(ldv_set_add_~i~6#1 < ~last_index~0); {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,183 INFO L290 TraceCheckUtils]: 66: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} is VALID [2022-02-20 21:53:29,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {14346#(and (<= (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|) 0) (<= 0 (+ |ldv_skb_alloc_~skb~5#1.base| |ldv_skb_alloc_~skb~5#1.offset|)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~5#1.base, ~skb~5#1.offset; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} assume true; {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,185 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14347#(and (<= 0 (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|)) (<= (+ |ldv_skb_alloc_#res#1.offset| |ldv_skb_alloc_#res#1.base|) 0))} {14087#true} #2625#return; {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} is VALID [2022-02-20 21:53:29,185 INFO L290 TraceCheckUtils]: 70: Hoare triple {14338#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.base| |cfhsi_dequeue_ldv_skb_dequeue_14_#t~ret878#1.offset|) 0))} ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset := ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;havoc ldv_skb_dequeue_14_#t~ret878#1.base, ldv_skb_dequeue_14_#t~ret878#1.offset;ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset := ldv_skb_dequeue_14_~tmp~43#1.base, ldv_skb_dequeue_14_~tmp~43#1.offset; {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} is VALID [2022-02-20 21:53:29,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {14339#(and (<= 0 (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|)) (<= (+ |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.offset| |cfhsi_dequeue_ldv_skb_dequeue_14_#res#1.base|) 0))} #t~ret146#1.base, #t~ret146#1.offset := ldv_skb_dequeue_14_#res#1.base, ldv_skb_dequeue_14_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_14 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret146#1.base, #t~ret146#1.offset;havoc #t~ret146#1.base, #t~ret146#1.offset; {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} is VALID [2022-02-20 21:53:29,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {14340#(and (not (<= (+ 1 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616)) 0)) (<= (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) (* 18446744073709551616 (div (+ |cfhsi_dequeue_~skb~0#1.offset| |cfhsi_dequeue_~skb~0#1.base|) 18446744073709551616))))} assume 0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616; {14088#false} is VALID [2022-02-20 21:53:29,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} #res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,188 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,188 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14088#false} {14087#true} #2563#return; {14088#false} is VALID [2022-02-20 21:53:29,188 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} ~skb~2#1.base, ~skb~2#1.offset := #t~ret195#1.base, #t~ret195#1.offset;havoc #t~ret195#1.base, #t~ret195#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,188 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} assume 0 == (~skb~2#1.base + ~skb~2#1.offset) % 18446744073709551616;#res#1 := 0; {14088#false} is VALID [2022-02-20 21:53:29,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,188 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14088#false} {14087#true} #2469#return; {14088#false} is VALID [2022-02-20 21:53:29,189 INFO L290 TraceCheckUtils]: 80: Hoare triple {14088#false} assume -2147483648 <= #t~ret253#1 && #t~ret253#1 <= 2147483647;~len~2#1 := #t~ret253#1;havoc #t~ret253#1; {14088#false} is VALID [2022-02-20 21:53:29,189 INFO L290 TraceCheckUtils]: 81: Hoare triple {14088#false} assume !(0 == ~len~2#1);call #t~mem263#1.base, #t~mem263#1.offset := read~$Pointer$(~cfhsi#1.base, 489 + ~cfhsi#1.offset, 8);call #t~mem264#1.base, #t~mem264#1.offset := read~$Pointer$(~cfhsi#1.base, 424 + ~cfhsi#1.offset, 8);call #t~mem265#1.base, #t~mem265#1.offset := read~$Pointer$(~cfhsi#1.base, 424 + ~cfhsi#1.offset, 8);call #t~mem266#1.base, #t~mem266#1.offset := read~$Pointer$(#t~mem265#1.base, 16 + #t~mem265#1.offset, 8); {14088#false} is VALID [2022-02-20 21:53:29,189 INFO L272 TraceCheckUtils]: 82: Hoare triple {14088#false} call #t~ret267#1 := ##fun~$Pointer$~X~int~X~$Pointer$~TO~int(#t~mem263#1.base, #t~mem263#1.offset, ~len~2#1, #t~mem264#1.base, #t~mem264#1.offset, #t~mem266#1.base, #t~mem266#1.offset); {14087#true} is VALID [2022-02-20 21:53:29,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {14087#true} #~677.base, #~677.offset := #in~677.base, #in~677.offset;#~678 := #in~678;#~679.base, #~679.offset := #in~679.base, #in~679.offset; {14087#true} is VALID [2022-02-20 21:53:29,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,189 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {14087#true} {14088#false} #2485#return; {14088#false} is VALID [2022-02-20 21:53:29,190 INFO L290 TraceCheckUtils]: 86: Hoare triple {14088#false} assume -2147483648 <= #t~ret267#1 && #t~ret267#1 <= 2147483647;~res~0#1 := #t~ret267#1;havoc #t~mem263#1.base, #t~mem263#1.offset;havoc #t~mem264#1.base, #t~mem264#1.offset;havoc #t~mem265#1.base, #t~mem265#1.offset;havoc #t~mem266#1.base, #t~mem266#1.offset;havoc #t~ret267#1;~__ret_warn_on~0#1 := (if ~res~0#1 < 0 then 1 else 0); {14088#false} is VALID [2022-02-20 21:53:29,190 INFO L272 TraceCheckUtils]: 87: Hoare triple {14088#false} call #t~ret268#1 := ldv__builtin_expect((if 0 != ~__ret_warn_on~0#1 then 1 else 0), 0); {14087#true} is VALID [2022-02-20 21:53:29,190 INFO L290 TraceCheckUtils]: 88: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,190 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14087#true} {14088#false} #2487#return; {14088#false} is VALID [2022-02-20 21:53:29,190 INFO L290 TraceCheckUtils]: 91: Hoare triple {14088#false} assume -9223372036854775808 <= #t~ret268#1 && #t~ret268#1 <= 9223372036854775807;~tmp___3~0#1 := #t~ret268#1;havoc #t~ret268#1; {14088#false} is VALID [2022-02-20 21:53:29,191 INFO L290 TraceCheckUtils]: 92: Hoare triple {14088#false} assume !(0 != ~tmp___3~0#1); {14088#false} is VALID [2022-02-20 21:53:29,191 INFO L272 TraceCheckUtils]: 93: Hoare triple {14088#false} call #t~ret269#1 := ldv__builtin_expect((if 0 != ~__ret_warn_on~0#1 then 1 else 0), 0); {14087#true} is VALID [2022-02-20 21:53:29,191 INFO L290 TraceCheckUtils]: 94: Hoare triple {14087#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {14087#true} is VALID [2022-02-20 21:53:29,191 INFO L290 TraceCheckUtils]: 95: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-02-20 21:53:29,191 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14087#true} {14088#false} #2491#return; {14088#false} is VALID [2022-02-20 21:53:29,191 INFO L290 TraceCheckUtils]: 97: Hoare triple {14088#false} assume -9223372036854775808 <= #t~ret269#1 && #t~ret269#1 <= 9223372036854775807;~tmp___4~0#1 := #t~ret269#1;havoc #t~ret269#1; {14088#false} is VALID [2022-02-20 21:53:29,192 INFO L290 TraceCheckUtils]: 98: Hoare triple {14088#false} assume 0 != ~tmp___4~0#1;havoc #t~nondet270#1;call #t~mem271#1.base, #t~mem271#1.offset := read~$Pointer$(~cfhsi#1.base, 24 + ~cfhsi#1.offset, 8);havoc #t~mem271#1.base, #t~mem271#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,192 INFO L290 TraceCheckUtils]: 99: Hoare triple {14088#false} assume !(~res~0#1 < 0); {14088#false} is VALID [2022-02-20 21:53:29,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {14088#false} call ULTIMATE.dealloc(~#descriptor~2#1.base, ~#descriptor~2#1.offset);havoc ~#descriptor~2#1.base, ~#descriptor~2#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,192 INFO L290 TraceCheckUtils]: 101: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,192 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14088#false} {14087#true} #2613#return; {14088#false} is VALID [2022-02-20 21:53:29,193 INFO L290 TraceCheckUtils]: 103: Hoare triple {14088#false} call ULTIMATE.dealloc(cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset);havoc cfhsi_aggregation_tout_~#descriptor~12#1.base, cfhsi_aggregation_tout_~#descriptor~12#1.offset; {14088#false} is VALID [2022-02-20 21:53:29,193 INFO L290 TraceCheckUtils]: 104: Hoare triple {14088#false} assume { :end_inline_cfhsi_aggregation_tout } true; {14088#false} is VALID [2022-02-20 21:53:29,193 INFO L290 TraceCheckUtils]: 105: Hoare triple {14088#false} assume true; {14088#false} is VALID [2022-02-20 21:53:29,193 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {14088#false} {14087#true} #2733#return; {14088#false} is VALID [2022-02-20 21:53:29,193 INFO L290 TraceCheckUtils]: 107: Hoare triple {14088#false} havoc choose_timer_1_#t~mem841#1;havoc choose_timer_1_#t~mem842#1.base, choose_timer_1_#t~mem842#1.offset;~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_state_1~0 := 2; {14088#false} is VALID [2022-02-20 21:53:29,193 INFO L290 TraceCheckUtils]: 108: Hoare triple {14088#false} assume { :end_inline_choose_timer_1 } true; {14088#false} is VALID [2022-02-20 21:53:29,194 INFO L290 TraceCheckUtils]: 109: Hoare triple {14088#false} assume -2147483648 <= main_#t~nondet850#1 && main_#t~nondet850#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet850#1;havoc main_#t~nondet850#1;main_#t~switch851#1 := 0 == main_~tmp___2~14#1; {14088#false} is VALID [2022-02-20 21:53:29,194 INFO L290 TraceCheckUtils]: 110: Hoare triple {14088#false} assume !main_#t~switch851#1;main_#t~switch851#1 := main_#t~switch851#1 || 1 == main_~tmp___2~14#1; {14088#false} is VALID [2022-02-20 21:53:29,194 INFO L290 TraceCheckUtils]: 111: Hoare triple {14088#false} assume !main_#t~switch851#1;main_#t~switch851#1 := main_#t~switch851#1 || 2 == main_~tmp___2~14#1; {14088#false} is VALID [2022-02-20 21:53:29,194 INFO L290 TraceCheckUtils]: 112: Hoare triple {14088#false} assume main_#t~switch851#1; {14088#false} is VALID [2022-02-20 21:53:29,194 INFO L290 TraceCheckUtils]: 113: Hoare triple {14088#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet869#1 && main_#t~nondet869#1 <= 2147483647;main_~tmp___4~7#1 := main_#t~nondet869#1;havoc main_#t~nondet869#1;main_#t~switch870#1 := 0 == main_~tmp___4~7#1; {14088#false} is VALID [2022-02-20 21:53:29,195 INFO L290 TraceCheckUtils]: 114: Hoare triple {14088#false} assume !main_#t~switch870#1;main_#t~switch870#1 := main_#t~switch870#1 || 1 == main_~tmp___4~7#1; {14088#false} is VALID [2022-02-20 21:53:29,195 INFO L290 TraceCheckUtils]: 115: Hoare triple {14088#false} assume main_#t~switch870#1; {14088#false} is VALID [2022-02-20 21:53:29,195 INFO L290 TraceCheckUtils]: 116: Hoare triple {14088#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cfhsi_init_module } true;havoc cfhsi_init_module_#res#1;havoc cfhsi_init_module_#t~ret826#1, cfhsi_init_module_~tmp~39#1;havoc cfhsi_init_module_~tmp~39#1;assume { :begin_inline_rtnl_link_register } true;rtnl_link_register_#in~arg0#1.base, rtnl_link_register_#in~arg0#1.offset := ~#caif_hsi_link_ops~0.base, ~#caif_hsi_link_ops~0.offset;havoc rtnl_link_register_#res#1;havoc rtnl_link_register_#t~nondet926#1, rtnl_link_register_~arg0#1.base, rtnl_link_register_~arg0#1.offset;rtnl_link_register_~arg0#1.base, rtnl_link_register_~arg0#1.offset := rtnl_link_register_#in~arg0#1.base, rtnl_link_register_#in~arg0#1.offset;assume -2147483648 <= rtnl_link_register_#t~nondet926#1 && rtnl_link_register_#t~nondet926#1 <= 2147483647;rtnl_link_register_#res#1 := rtnl_link_register_#t~nondet926#1;havoc rtnl_link_register_#t~nondet926#1; {14088#false} is VALID [2022-02-20 21:53:29,195 INFO L290 TraceCheckUtils]: 117: Hoare triple {14088#false} cfhsi_init_module_#t~ret826#1 := rtnl_link_register_#res#1;assume { :end_inline_rtnl_link_register } true;assume -2147483648 <= cfhsi_init_module_#t~ret826#1 && cfhsi_init_module_#t~ret826#1 <= 2147483647;cfhsi_init_module_~tmp~39#1 := cfhsi_init_module_#t~ret826#1;havoc cfhsi_init_module_#t~ret826#1;cfhsi_init_module_#res#1 := cfhsi_init_module_~tmp~39#1; {14088#false} is VALID [2022-02-20 21:53:29,195 INFO L290 TraceCheckUtils]: 118: Hoare triple {14088#false} main_#t~ret871#1 := cfhsi_init_module_#res#1;assume { :end_inline_cfhsi_init_module } true;assume -2147483648 <= main_#t~ret871#1 && main_#t~ret871#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret871#1;havoc main_#t~ret871#1; {14088#false} is VALID [2022-02-20 21:53:29,195 INFO L290 TraceCheckUtils]: 119: Hoare triple {14088#false} assume !(0 == ~ldv_retval_0~0); {14088#false} is VALID [2022-02-20 21:53:29,196 INFO L290 TraceCheckUtils]: 120: Hoare triple {14088#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {14088#false} is VALID [2022-02-20 21:53:29,196 INFO L290 TraceCheckUtils]: 121: Hoare triple {14088#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret905#1, ldv_check_final_state_~tmp___7~9#1;havoc ldv_check_final_state_~tmp___7~9#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {14088#false} is VALID [2022-02-20 21:53:29,196 INFO L290 TraceCheckUtils]: 122: Hoare triple {14088#false} ldv_check_final_state_#t~ret905#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret905#1 && ldv_check_final_state_#t~ret905#1 <= 2147483647;ldv_check_final_state_~tmp___7~9#1 := ldv_check_final_state_#t~ret905#1;havoc ldv_check_final_state_#t~ret905#1; {14088#false} is VALID [2022-02-20 21:53:29,196 INFO L290 TraceCheckUtils]: 123: Hoare triple {14088#false} assume !(0 != ldv_check_final_state_~tmp___7~9#1); {14088#false} is VALID [2022-02-20 21:53:29,196 INFO L272 TraceCheckUtils]: 124: Hoare triple {14088#false} call ldv_error(); {14088#false} is VALID [2022-02-20 21:53:29,196 INFO L290 TraceCheckUtils]: 125: Hoare triple {14088#false} assume !false; {14088#false} is VALID [2022-02-20 21:53:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-20 21:53:29,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:29,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825237041] [2022-02-20 21:53:29,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825237041] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:29,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:29,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 21:53:29,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010745941] [2022-02-20 21:53:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2022-02-20 21:53:29,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:29,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 21:53:29,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:29,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 21:53:29,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 21:53:29,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:53:29,325 INFO L87 Difference]: Start difference. First operand 2233 states and 3176 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15)