./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.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 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:53:50,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:53:50,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:53:50,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:53:50,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:53:50,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:53:50,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:53:50,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:53:50,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:53:50,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:53:50,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:53:50,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:53:50,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:53:50,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:53:50,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:53:50,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:53:50,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:53:50,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:53:50,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:53:50,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:53:50,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:53:50,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:53:50,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:53:50,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:53:50,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:53:50,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:53:50,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:53:50,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:53:50,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:53:50,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:53:50,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:53:50,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:53:50,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:53:50,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:53:50,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:53:50,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:53:50,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:53:50,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:53:50,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:53:50,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:53:50,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:53:50,754 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:53:50,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:53:50,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:53:50,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:53:50,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:53:50,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:53:50,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:53:50,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:53:50,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:53:50,786 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:53:50,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:53:50,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:53:50,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:53:50,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:53:50,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:53:50,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:53:50,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:53:50,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:53:50,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:53:50,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:53:50,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:53:50,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:53:50,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:50,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:53:50,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:53:50,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:53:50,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:53:50,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:53:50,790 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:53:50,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:53:50,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:53:50,791 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 -> 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 [2022-02-20 21:53:51,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:53:51,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:53:51,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:53:51,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:53:51,071 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:53:51,072 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-02-20 21:53:51,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8686eba90/e974307e9e1f4ca3b25933244b428081/FLAG66126bc43 [2022-02-20 21:53:51,809 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:53:51,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-02-20 21:53:51,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8686eba90/e974307e9e1f4ca3b25933244b428081/FLAG66126bc43 [2022-02-20 21:53:52,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8686eba90/e974307e9e1f4ca3b25933244b428081 [2022-02-20 21:53:52,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:53:52,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:53:52,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:52,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:53:52,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:53:52,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:52" (1/1) ... [2022-02-20 21:53:52,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@607ef72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:52, skipping insertion in model container [2022-02-20 21:53:52,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:52" (1/1) ... [2022-02-20 21:53:52,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:53:52,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:53:52,793 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-02-20 21:53:53,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:53,117 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:53:53,239 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-02-20 21:53:53,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:53,359 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:53:53,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53 WrapperNode [2022-02-20 21:53:53,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:53,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:53,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:53:53,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:53:53,369 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:53:53" (1/1) ... [2022-02-20 21:53:53,408 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:53:53" (1/1) ... [2022-02-20 21:53:53,485 INFO L137 Inliner]: procedures = 88, calls = 403, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 1034 [2022-02-20 21:53:53,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:53,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:53:53,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:53:53,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:53:53,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:53:53,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:53:53,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:53:53,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:53:53,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (1/1) ... [2022-02-20 21:53:53,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:53,634 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:53:53,656 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:53:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-02-20 21:53:53,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-02-20 21:53:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:53:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure load_pkt [2022-02-20 21:53:53,673 INFO L138 BoogieDeclarations]: Found implementation of procedure load_pkt [2022-02-20 21:53:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:53:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:53:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:53:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:53:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:53:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:53:53,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:53:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:53:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:53:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:53:53,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:53:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:53:53,675 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:53:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:53:53,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:53:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-02-20 21:53:53,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-02-20 21:53:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:53:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:53:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:53:53,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:53:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure type_trans [2022-02-20 21:53:53,677 INFO L138 BoogieDeclarations]: Found implementation of procedure type_trans [2022-02-20 21:53:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:53:53,677 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:53:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:53:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:53:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:53:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:53:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:53:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:53:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:53:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:53:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:53:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-02-20 21:53:53,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-02-20 21:53:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:53:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:53:53,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:53:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-02-20 21:53:53,680 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-02-20 21:53:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:53:53,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:53:54,010 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:53:54,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:53:54,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:53:55,166 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:53:55,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:53:55,177 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:53:55,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:55 BoogieIcfgContainer [2022-02-20 21:53:55,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:53:55,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:53:55,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:53:55,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:53:55,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:53:52" (1/3) ... [2022-02-20 21:53:55,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150f9e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:55, skipping insertion in model container [2022-02-20 21:53:55,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:53" (2/3) ... [2022-02-20 21:53:55,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150f9e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:55, skipping insertion in model container [2022-02-20 21:53:55,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:55" (3/3) ... [2022-02-20 21:53:55,188 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-02-20 21:53:55,192 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:53:55,192 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:53:55,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:53:55,252 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:55,252 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:53:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 21:53:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 21:53:55,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:55,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:55,290 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 722424881, now seen corresponding path program 1 times [2022-02-20 21:53:55,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:55,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991728549] [2022-02-20 21:53:55,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:55,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {308#true} is VALID [2022-02-20 21:53:55,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {308#true} is VALID [2022-02-20 21:53:55,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2022-02-20 21:53:55,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #831#return; {308#true} is VALID [2022-02-20 21:53:55,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {308#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {308#true} is VALID [2022-02-20 21:53:55,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {308#true} is VALID [2022-02-20 21:53:55,700 INFO L272 TraceCheckUtils]: 2: Hoare triple {308#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {315#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:55,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {315#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {308#true} is VALID [2022-02-20 21:53:55,701 INFO L290 TraceCheckUtils]: 4: Hoare triple {308#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {308#true} is VALID [2022-02-20 21:53:55,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {308#true} assume true; {308#true} is VALID [2022-02-20 21:53:55,701 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {308#true} {308#true} #831#return; {308#true} is VALID [2022-02-20 21:53:55,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {308#true} is VALID [2022-02-20 21:53:55,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#true} assume { :end_inline_ldv_set_init } true; {308#true} is VALID [2022-02-20 21:53:55,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {308#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {308#true} is VALID [2022-02-20 21:53:55,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#true} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {308#true} is VALID [2022-02-20 21:53:55,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {308#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {314#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:55,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {314#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:55,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {314#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:55,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch240#1; {314#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:55,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {314#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {314#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:55,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {314#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch248#1; {314#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:55,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {314#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {309#false} is VALID [2022-02-20 21:53:55,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {309#false} assume { :end_inline_arcnet_unregister_proto } true; {309#false} is VALID [2022-02-20 21:53:55,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {309#false} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {309#false} is VALID [2022-02-20 21:53:55,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {309#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {309#false} is VALID [2022-02-20 21:53:55,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {309#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {309#false} is VALID [2022-02-20 21:53:55,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {309#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {309#false} is VALID [2022-02-20 21:53:55,711 INFO L272 TraceCheckUtils]: 23: Hoare triple {309#false} call ldv_error(); {309#false} is VALID [2022-02-20 21:53:55,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {309#false} assume !false; {309#false} is VALID [2022-02-20 21:53:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:53:55,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:55,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991728549] [2022-02-20 21:53:55,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991728549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:55,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:55,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:53:55,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739962819] [2022-02-20 21:53:55,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:55,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 21:53:55,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:55,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:53:55,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:55,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:53:55,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:53:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:53:55,804 INFO L87 Difference]: Start difference. First operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:53:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:58,553 INFO L93 Difference]: Finished difference Result 947 states and 1418 transitions. [2022-02-20 21:53:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:53:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 21:53:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:53:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1418 transitions. [2022-02-20 21:53:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:53:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1418 transitions. [2022-02-20 21:53:58,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1418 transitions. [2022-02-20 21:53:59,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1418 edges. 1418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:59,997 INFO L225 Difference]: With dead ends: 947 [2022-02-20 21:53:59,998 INFO L226 Difference]: Without dead ends: 633 [2022-02-20 21:54:00,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:54:00,005 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 503 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:00,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 1034 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 21:54:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-02-20 21:54:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 565. [2022-02-20 21:54:00,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:00,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:00,069 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:00,071 INFO L87 Difference]: Start difference. First operand 633 states. Second operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:00,110 INFO L93 Difference]: Finished difference Result 633 states and 906 transitions. [2022-02-20 21:54:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 906 transitions. [2022-02-20 21:54:00,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:00,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:00,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 633 states. [2022-02-20 21:54:00,120 INFO L87 Difference]: Start difference. First operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 633 states. [2022-02-20 21:54:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:00,155 INFO L93 Difference]: Finished difference Result 633 states and 906 transitions. [2022-02-20 21:54:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 906 transitions. [2022-02-20 21:54:00,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:00,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:00,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:00,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 801 transitions. [2022-02-20 21:54:00,192 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 801 transitions. Word has length 25 [2022-02-20 21:54:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:00,193 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 801 transitions. [2022-02-20 21:54:00,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:54:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 801 transitions. [2022-02-20 21:54:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 21:54:00,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:00,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:00,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:54:00,195 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1364109622, now seen corresponding path program 1 times [2022-02-20 21:54:00,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:00,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424632032] [2022-02-20 21:54:00,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:00,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {3531#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {3523#true} is VALID [2022-02-20 21:54:00,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {3523#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3523#true} is VALID [2022-02-20 21:54:00,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-02-20 21:54:00,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3523#true} {3523#true} #831#return; {3523#true} is VALID [2022-02-20 21:54:00,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {3523#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {3523#true} is VALID [2022-02-20 21:54:00,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {3523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {3523#true} is VALID [2022-02-20 21:54:00,322 INFO L272 TraceCheckUtils]: 2: Hoare triple {3523#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {3531#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:00,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {3531#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {3523#true} is VALID [2022-02-20 21:54:00,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {3523#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3523#true} is VALID [2022-02-20 21:54:00,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-02-20 21:54:00,323 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3523#true} {3523#true} #831#return; {3523#true} is VALID [2022-02-20 21:54:00,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {3523#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {3523#true} is VALID [2022-02-20 21:54:00,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {3523#true} assume { :end_inline_ldv_set_init } true; {3523#true} is VALID [2022-02-20 21:54:00,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {3523#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {3523#true} is VALID [2022-02-20 21:54:00,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {3523#true} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {3523#true} is VALID [2022-02-20 21:54:00,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {3523#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {3523#true} is VALID [2022-02-20 21:54:00,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {3523#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {3523#true} is VALID [2022-02-20 21:54:00,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {3523#true} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {3523#true} is VALID [2022-02-20 21:54:00,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {3523#true} assume main_#t~switch240#1; {3523#true} is VALID [2022-02-20 21:54:00,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {3523#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {3523#true} is VALID [2022-02-20 21:54:00,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {3523#true} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {3523#true} is VALID [2022-02-20 21:54:00,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {3523#true} assume main_#t~switch248#1; {3523#true} is VALID [2022-02-20 21:54:00,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {3523#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {3523#true} is VALID [2022-02-20 21:54:00,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#true} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {3523#true} is VALID [2022-02-20 21:54:00,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {3523#true} arcnet_rfc1201_init_#res#1 := 0; {3529#(= |ULTIMATE.start_arcnet_rfc1201_init_#res#1| 0)} is VALID [2022-02-20 21:54:00,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {3529#(= |ULTIMATE.start_arcnet_rfc1201_init_#res#1| 0)} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {3530#(= ~ldv_retval_0~0 0)} is VALID [2022-02-20 21:54:00,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {3530#(= ~ldv_retval_0~0 0)} assume !(0 == ~ldv_retval_0~0); {3524#false} is VALID [2022-02-20 21:54:00,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {3524#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {3524#false} is VALID [2022-02-20 21:54:00,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {3524#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {3524#false} is VALID [2022-02-20 21:54:00,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {3524#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {3524#false} is VALID [2022-02-20 21:54:00,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {3524#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {3524#false} is VALID [2022-02-20 21:54:00,329 INFO L272 TraceCheckUtils]: 27: Hoare triple {3524#false} call ldv_error(); {3524#false} is VALID [2022-02-20 21:54:00,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {3524#false} assume !false; {3524#false} is VALID [2022-02-20 21:54:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:54:00,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:00,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424632032] [2022-02-20 21:54:00,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424632032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:00,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:00,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:54:00,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496745684] [2022-02-20 21:54:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:00,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-20 21:54:00,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:00,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:54:00,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:00,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:54:00,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:54:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:54:00,361 INFO L87 Difference]: Start difference. First operand 565 states and 801 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:54:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:03,427 INFO L93 Difference]: Finished difference Result 1189 states and 1695 transitions. [2022-02-20 21:54:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:54:03,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-20 21:54:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:54:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1140 transitions. [2022-02-20 21:54:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:54:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1140 transitions. [2022-02-20 21:54:03,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1140 transitions. [2022-02-20 21:54:04,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1140 edges. 1140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:04,472 INFO L225 Difference]: With dead ends: 1189 [2022-02-20 21:54:04,472 INFO L226 Difference]: Without dead ends: 632 [2022-02-20 21:54:04,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:54:04,475 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 701 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:04,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 1317 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 21:54:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-02-20 21:54:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 564. [2022-02-20 21:54:04,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:04,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 632 states. Second operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:04,505 INFO L74 IsIncluded]: Start isIncluded. First operand 632 states. Second operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:04,506 INFO L87 Difference]: Start difference. First operand 632 states. Second operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:04,533 INFO L93 Difference]: Finished difference Result 632 states and 902 transitions. [2022-02-20 21:54:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 902 transitions. [2022-02-20 21:54:04,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:04,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:04,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 632 states. [2022-02-20 21:54:04,538 INFO L87 Difference]: Start difference. First operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 632 states. [2022-02-20 21:54:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:04,564 INFO L93 Difference]: Finished difference Result 632 states and 902 transitions. [2022-02-20 21:54:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 902 transitions. [2022-02-20 21:54:04,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:04,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:04,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:04,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-02-20 21:54:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 797 transitions. [2022-02-20 21:54:04,595 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 797 transitions. Word has length 29 [2022-02-20 21:54:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:04,596 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 797 transitions. [2022-02-20 21:54:04,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:54:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 797 transitions. [2022-02-20 21:54:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 21:54:04,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:04,598 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:04,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:54:04,598 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2094845703, now seen corresponding path program 1 times [2022-02-20 21:54:04,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:04,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756294496] [2022-02-20 21:54:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:04,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {7050#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {7033#true} is VALID [2022-02-20 21:54:04,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {7033#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7033#true} is VALID [2022-02-20 21:54:04,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {7033#true} assume true; {7033#true} is VALID [2022-02-20 21:54:04,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7033#true} {7033#true} #831#return; {7033#true} is VALID [2022-02-20 21:54:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:54:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:04,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {7050#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {7033#true} is VALID [2022-02-20 21:54:04,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {7033#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7033#true} is VALID [2022-02-20 21:54:04,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {7033#true} assume true; {7033#true} is VALID [2022-02-20 21:54:04,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7033#true} {7039#(= ~last_index~0 0)} #889#return; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 21:54:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:04,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {7050#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {7033#true} is VALID [2022-02-20 21:54:04,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {7033#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7033#true} is VALID [2022-02-20 21:54:04,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {7033#true} assume true; {7033#true} is VALID [2022-02-20 21:54:04,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7033#true} {7039#(= ~last_index~0 0)} #891#return; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {7033#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {7033#true} is VALID [2022-02-20 21:54:04,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {7033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {7033#true} is VALID [2022-02-20 21:54:04,826 INFO L272 TraceCheckUtils]: 2: Hoare triple {7033#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {7050#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:04,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {7050#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {7033#true} is VALID [2022-02-20 21:54:04,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {7033#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7033#true} is VALID [2022-02-20 21:54:04,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {7033#true} assume true; {7033#true} is VALID [2022-02-20 21:54:04,827 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7033#true} {7033#true} #831#return; {7033#true} is VALID [2022-02-20 21:54:04,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {7033#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {7039#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {7039#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {7039#(= ~last_index~0 0)} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {7039#(= ~last_index~0 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {7039#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {7039#(= ~last_index~0 0)} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {7039#(= ~last_index~0 0)} assume main_#t~switch240#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {7039#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {7039#(= ~last_index~0 0)} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {7039#(= ~last_index~0 0)} assume main_#t~switch248#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {7039#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {7039#(= ~last_index~0 0)} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {7039#(= ~last_index~0 0)} arcnet_rfc1201_init_#res#1 := 0; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {7039#(= ~last_index~0 0)} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {7039#(= ~last_index~0 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset, ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset, ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,834 INFO L272 TraceCheckUtils]: 23: Hoare triple {7039#(= ~last_index~0 0)} call ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset := ldv_zalloc(20); {7050#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:04,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {7050#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {7033#true} is VALID [2022-02-20 21:54:04,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {7033#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7033#true} is VALID [2022-02-20 21:54:04,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {7033#true} assume true; {7033#true} is VALID [2022-02-20 21:54:04,837 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7033#true} {7039#(= ~last_index~0 0)} #889#return; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {7039#(= ~last_index~0 0)} ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset := ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,838 INFO L272 TraceCheckUtils]: 29: Hoare triple {7039#(= ~last_index~0 0)} call ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset := ldv_zalloc(3264); {7050#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:04,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {7050#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {7033#true} is VALID [2022-02-20 21:54:04,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {7033#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7033#true} is VALID [2022-02-20 21:54:04,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {7033#true} assume true; {7033#true} is VALID [2022-02-20 21:54:04,841 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7033#true} {7039#(= ~last_index~0 0)} #891#return; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {7039#(= ~last_index~0 0)} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {7039#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {7039#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_0~0); {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {7039#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {7039#(= ~last_index~0 0)} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {7039#(= ~last_index~0 0)} assume main_#t~switch240#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {7039#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {7039#(= ~last_index~0 0)} assume main_#t~switch248#1; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {7039#(= ~last_index~0 0)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {7039#(= ~last_index~0 0)} assume { :end_inline_arcnet_unregister_proto } true; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {7039#(= ~last_index~0 0)} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {7039#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:04,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {7039#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {7048#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} is VALID [2022-02-20 21:54:04,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {7048#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {7049#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| 0))} is VALID [2022-02-20 21:54:04,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {7049#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| 0))} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {7034#false} is VALID [2022-02-20 21:54:04,858 INFO L272 TraceCheckUtils]: 48: Hoare triple {7034#false} call ldv_error(); {7034#false} is VALID [2022-02-20 21:54:04,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {7034#false} assume !false; {7034#false} is VALID [2022-02-20 21:54:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 21:54:04,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:04,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756294496] [2022-02-20 21:54:04,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756294496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:04,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:04,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:54:04,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191022266] [2022-02-20 21:54:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:04,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-02-20 21:54:04,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:04,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:54:04,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:04,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:54:04,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:54:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:54:04,906 INFO L87 Difference]: Start difference. First operand 564 states and 797 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:54:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:08,414 INFO L93 Difference]: Finished difference Result 1799 states and 2590 transitions. [2022-02-20 21:54:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:54:08,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-02-20 21:54:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:54:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1336 transitions. [2022-02-20 21:54:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:54:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1336 transitions. [2022-02-20 21:54:08,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1336 transitions. [2022-02-20 21:54:09,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1336 edges. 1336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:09,688 INFO L225 Difference]: With dead ends: 1799 [2022-02-20 21:54:09,688 INFO L226 Difference]: Without dead ends: 1238 [2022-02-20 21:54:09,689 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:54:09,690 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 491 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:09,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 1756 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 21:54:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-02-20 21:54:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1138. [2022-02-20 21:54:09,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:09,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1238 states. Second operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) [2022-02-20 21:54:09,740 INFO L74 IsIncluded]: Start isIncluded. First operand 1238 states. Second operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) [2022-02-20 21:54:09,742 INFO L87 Difference]: Start difference. First operand 1238 states. Second operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) [2022-02-20 21:54:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:09,823 INFO L93 Difference]: Finished difference Result 1238 states and 1787 transitions. [2022-02-20 21:54:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1787 transitions. [2022-02-20 21:54:09,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:09,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:09,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) Second operand 1238 states. [2022-02-20 21:54:09,832 INFO L87 Difference]: Start difference. First operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) Second operand 1238 states. [2022-02-20 21:54:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:09,914 INFO L93 Difference]: Finished difference Result 1238 states and 1787 transitions. [2022-02-20 21:54:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1787 transitions. [2022-02-20 21:54:09,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:09,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:09,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:09,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) [2022-02-20 21:54:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1624 transitions. [2022-02-20 21:54:10,004 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1624 transitions. Word has length 50 [2022-02-20 21:54:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:10,006 INFO L470 AbstractCegarLoop]: Abstraction has 1138 states and 1624 transitions. [2022-02-20 21:54:10,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:54:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1624 transitions. [2022-02-20 21:54:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 21:54:10,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:10,015 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:10,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:54:10,016 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1849595463, now seen corresponding path program 1 times [2022-02-20 21:54:10,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:10,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134701419] [2022-02-20 21:54:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13259#true} {13259#true} #831#return; {13259#true} is VALID [2022-02-20 21:54:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:54:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {13259#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {13259#true} is VALID [2022-02-20 21:54:10,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13259#true} {13260#false} #845#return; {13260#false} is VALID [2022-02-20 21:54:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 21:54:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13259#true} {13259#true} #815#return; {13259#true} is VALID [2022-02-20 21:54:10,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {13299#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,183 INFO L272 TraceCheckUtils]: 1: Hoare triple {13259#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {13298#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:10,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,184 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13259#true} {13259#true} #815#return; {13259#true} is VALID [2022-02-20 21:54:10,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {13259#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {13259#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {13259#true} is VALID [2022-02-20 21:54:10,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {13259#true} assume !false; {13259#true} is VALID [2022-02-20 21:54:10,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {13259#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {13259#true} is VALID [2022-02-20 21:54:10,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {13259#true} 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; {13259#true} is VALID [2022-02-20 21:54:10,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {13259#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,185 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {13259#true} {13259#true} #899#return; {13259#true} is VALID [2022-02-20 21:54:10,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {13299#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {13259#true} is VALID [2022-02-20 21:54:10,186 INFO L272 TraceCheckUtils]: 1: Hoare triple {13259#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {13299#(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:54:10,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {13299#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,187 INFO L272 TraceCheckUtils]: 3: Hoare triple {13259#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {13298#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:10,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,188 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13259#true} {13259#true} #815#return; {13259#true} is VALID [2022-02-20 21:54:10,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {13259#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {13259#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {13259#true} is VALID [2022-02-20 21:54:10,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {13259#true} assume !false; {13259#true} is VALID [2022-02-20 21:54:10,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {13259#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {13259#true} is VALID [2022-02-20 21:54:10,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {13259#true} 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; {13259#true} is VALID [2022-02-20 21:54:10,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {13259#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,189 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13259#true} {13259#true} #899#return; {13259#true} is VALID [2022-02-20 21:54:10,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {13259#true} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {13259#true} is VALID [2022-02-20 21:54:10,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {13259#true} assume !(~tmp~11.base != 0 || ~tmp~11.offset != 0); {13259#true} is VALID [2022-02-20 21:54:10,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {13259#true} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {13259#true} is VALID [2022-02-20 21:54:10,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,191 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13259#true} {13260#false} #869#return; {13260#false} is VALID [2022-02-20 21:54:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-02-20 21:54:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13259#true} {13260#false} #889#return; {13260#false} is VALID [2022-02-20 21:54:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-02-20 21:54:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:10,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13259#true} {13260#false} #891#return; {13260#false} is VALID [2022-02-20 21:54:10,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {13259#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {13259#true} is VALID [2022-02-20 21:54:10,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {13259#true} is VALID [2022-02-20 21:54:10,207 INFO L272 TraceCheckUtils]: 2: Hoare triple {13259#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {13298#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:10,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,208 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13259#true} {13259#true} #831#return; {13259#true} is VALID [2022-02-20 21:54:10,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {13259#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {13259#true} is VALID [2022-02-20 21:54:10,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {13259#true} assume { :end_inline_ldv_set_init } true; {13259#true} is VALID [2022-02-20 21:54:10,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {13259#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {13259#true} is VALID [2022-02-20 21:54:10,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {13259#true} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {13259#true} is VALID [2022-02-20 21:54:10,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {13259#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {13265#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:54:10,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {13265#(= ~ldv_state_variable_1~0 0)} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {13265#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:54:10,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {13265#(= ~ldv_state_variable_1~0 0)} assume main_#t~switch240#1; {13265#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:54:10,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {13265#(= ~ldv_state_variable_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet241#1 && main_#t~nondet241#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet241#1;havoc main_#t~nondet241#1;main_#t~switch242#1 := 0 == main_~tmp___7~0#1; {13260#false} is VALID [2022-02-20 21:54:10,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {13260#false} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 1 == main_~tmp___7~0#1; {13260#false} is VALID [2022-02-20 21:54:10,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {13260#false} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 2 == main_~tmp___7~0#1; {13260#false} is VALID [2022-02-20 21:54:10,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {13260#false} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 3 == main_~tmp___7~0#1; {13260#false} is VALID [2022-02-20 21:54:10,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {13260#false} assume main_#t~switch242#1; {13260#false} is VALID [2022-02-20 21:54:10,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {13260#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset, rx_#t~mem45#1, rx_#t~mem46#1, rx_#t~nondet47#1, rx_#t~mem54#1.base, rx_#t~mem54#1.offset, rx_#t~mem55#1, rx_#t~mem56#1.base, rx_#t~mem56#1.offset, rx_#t~nondet57#1, rx_#t~mem58#1, rx_#t~mem59#1, rx_#t~mem60#1, rx_#t~mem61#1, rx_#t~mem62#1.base, rx_#t~mem62#1.offset, rx_#t~mem63#1, rx_#t~mem64#1, rx_#t~mem65#1, rx_#t~ret66#1.base, rx_#t~ret66#1.offset, rx_#t~nondet67#1, rx_#t~mem68#1, rx_#t~ret69#1.base, rx_#t~ret69#1.offset, rx_#t~mem70#1.base, rx_#t~mem70#1.offset, rx_#t~memcpy~res71#1.base, rx_#t~memcpy~res71#1.offset, rx_#t~memcpy~res72#1.base, rx_#t~memcpy~res72#1.offset, rx_#t~mem79#1.base, rx_#t~mem79#1.offset, rx_#t~mem80#1, rx_#t~mem81#1, rx_#t~mem82#1, rx_#t~short83#1, rx_#t~mem84#1, rx_#t~nondet85#1, rx_#t~mem86#1, rx_#t~nondet87#1, rx_#t~mem88#1, rx_#t~mem89#1, rx_#t~mem90#1, rx_#t~mem91#1, rx_#t~ret92#1, rx_#t~ret93#1, rx_#t~mem94#1.base, rx_#t~mem94#1.offset, rx_#t~mem95#1, rx_#t~mem96#1, rx_#t~short97#1, rx_#t~nondet98#1, rx_#t~mem99#1, rx_#t~mem100#1, rx_#t~mem101#1, rx_#t~mem102#1.base, rx_#t~mem102#1.offset, rx_#t~mem103#1, rx_#t~mem104#1, rx_#t~mem105#1, rx_#t~mem106#1.base, rx_#t~mem106#1.offset, rx_#t~nondet107#1, rx_#t~mem108#1, rx_#t~mem109#1, rx_#t~mem110#1, rx_#t~mem111#1, rx_#t~mem112#1, rx_#t~mem113#1.base, rx_#t~mem113#1.offset, rx_#t~mem114#1, rx_#t~mem115#1, rx_#t~mem116#1, rx_#t~nondet117#1, rx_#t~mem118#1, rx_#t~mem119#1, rx_#t~mem120#1, rx_#t~mem121#1, rx_#t~mem122#1, rx_#t~ret123#1.base, rx_#t~ret123#1.offset, rx_#t~nondet124#1, rx_#t~mem125#1, rx_#t~mem126#1, rx_#t~mem127#1.base, rx_#t~mem127#1.offset, rx_#t~memcpy~res128#1.base, rx_#t~memcpy~res128#1.offset, rx_#t~memcpy~res129#1.base, rx_#t~memcpy~res129#1.offset, rx_#t~ret130#1.base, rx_#t~ret130#1.offset, rx_#t~mem131#1, rx_#t~mem132#1.base, rx_#t~mem132#1.offset, rx_#t~mem133#1, rx_#t~mem134#1, rx_#t~nondet135#1, rx_#t~mem136#1, rx_#t~mem137#1, rx_#t~mem138#1, rx_#t~mem139#1, rx_#t~mem140#1, rx_#t~mem141#1, rx_#t~mem142#1, rx_#t~mem143#1, rx_#t~nondet144#1, rx_#t~mem145#1, rx_#t~mem146#1, rx_#t~mem147#1, rx_#t~nondet148#1, rx_#t~mem149#1, rx_#t~mem150#1, rx_#t~mem151#1, rx_#t~mem152#1, rx_#t~mem153#1.base, rx_#t~mem153#1.offset, rx_#t~mem154#1, rx_#t~mem155#1, rx_#t~mem156#1.base, rx_#t~mem156#1.offset, rx_#t~mem157#1.base, rx_#t~mem157#1.offset, rx_#t~mem158#1.base, rx_#t~mem158#1.offset, rx_#t~mem165#1.base, rx_#t~mem165#1.offset, rx_#t~mem166#1, rx_#t~mem167#1.base, rx_#t~mem167#1.offset, rx_#t~ret168#1.base, rx_#t~ret168#1.offset, rx_#t~mem169#1, rx_#t~mem170#1, rx_#t~ret171#1, rx_#t~ret172#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~1#1.base, rx_~pkt~1#1.offset, rx_~soft~1#1.base, rx_~soft~1#1.offset, rx_~saddr~0#1, rx_~ofs~0#1, rx_~in~0#1.base, rx_~in~0#1.offset, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~0#1.offset, rx_~arp~0#1.base, rx_~arp~0#1.offset, rx_~cptr~0#1.base, rx_~cptr~0#1.offset, rx_~tmp___0~2#1, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset, rx_~packetnum~0#1, rx_~tmp___1~0#1, rx_~tmp___2~0#1;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~1#1.base, rx_~pkt~1#1.offset;havoc rx_~soft~1#1.base, rx_~soft~1#1.offset;havoc rx_~saddr~0#1;havoc rx_~ofs~0#1;havoc rx_~in~0#1.base, rx_~in~0#1.offset;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset;havoc rx_~arp~0#1.base, rx_~arp~0#1.offset;havoc rx_~cptr~0#1.base, rx_~cptr~0#1.offset;havoc rx_~tmp___0~2#1;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;havoc rx_~packetnum~0#1;havoc rx_~tmp___1~0#1;havoc rx_~tmp___2~0#1; {13260#false} is VALID [2022-02-20 21:54:10,215 INFO L272 TraceCheckUtils]: 20: Hoare triple {13260#false} call rx_#t~ret44#1.base, rx_#t~ret44#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {13259#true} is VALID [2022-02-20 21:54:10,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {13259#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {13259#true} is VALID [2022-02-20 21:54:10,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,216 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13259#true} {13260#false} #845#return; {13260#false} is VALID [2022-02-20 21:54:10,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {13260#false} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret44#1.base, rx_#t~ret44#1.offset;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset;rx_~soft~1#1.base, rx_~soft~1#1.offset := rx_~pkthdr#1.base, 4 + rx_~pkthdr#1.offset;call rx_#t~mem45#1 := read~int(rx_~pkt~1#1.base, rx_~pkt~1#1.offset, 1);rx_~saddr~0#1 := rx_#t~mem45#1 % 256;havoc rx_#t~mem45#1;rx_~in~0#1.base, rx_~in~0#1.offset := rx_~lp~0#1.base, 440 + rx_~lp~0#1.offset + 12 * (if rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 else rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); {13260#false} is VALID [2022-02-20 21:54:10,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {13260#false} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {13260#false} is VALID [2022-02-20 21:54:10,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {13260#false} call rx_#t~mem46#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {13260#false} is VALID [2022-02-20 21:54:10,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {13260#false} assume !(255 == rx_#t~mem46#1 % 256 % 4294967296);havoc rx_#t~mem46#1; {13260#false} is VALID [2022-02-20 21:54:10,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {13260#false} call rx_#t~mem55#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {13260#false} is VALID [2022-02-20 21:54:10,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {13260#false} assume !(0 == rx_#t~mem55#1 % 256 % 4294967296);havoc rx_#t~mem55#1;call rx_#t~mem94#1.base, rx_#t~mem94#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8);rx_#t~short97#1 := 0 != (rx_#t~mem94#1.base + rx_#t~mem94#1.offset) % 18446744073709551616; {13260#false} is VALID [2022-02-20 21:54:10,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {13260#false} assume rx_#t~short97#1;call rx_#t~mem95#1 := read~int(rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);call rx_#t~mem96#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);rx_#t~short97#1 := rx_#t~mem95#1 % 65536 != rx_#t~mem96#1 % 65536; {13260#false} is VALID [2022-02-20 21:54:10,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {13260#false} assume !rx_#t~short97#1;havoc rx_#t~mem94#1.base, rx_#t~mem94#1.offset;havoc rx_#t~mem95#1;havoc rx_#t~mem96#1;havoc rx_#t~short97#1; {13260#false} is VALID [2022-02-20 21:54:10,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {13260#false} call rx_#t~mem105#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {13260#false} is VALID [2022-02-20 21:54:10,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {13260#false} assume 0 != rx_#t~mem105#1 % 256;havoc rx_#t~mem105#1;call rx_#t~mem106#1.base, rx_#t~mem106#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8); {13260#false} is VALID [2022-02-20 21:54:10,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {13260#false} assume !(0 != (rx_#t~mem106#1.base + rx_#t~mem106#1.offset) % 18446744073709551616);havoc rx_#t~mem106#1.base, rx_#t~mem106#1.offset; {13260#false} is VALID [2022-02-20 21:54:10,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {13260#false} call rx_#t~mem114#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem114#1, rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);havoc rx_#t~mem114#1;call rx_#t~mem115#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1);call write~int(2 + rx_#t~mem115#1 % 256 / 2 % 256, rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1);havoc rx_#t~mem115#1;call write~int(1, rx_~in~0#1.base, 10 + rx_~in~0#1.offset, 1);call rx_#t~mem116#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {13260#false} is VALID [2022-02-20 21:54:10,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {13260#false} assume !(rx_#t~mem116#1 % 256 % 4294967296 > 16);havoc rx_#t~mem116#1;call rx_#t~mem122#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {13260#false} is VALID [2022-02-20 21:54:10,218 INFO L272 TraceCheckUtils]: 37: Hoare triple {13260#false} call rx_#t~ret123#1.base, rx_#t~ret123#1.offset := ldv_alloc_skb_12(4 + 508 * (rx_#t~mem122#1 % 256), 32); {13299#(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:54:10,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {13299#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {13259#true} is VALID [2022-02-20 21:54:10,219 INFO L272 TraceCheckUtils]: 39: Hoare triple {13259#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {13299#(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:54:10,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {13299#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,220 INFO L272 TraceCheckUtils]: 41: Hoare triple {13259#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {13298#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:10,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,221 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13259#true} {13259#true} #815#return; {13259#true} is VALID [2022-02-20 21:54:10,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {13259#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {13259#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {13259#true} is VALID [2022-02-20 21:54:10,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {13259#true} assume !false; {13259#true} is VALID [2022-02-20 21:54:10,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {13259#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {13259#true} is VALID [2022-02-20 21:54:10,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {13259#true} 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; {13259#true} is VALID [2022-02-20 21:54:10,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {13259#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {13259#true} is VALID [2022-02-20 21:54:10,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,222 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13259#true} {13259#true} #899#return; {13259#true} is VALID [2022-02-20 21:54:10,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {13259#true} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {13259#true} is VALID [2022-02-20 21:54:10,227 INFO L290 TraceCheckUtils]: 55: Hoare triple {13259#true} assume !(~tmp~11.base != 0 || ~tmp~11.offset != 0); {13259#true} is VALID [2022-02-20 21:54:10,227 INFO L290 TraceCheckUtils]: 56: Hoare triple {13259#true} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {13259#true} is VALID [2022-02-20 21:54:10,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,228 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13259#true} {13260#false} #869#return; {13260#false} is VALID [2022-02-20 21:54:10,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {13260#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret123#1.base, rx_#t~ret123#1.offset;havoc rx_#t~mem122#1;havoc rx_#t~ret123#1.base, rx_#t~ret123#1.offset;call write~$Pointer$(rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~in~0#1.base, rx_~in~0#1.offset, 8); {13260#false} is VALID [2022-02-20 21:54:10,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {13260#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {13260#false} is VALID [2022-02-20 21:54:10,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {13260#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet124#1; {13260#false} is VALID [2022-02-20 21:54:10,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {13260#false} call rx_#t~mem125#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem125#1, rx_~lp~0#1.base, 438 + rx_~lp~0#1.offset, 2);havoc rx_#t~mem125#1;call rx_#t~mem126#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem126#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem126#1; {13260#false} is VALID [2022-02-20 21:54:10,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {13260#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {13260#false} is VALID [2022-02-20 21:54:10,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {13260#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {13260#false} is VALID [2022-02-20 21:54:10,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {13260#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {13260#false} is VALID [2022-02-20 21:54:10,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {13260#false} assume main_#t~switch240#1; {13260#false} is VALID [2022-02-20 21:54:10,239 INFO L290 TraceCheckUtils]: 67: Hoare triple {13260#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {13260#false} is VALID [2022-02-20 21:54:10,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {13260#false} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {13260#false} is VALID [2022-02-20 21:54:10,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {13260#false} assume main_#t~switch248#1; {13260#false} is VALID [2022-02-20 21:54:10,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {13260#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {13260#false} is VALID [2022-02-20 21:54:10,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {13260#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {13260#false} is VALID [2022-02-20 21:54:10,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {13260#false} arcnet_rfc1201_init_#res#1 := 0; {13260#false} is VALID [2022-02-20 21:54:10,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {13260#false} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {13260#false} is VALID [2022-02-20 21:54:10,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {13260#false} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset, ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset, ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {13260#false} is VALID [2022-02-20 21:54:10,241 INFO L272 TraceCheckUtils]: 75: Hoare triple {13260#false} call ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset := ldv_zalloc(20); {13298#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:10,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,243 INFO L290 TraceCheckUtils]: 78: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,243 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13259#true} {13260#false} #889#return; {13260#false} is VALID [2022-02-20 21:54:10,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {13260#false} ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset := ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset; {13260#false} is VALID [2022-02-20 21:54:10,244 INFO L272 TraceCheckUtils]: 81: Hoare triple {13260#false} call ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset := ldv_zalloc(3264); {13298#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:10,244 INFO L290 TraceCheckUtils]: 82: Hoare triple {13298#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {13259#true} is VALID [2022-02-20 21:54:10,244 INFO L290 TraceCheckUtils]: 83: Hoare triple {13259#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13259#true} is VALID [2022-02-20 21:54:10,244 INFO L290 TraceCheckUtils]: 84: Hoare triple {13259#true} assume true; {13259#true} is VALID [2022-02-20 21:54:10,244 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {13259#true} {13260#false} #891#return; {13260#false} is VALID [2022-02-20 21:54:10,244 INFO L290 TraceCheckUtils]: 86: Hoare triple {13260#false} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {13260#false} is VALID [2022-02-20 21:54:10,245 INFO L290 TraceCheckUtils]: 87: Hoare triple {13260#false} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {13260#false} is VALID [2022-02-20 21:54:10,245 INFO L290 TraceCheckUtils]: 88: Hoare triple {13260#false} assume !(0 != ~ldv_retval_0~0); {13260#false} is VALID [2022-02-20 21:54:10,245 INFO L290 TraceCheckUtils]: 89: Hoare triple {13260#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {13260#false} is VALID [2022-02-20 21:54:10,245 INFO L290 TraceCheckUtils]: 90: Hoare triple {13260#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {13260#false} is VALID [2022-02-20 21:54:10,245 INFO L290 TraceCheckUtils]: 91: Hoare triple {13260#false} assume main_#t~switch240#1; {13260#false} is VALID [2022-02-20 21:54:10,245 INFO L290 TraceCheckUtils]: 92: Hoare triple {13260#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {13260#false} is VALID [2022-02-20 21:54:10,246 INFO L290 TraceCheckUtils]: 93: Hoare triple {13260#false} assume main_#t~switch248#1; {13260#false} is VALID [2022-02-20 21:54:10,246 INFO L290 TraceCheckUtils]: 94: Hoare triple {13260#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {13260#false} is VALID [2022-02-20 21:54:10,246 INFO L290 TraceCheckUtils]: 95: Hoare triple {13260#false} assume { :end_inline_arcnet_unregister_proto } true; {13260#false} is VALID [2022-02-20 21:54:10,247 INFO L290 TraceCheckUtils]: 96: Hoare triple {13260#false} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {13260#false} is VALID [2022-02-20 21:54:10,247 INFO L290 TraceCheckUtils]: 97: Hoare triple {13260#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {13260#false} is VALID [2022-02-20 21:54:10,247 INFO L290 TraceCheckUtils]: 98: Hoare triple {13260#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {13260#false} is VALID [2022-02-20 21:54:10,247 INFO L290 TraceCheckUtils]: 99: Hoare triple {13260#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {13260#false} is VALID [2022-02-20 21:54:10,247 INFO L272 TraceCheckUtils]: 100: Hoare triple {13260#false} call ldv_error(); {13260#false} is VALID [2022-02-20 21:54:10,247 INFO L290 TraceCheckUtils]: 101: Hoare triple {13260#false} assume !false; {13260#false} is VALID [2022-02-20 21:54:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-20 21:54:10,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:10,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134701419] [2022-02-20 21:54:10,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134701419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:10,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:10,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:54:10,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909244645] [2022-02-20 21:54:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:10,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2022-02-20 21:54:10,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:10,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 21:54:10,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:10,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:54:10,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:10,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:54:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:54:10,334 INFO L87 Difference]: Start difference. First operand 1138 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 21:54:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:13,064 INFO L93 Difference]: Finished difference Result 1832 states and 2618 transitions. [2022-02-20 21:54:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:54:13,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2022-02-20 21:54:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 21:54:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2022-02-20 21:54:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 21:54:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2022-02-20 21:54:13,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 925 transitions. [2022-02-20 21:54:13,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 925 edges. 925 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:13,922 INFO L225 Difference]: With dead ends: 1832 [2022-02-20 21:54:13,922 INFO L226 Difference]: Without dead ends: 702 [2022-02-20 21:54:13,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:54:13,925 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 112 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:13,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1111 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 21:54:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-02-20 21:54:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 642. [2022-02-20 21:54:13,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:13,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 702 states. Second operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) [2022-02-20 21:54:13,948 INFO L74 IsIncluded]: Start isIncluded. First operand 702 states. Second operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) [2022-02-20 21:54:13,950 INFO L87 Difference]: Start difference. First operand 702 states. Second operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) [2022-02-20 21:54:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:13,980 INFO L93 Difference]: Finished difference Result 702 states and 1001 transitions. [2022-02-20 21:54:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1001 transitions. [2022-02-20 21:54:13,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:13,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:13,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) Second operand 702 states. [2022-02-20 21:54:13,985 INFO L87 Difference]: Start difference. First operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) Second operand 702 states. [2022-02-20 21:54:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:14,014 INFO L93 Difference]: Finished difference Result 702 states and 1001 transitions. [2022-02-20 21:54:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1001 transitions. [2022-02-20 21:54:14,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:14,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:14,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:14,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) [2022-02-20 21:54:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 910 transitions. [2022-02-20 21:54:14,072 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 910 transitions. Word has length 102 [2022-02-20 21:54:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:14,072 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 910 transitions. [2022-02-20 21:54:14,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 21:54:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 910 transitions. [2022-02-20 21:54:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 21:54:14,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:14,074 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:14,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:54:14,075 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1294257131, now seen corresponding path program 2 times [2022-02-20 21:54:14,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:14,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335129183] [2022-02-20 21:54:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17852#true} is VALID [2022-02-20 21:54:14,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17852#true} {17852#true} #831#return; {17852#true} is VALID [2022-02-20 21:54:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:54:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17852#true} is VALID [2022-02-20 21:54:14,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17852#true} {17852#true} #889#return; {17852#true} is VALID [2022-02-20 21:54:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 21:54:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17852#true} is VALID [2022-02-20 21:54:14,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17852#true} {17852#true} #891#return; {17852#true} is VALID [2022-02-20 21:54:14,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:54:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {17852#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {17852#true} is VALID [2022-02-20 21:54:14,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17852#true} {17852#true} #845#return; {17852#true} is VALID [2022-02-20 21:54:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:54:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:14,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {17852#true} #815#return; {17912#(and (<= 0 |ldv_skb_alloc_#t~ret260#1.offset|) (= |ldv_skb_alloc_#t~ret260#1.base| 0) (<= |ldv_skb_alloc_#t~ret260#1.offset| 0))} is VALID [2022-02-20 21:54:14,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {17891#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,405 INFO L272 TraceCheckUtils]: 1: Hoare triple {17852#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {17890#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:14,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,407 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {17852#true} #815#return; {17912#(and (<= 0 |ldv_skb_alloc_#t~ret260#1.offset|) (= |ldv_skb_alloc_#t~ret260#1.base| 0) (<= |ldv_skb_alloc_#t~ret260#1.offset| 0))} is VALID [2022-02-20 21:54:14,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {17912#(and (<= 0 |ldv_skb_alloc_#t~ret260#1.offset|) (= |ldv_skb_alloc_#t~ret260#1.base| 0) (<= |ldv_skb_alloc_#t~ret260#1.offset| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {17913#(and (<= |ldv_skb_alloc_~skb~1#1.offset| 0) (< 0 (+ |ldv_skb_alloc_~skb~1#1.offset| 1)) (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:54:14,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {17913#(and (<= |ldv_skb_alloc_~skb~1#1.offset| 0) (< 0 (+ |ldv_skb_alloc_~skb~1#1.offset| 1)) (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {17853#false} is VALID [2022-02-20 21:54:14,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {17853#false} assume !false; {17853#false} is VALID [2022-02-20 21:54:14,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {17853#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {17853#false} is VALID [2022-02-20 21:54:14,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {17853#false} 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; {17853#false} is VALID [2022-02-20 21:54:14,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {17853#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {17853#false} is VALID [2022-02-20 21:54:14,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {17853#false} assume true; {17853#false} is VALID [2022-02-20 21:54:14,410 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17853#false} {17852#true} #899#return; {17906#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} is VALID [2022-02-20 21:54:14,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {17891#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {17852#true} is VALID [2022-02-20 21:54:14,411 INFO L272 TraceCheckUtils]: 1: Hoare triple {17852#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {17891#(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:54:14,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {17891#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,412 INFO L272 TraceCheckUtils]: 3: Hoare triple {17852#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {17890#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:14,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,414 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {17852#true} #815#return; {17912#(and (<= 0 |ldv_skb_alloc_#t~ret260#1.offset|) (= |ldv_skb_alloc_#t~ret260#1.base| 0) (<= |ldv_skb_alloc_#t~ret260#1.offset| 0))} is VALID [2022-02-20 21:54:14,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {17912#(and (<= 0 |ldv_skb_alloc_#t~ret260#1.offset|) (= |ldv_skb_alloc_#t~ret260#1.base| 0) (<= |ldv_skb_alloc_#t~ret260#1.offset| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {17913#(and (<= |ldv_skb_alloc_~skb~1#1.offset| 0) (< 0 (+ |ldv_skb_alloc_~skb~1#1.offset| 1)) (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:54:14,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {17913#(and (<= |ldv_skb_alloc_~skb~1#1.offset| 0) (< 0 (+ |ldv_skb_alloc_~skb~1#1.offset| 1)) (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {17853#false} is VALID [2022-02-20 21:54:14,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {17853#false} assume !false; {17853#false} is VALID [2022-02-20 21:54:14,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {17853#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {17853#false} is VALID [2022-02-20 21:54:14,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {17853#false} 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; {17853#false} is VALID [2022-02-20 21:54:14,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {17853#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {17853#false} is VALID [2022-02-20 21:54:14,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {17853#false} assume true; {17853#false} is VALID [2022-02-20 21:54:14,416 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17853#false} {17852#true} #899#return; {17906#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} is VALID [2022-02-20 21:54:14,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {17906#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {17907#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} is VALID [2022-02-20 21:54:14,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {17907#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} assume !(~tmp~11.base != 0 || ~tmp~11.offset != 0); {17853#false} is VALID [2022-02-20 21:54:14,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {17853#false} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {17853#false} is VALID [2022-02-20 21:54:14,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {17853#false} assume true; {17853#false} is VALID [2022-02-20 21:54:14,423 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17853#false} {17852#true} #869#return; {17853#false} is VALID [2022-02-20 21:54:14,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {17852#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {17852#true} is VALID [2022-02-20 21:54:14,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {17852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {17852#true} is VALID [2022-02-20 21:54:14,424 INFO L272 TraceCheckUtils]: 2: Hoare triple {17852#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {17890#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:14,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17852#true} is VALID [2022-02-20 21:54:14,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,425 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17852#true} {17852#true} #831#return; {17852#true} is VALID [2022-02-20 21:54:14,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {17852#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {17852#true} is VALID [2022-02-20 21:54:14,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {17852#true} assume { :end_inline_ldv_set_init } true; {17852#true} is VALID [2022-02-20 21:54:14,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {17852#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {17852#true} is VALID [2022-02-20 21:54:14,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {17852#true} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {17852#true} is VALID [2022-02-20 21:54:14,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {17852#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {17852#true} is VALID [2022-02-20 21:54:14,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {17852#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {17852#true} is VALID [2022-02-20 21:54:14,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {17852#true} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {17852#true} is VALID [2022-02-20 21:54:14,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {17852#true} assume main_#t~switch240#1; {17852#true} is VALID [2022-02-20 21:54:14,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {17852#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {17852#true} is VALID [2022-02-20 21:54:14,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {17852#true} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {17852#true} is VALID [2022-02-20 21:54:14,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {17852#true} assume main_#t~switch248#1; {17852#true} is VALID [2022-02-20 21:54:14,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {17852#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {17852#true} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {17852#true} is VALID [2022-02-20 21:54:14,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {17852#true} arcnet_rfc1201_init_#res#1 := 0; {17852#true} is VALID [2022-02-20 21:54:14,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {17852#true} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {17852#true} is VALID [2022-02-20 21:54:14,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {17852#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset, ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset, ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,428 INFO L272 TraceCheckUtils]: 23: Hoare triple {17852#true} call ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset := ldv_zalloc(20); {17890#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:14,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17852#true} is VALID [2022-02-20 21:54:14,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,429 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17852#true} {17852#true} #889#return; {17852#true} is VALID [2022-02-20 21:54:14,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {17852#true} ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset := ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,430 INFO L272 TraceCheckUtils]: 29: Hoare triple {17852#true} call ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset := ldv_zalloc(3264); {17890#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:14,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17852#true} is VALID [2022-02-20 21:54:14,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,433 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17852#true} {17852#true} #891#return; {17852#true} is VALID [2022-02-20 21:54:14,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {17852#true} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {17852#true} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {17852#true} is VALID [2022-02-20 21:54:14,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {17852#true} assume !(0 != ~ldv_retval_0~0); {17852#true} is VALID [2022-02-20 21:54:14,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {17852#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {17852#true} is VALID [2022-02-20 21:54:14,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {17852#true} assume main_#t~switch240#1; {17852#true} is VALID [2022-02-20 21:54:14,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {17852#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet241#1 && main_#t~nondet241#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet241#1;havoc main_#t~nondet241#1;main_#t~switch242#1 := 0 == main_~tmp___7~0#1; {17852#true} is VALID [2022-02-20 21:54:14,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {17852#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 1 == main_~tmp___7~0#1; {17852#true} is VALID [2022-02-20 21:54:14,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {17852#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 2 == main_~tmp___7~0#1; {17852#true} is VALID [2022-02-20 21:54:14,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {17852#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 3 == main_~tmp___7~0#1; {17852#true} is VALID [2022-02-20 21:54:14,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {17852#true} assume main_#t~switch242#1; {17852#true} is VALID [2022-02-20 21:54:14,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {17852#true} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset, rx_#t~mem45#1, rx_#t~mem46#1, rx_#t~nondet47#1, rx_#t~mem54#1.base, rx_#t~mem54#1.offset, rx_#t~mem55#1, rx_#t~mem56#1.base, rx_#t~mem56#1.offset, rx_#t~nondet57#1, rx_#t~mem58#1, rx_#t~mem59#1, rx_#t~mem60#1, rx_#t~mem61#1, rx_#t~mem62#1.base, rx_#t~mem62#1.offset, rx_#t~mem63#1, rx_#t~mem64#1, rx_#t~mem65#1, rx_#t~ret66#1.base, rx_#t~ret66#1.offset, rx_#t~nondet67#1, rx_#t~mem68#1, rx_#t~ret69#1.base, rx_#t~ret69#1.offset, rx_#t~mem70#1.base, rx_#t~mem70#1.offset, rx_#t~memcpy~res71#1.base, rx_#t~memcpy~res71#1.offset, rx_#t~memcpy~res72#1.base, rx_#t~memcpy~res72#1.offset, rx_#t~mem79#1.base, rx_#t~mem79#1.offset, rx_#t~mem80#1, rx_#t~mem81#1, rx_#t~mem82#1, rx_#t~short83#1, rx_#t~mem84#1, rx_#t~nondet85#1, rx_#t~mem86#1, rx_#t~nondet87#1, rx_#t~mem88#1, rx_#t~mem89#1, rx_#t~mem90#1, rx_#t~mem91#1, rx_#t~ret92#1, rx_#t~ret93#1, rx_#t~mem94#1.base, rx_#t~mem94#1.offset, rx_#t~mem95#1, rx_#t~mem96#1, rx_#t~short97#1, rx_#t~nondet98#1, rx_#t~mem99#1, rx_#t~mem100#1, rx_#t~mem101#1, rx_#t~mem102#1.base, rx_#t~mem102#1.offset, rx_#t~mem103#1, rx_#t~mem104#1, rx_#t~mem105#1, rx_#t~mem106#1.base, rx_#t~mem106#1.offset, rx_#t~nondet107#1, rx_#t~mem108#1, rx_#t~mem109#1, rx_#t~mem110#1, rx_#t~mem111#1, rx_#t~mem112#1, rx_#t~mem113#1.base, rx_#t~mem113#1.offset, rx_#t~mem114#1, rx_#t~mem115#1, rx_#t~mem116#1, rx_#t~nondet117#1, rx_#t~mem118#1, rx_#t~mem119#1, rx_#t~mem120#1, rx_#t~mem121#1, rx_#t~mem122#1, rx_#t~ret123#1.base, rx_#t~ret123#1.offset, rx_#t~nondet124#1, rx_#t~mem125#1, rx_#t~mem126#1, rx_#t~mem127#1.base, rx_#t~mem127#1.offset, rx_#t~memcpy~res128#1.base, rx_#t~memcpy~res128#1.offset, rx_#t~memcpy~res129#1.base, rx_#t~memcpy~res129#1.offset, rx_#t~ret130#1.base, rx_#t~ret130#1.offset, rx_#t~mem131#1, rx_#t~mem132#1.base, rx_#t~mem132#1.offset, rx_#t~mem133#1, rx_#t~mem134#1, rx_#t~nondet135#1, rx_#t~mem136#1, rx_#t~mem137#1, rx_#t~mem138#1, rx_#t~mem139#1, rx_#t~mem140#1, rx_#t~mem141#1, rx_#t~mem142#1, rx_#t~mem143#1, rx_#t~nondet144#1, rx_#t~mem145#1, rx_#t~mem146#1, rx_#t~mem147#1, rx_#t~nondet148#1, rx_#t~mem149#1, rx_#t~mem150#1, rx_#t~mem151#1, rx_#t~mem152#1, rx_#t~mem153#1.base, rx_#t~mem153#1.offset, rx_#t~mem154#1, rx_#t~mem155#1, rx_#t~mem156#1.base, rx_#t~mem156#1.offset, rx_#t~mem157#1.base, rx_#t~mem157#1.offset, rx_#t~mem158#1.base, rx_#t~mem158#1.offset, rx_#t~mem165#1.base, rx_#t~mem165#1.offset, rx_#t~mem166#1, rx_#t~mem167#1.base, rx_#t~mem167#1.offset, rx_#t~ret168#1.base, rx_#t~ret168#1.offset, rx_#t~mem169#1, rx_#t~mem170#1, rx_#t~ret171#1, rx_#t~ret172#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~1#1.base, rx_~pkt~1#1.offset, rx_~soft~1#1.base, rx_~soft~1#1.offset, rx_~saddr~0#1, rx_~ofs~0#1, rx_~in~0#1.base, rx_~in~0#1.offset, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~0#1.offset, rx_~arp~0#1.base, rx_~arp~0#1.offset, rx_~cptr~0#1.base, rx_~cptr~0#1.offset, rx_~tmp___0~2#1, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset, rx_~packetnum~0#1, rx_~tmp___1~0#1, rx_~tmp___2~0#1;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~1#1.base, rx_~pkt~1#1.offset;havoc rx_~soft~1#1.base, rx_~soft~1#1.offset;havoc rx_~saddr~0#1;havoc rx_~ofs~0#1;havoc rx_~in~0#1.base, rx_~in~0#1.offset;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset;havoc rx_~arp~0#1.base, rx_~arp~0#1.offset;havoc rx_~cptr~0#1.base, rx_~cptr~0#1.offset;havoc rx_~tmp___0~2#1;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;havoc rx_~packetnum~0#1;havoc rx_~tmp___1~0#1;havoc rx_~tmp___2~0#1; {17852#true} is VALID [2022-02-20 21:54:14,435 INFO L272 TraceCheckUtils]: 45: Hoare triple {17852#true} call rx_#t~ret44#1.base, rx_#t~ret44#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {17852#true} is VALID [2022-02-20 21:54:14,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {17852#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {17852#true} is VALID [2022-02-20 21:54:14,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {17852#true} assume true; {17852#true} is VALID [2022-02-20 21:54:14,436 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {17852#true} {17852#true} #845#return; {17852#true} is VALID [2022-02-20 21:54:14,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {17852#true} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret44#1.base, rx_#t~ret44#1.offset;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset;rx_~soft~1#1.base, rx_~soft~1#1.offset := rx_~pkthdr#1.base, 4 + rx_~pkthdr#1.offset;call rx_#t~mem45#1 := read~int(rx_~pkt~1#1.base, rx_~pkt~1#1.offset, 1);rx_~saddr~0#1 := rx_#t~mem45#1 % 256;havoc rx_#t~mem45#1;rx_~in~0#1.base, rx_~in~0#1.offset := rx_~lp~0#1.base, 440 + rx_~lp~0#1.offset + 12 * (if rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 else rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); {17852#true} is VALID [2022-02-20 21:54:14,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {17852#true} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {17852#true} is VALID [2022-02-20 21:54:14,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {17852#true} call rx_#t~mem46#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {17852#true} is VALID [2022-02-20 21:54:14,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {17852#true} assume !(255 == rx_#t~mem46#1 % 256 % 4294967296);havoc rx_#t~mem46#1; {17852#true} is VALID [2022-02-20 21:54:14,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {17852#true} call rx_#t~mem55#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {17852#true} is VALID [2022-02-20 21:54:14,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {17852#true} assume !(0 == rx_#t~mem55#1 % 256 % 4294967296);havoc rx_#t~mem55#1;call rx_#t~mem94#1.base, rx_#t~mem94#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8);rx_#t~short97#1 := 0 != (rx_#t~mem94#1.base + rx_#t~mem94#1.offset) % 18446744073709551616; {17852#true} is VALID [2022-02-20 21:54:14,437 INFO L290 TraceCheckUtils]: 55: Hoare triple {17852#true} assume rx_#t~short97#1;call rx_#t~mem95#1 := read~int(rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);call rx_#t~mem96#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);rx_#t~short97#1 := rx_#t~mem95#1 % 65536 != rx_#t~mem96#1 % 65536; {17852#true} is VALID [2022-02-20 21:54:14,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {17852#true} assume !rx_#t~short97#1;havoc rx_#t~mem94#1.base, rx_#t~mem94#1.offset;havoc rx_#t~mem95#1;havoc rx_#t~mem96#1;havoc rx_#t~short97#1; {17852#true} is VALID [2022-02-20 21:54:14,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {17852#true} call rx_#t~mem105#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {17852#true} is VALID [2022-02-20 21:54:14,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {17852#true} assume 0 != rx_#t~mem105#1 % 256;havoc rx_#t~mem105#1;call rx_#t~mem106#1.base, rx_#t~mem106#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8); {17852#true} is VALID [2022-02-20 21:54:14,438 INFO L290 TraceCheckUtils]: 59: Hoare triple {17852#true} assume !(0 != (rx_#t~mem106#1.base + rx_#t~mem106#1.offset) % 18446744073709551616);havoc rx_#t~mem106#1.base, rx_#t~mem106#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {17852#true} call rx_#t~mem114#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem114#1, rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);havoc rx_#t~mem114#1;call rx_#t~mem115#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1);call write~int(2 + rx_#t~mem115#1 % 256 / 2 % 256, rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1);havoc rx_#t~mem115#1;call write~int(1, rx_~in~0#1.base, 10 + rx_~in~0#1.offset, 1);call rx_#t~mem116#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {17852#true} is VALID [2022-02-20 21:54:14,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {17852#true} assume !(rx_#t~mem116#1 % 256 % 4294967296 > 16);havoc rx_#t~mem116#1;call rx_#t~mem122#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {17852#true} is VALID [2022-02-20 21:54:14,439 INFO L272 TraceCheckUtils]: 62: Hoare triple {17852#true} call rx_#t~ret123#1.base, rx_#t~ret123#1.offset := ldv_alloc_skb_12(4 + 508 * (rx_#t~mem122#1 % 256), 32); {17891#(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:54:14,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {17891#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {17852#true} is VALID [2022-02-20 21:54:14,440 INFO L272 TraceCheckUtils]: 64: Hoare triple {17852#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {17891#(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:54:14,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {17891#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {17852#true} is VALID [2022-02-20 21:54:14,441 INFO L272 TraceCheckUtils]: 66: Hoare triple {17852#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {17890#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:14,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {17890#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {17852#true} is VALID [2022-02-20 21:54:14,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {17852#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,442 INFO L290 TraceCheckUtils]: 69: Hoare triple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:54:14,443 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {17914#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {17852#true} #815#return; {17912#(and (<= 0 |ldv_skb_alloc_#t~ret260#1.offset|) (= |ldv_skb_alloc_#t~ret260#1.base| 0) (<= |ldv_skb_alloc_#t~ret260#1.offset| 0))} is VALID [2022-02-20 21:54:14,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {17912#(and (<= 0 |ldv_skb_alloc_#t~ret260#1.offset|) (= |ldv_skb_alloc_#t~ret260#1.base| 0) (<= |ldv_skb_alloc_#t~ret260#1.offset| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {17913#(and (<= |ldv_skb_alloc_~skb~1#1.offset| 0) (< 0 (+ |ldv_skb_alloc_~skb~1#1.offset| 1)) (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:54:14,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {17913#(and (<= |ldv_skb_alloc_~skb~1#1.offset| 0) (< 0 (+ |ldv_skb_alloc_~skb~1#1.offset| 1)) (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {17853#false} is VALID [2022-02-20 21:54:14,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {17853#false} assume !false; {17853#false} is VALID [2022-02-20 21:54:14,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {17853#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {17853#false} is VALID [2022-02-20 21:54:14,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {17853#false} 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; {17853#false} is VALID [2022-02-20 21:54:14,444 INFO L290 TraceCheckUtils]: 76: Hoare triple {17853#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {17853#false} is VALID [2022-02-20 21:54:14,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {17853#false} assume true; {17853#false} is VALID [2022-02-20 21:54:14,445 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17853#false} {17852#true} #899#return; {17906#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} is VALID [2022-02-20 21:54:14,445 INFO L290 TraceCheckUtils]: 79: Hoare triple {17906#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {17907#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} is VALID [2022-02-20 21:54:14,445 INFO L290 TraceCheckUtils]: 80: Hoare triple {17907#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} assume !(~tmp~11.base != 0 || ~tmp~11.offset != 0); {17853#false} is VALID [2022-02-20 21:54:14,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {17853#false} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {17853#false} is VALID [2022-02-20 21:54:14,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {17853#false} assume true; {17853#false} is VALID [2022-02-20 21:54:14,446 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17853#false} {17852#true} #869#return; {17853#false} is VALID [2022-02-20 21:54:14,446 INFO L290 TraceCheckUtils]: 84: Hoare triple {17853#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret123#1.base, rx_#t~ret123#1.offset;havoc rx_#t~mem122#1;havoc rx_#t~ret123#1.base, rx_#t~ret123#1.offset;call write~$Pointer$(rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~in~0#1.base, rx_~in~0#1.offset, 8); {17853#false} is VALID [2022-02-20 21:54:14,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {17853#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {17853#false} is VALID [2022-02-20 21:54:14,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {17853#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet124#1; {17853#false} is VALID [2022-02-20 21:54:14,446 INFO L290 TraceCheckUtils]: 87: Hoare triple {17853#false} call rx_#t~mem125#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem125#1, rx_~lp~0#1.base, 438 + rx_~lp~0#1.offset, 2);havoc rx_#t~mem125#1;call rx_#t~mem126#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem126#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem126#1; {17853#false} is VALID [2022-02-20 21:54:14,447 INFO L290 TraceCheckUtils]: 88: Hoare triple {17853#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {17853#false} is VALID [2022-02-20 21:54:14,447 INFO L290 TraceCheckUtils]: 89: Hoare triple {17853#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {17853#false} is VALID [2022-02-20 21:54:14,447 INFO L290 TraceCheckUtils]: 90: Hoare triple {17853#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {17853#false} is VALID [2022-02-20 21:54:14,447 INFO L290 TraceCheckUtils]: 91: Hoare triple {17853#false} assume main_#t~switch240#1; {17853#false} is VALID [2022-02-20 21:54:14,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {17853#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {17853#false} is VALID [2022-02-20 21:54:14,447 INFO L290 TraceCheckUtils]: 93: Hoare triple {17853#false} assume main_#t~switch248#1; {17853#false} is VALID [2022-02-20 21:54:14,447 INFO L290 TraceCheckUtils]: 94: Hoare triple {17853#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {17853#false} is VALID [2022-02-20 21:54:14,448 INFO L290 TraceCheckUtils]: 95: Hoare triple {17853#false} assume { :end_inline_arcnet_unregister_proto } true; {17853#false} is VALID [2022-02-20 21:54:14,448 INFO L290 TraceCheckUtils]: 96: Hoare triple {17853#false} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {17853#false} is VALID [2022-02-20 21:54:14,448 INFO L290 TraceCheckUtils]: 97: Hoare triple {17853#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {17853#false} is VALID [2022-02-20 21:54:14,448 INFO L290 TraceCheckUtils]: 98: Hoare triple {17853#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {17853#false} is VALID [2022-02-20 21:54:14,448 INFO L290 TraceCheckUtils]: 99: Hoare triple {17853#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {17853#false} is VALID [2022-02-20 21:54:14,448 INFO L272 TraceCheckUtils]: 100: Hoare triple {17853#false} call ldv_error(); {17853#false} is VALID [2022-02-20 21:54:14,448 INFO L290 TraceCheckUtils]: 101: Hoare triple {17853#false} assume !false; {17853#false} is VALID [2022-02-20 21:54:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 21:54:14,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:14,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335129183] [2022-02-20 21:54:14,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335129183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:14,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:14,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 21:54:14,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369604854] [2022-02-20 21:54:14,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 102 [2022-02-20 21:54:14,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:14,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:54:14,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:14,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 21:54:14,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:14,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 21:54:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:54:14,533 INFO L87 Difference]: Start difference. First operand 642 states and 910 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:54:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:18,785 INFO L93 Difference]: Finished difference Result 1288 states and 1855 transitions. [2022-02-20 21:54:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:54:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 102 [2022-02-20 21:54:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:54:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 876 transitions. [2022-02-20 21:54:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:54:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 876 transitions. [2022-02-20 21:54:18,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 876 transitions. [2022-02-20 21:54:19,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 876 edges. 876 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:19,604 INFO L225 Difference]: With dead ends: 1288 [2022-02-20 21:54:19,604 INFO L226 Difference]: Without dead ends: 678 [2022-02-20 21:54:19,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:54:19,606 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 52 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:19,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 2443 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 21:54:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-02-20 21:54:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 642. [2022-02-20 21:54:19,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:19,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 678 states. Second operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) [2022-02-20 21:54:19,629 INFO L74 IsIncluded]: Start isIncluded. First operand 678 states. Second operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) [2022-02-20 21:54:19,631 INFO L87 Difference]: Start difference. First operand 678 states. Second operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) [2022-02-20 21:54:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:19,658 INFO L93 Difference]: Finished difference Result 678 states and 969 transitions. [2022-02-20 21:54:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 969 transitions. [2022-02-20 21:54:19,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:19,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:19,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) Second operand 678 states. [2022-02-20 21:54:19,664 INFO L87 Difference]: Start difference. First operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) Second operand 678 states. [2022-02-20 21:54:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:19,691 INFO L93 Difference]: Finished difference Result 678 states and 969 transitions. [2022-02-20 21:54:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 969 transitions. [2022-02-20 21:54:19,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:19,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:19,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:19,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) [2022-02-20 21:54:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 908 transitions. [2022-02-20 21:54:19,723 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 908 transitions. Word has length 102 [2022-02-20 21:54:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:19,724 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 908 transitions. [2022-02-20 21:54:19,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:54:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 908 transitions. [2022-02-20 21:54:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 21:54:19,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:19,726 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:19,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:54:19,726 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash 491714592, now seen corresponding path program 1 times [2022-02-20 21:54:19,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:19,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348641252] [2022-02-20 21:54:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:19,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {21705#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21705#true} is VALID [2022-02-20 21:54:19,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:19,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21705#true} {21705#true} #831#return; {21705#true} is VALID [2022-02-20 21:54:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:54:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:19,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {21705#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21705#true} is VALID [2022-02-20 21:54:19,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:19,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21705#true} {21705#true} #889#return; {21705#true} is VALID [2022-02-20 21:54:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 21:54:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:19,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {21705#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21705#true} is VALID [2022-02-20 21:54:19,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:19,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21705#true} {21705#true} #891#return; {21705#true} is VALID [2022-02-20 21:54:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:54:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {21705#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {21705#true} is VALID [2022-02-20 21:54:19,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:19,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21705#true} {21705#true} #845#return; {21705#true} is VALID [2022-02-20 21:54:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:54:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:54:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:20,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {21705#true} ~cond := #in~cond; {21705#true} is VALID [2022-02-20 21:54:20,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {21705#true} assume !(0 == ~cond); {21705#true} is VALID [2022-02-20 21:54:20,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21705#true} {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #829#return; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:20,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {21705#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} is VALID [2022-02-20 21:54:20,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,073 INFO L272 TraceCheckUtils]: 3: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {21705#true} is VALID [2022-02-20 21:54:20,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {21705#true} ~cond := #in~cond; {21705#true} is VALID [2022-02-20 21:54:20,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {21705#true} assume !(0 == ~cond); {21705#true} is VALID [2022-02-20 21:54:20,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,075 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21705#true} {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #829#return; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} assume true; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} {21705#true} #815#return; {21786#(or (<= (+ |ldv_skb_alloc_#t~ret260#1.base| 1) 0) (<= 1 |ldv_skb_alloc_#t~ret260#1.base|))} is VALID [2022-02-20 21:54:20,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {21751#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,077 INFO L272 TraceCheckUtils]: 1: Hoare triple {21705#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {21750#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:20,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:20,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {21705#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} is VALID [2022-02-20 21:54:20,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,079 INFO L272 TraceCheckUtils]: 5: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {21705#true} is VALID [2022-02-20 21:54:20,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {21705#true} ~cond := #in~cond; {21705#true} is VALID [2022-02-20 21:54:20,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {21705#true} assume !(0 == ~cond); {21705#true} is VALID [2022-02-20 21:54:20,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,080 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {21705#true} {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #829#return; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} assume true; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,081 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} {21705#true} #815#return; {21786#(or (<= (+ |ldv_skb_alloc_#t~ret260#1.base| 1) 0) (<= 1 |ldv_skb_alloc_#t~ret260#1.base|))} is VALID [2022-02-20 21:54:20,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {21786#(or (<= (+ |ldv_skb_alloc_#t~ret260#1.base| 1) 0) (<= 1 |ldv_skb_alloc_#t~ret260#1.base|))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !false; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} 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; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} assume true; {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,085 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} {21705#true} #899#return; {21773#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} is VALID [2022-02-20 21:54:20,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {21751#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {21705#true} is VALID [2022-02-20 21:54:20,086 INFO L272 TraceCheckUtils]: 1: Hoare triple {21705#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {21751#(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:54:20,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {21751#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,087 INFO L272 TraceCheckUtils]: 3: Hoare triple {21705#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {21750#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:20,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:20,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {21705#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} is VALID [2022-02-20 21:54:20,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,088 INFO L272 TraceCheckUtils]: 7: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {21705#true} is VALID [2022-02-20 21:54:20,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {21705#true} ~cond := #in~cond; {21705#true} is VALID [2022-02-20 21:54:20,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {21705#true} assume !(0 == ~cond); {21705#true} is VALID [2022-02-20 21:54:20,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,089 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {21705#true} {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #829#return; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} assume true; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,091 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} {21705#true} #815#return; {21786#(or (<= (+ |ldv_skb_alloc_#t~ret260#1.base| 1) 0) (<= 1 |ldv_skb_alloc_#t~ret260#1.base|))} is VALID [2022-02-20 21:54:20,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {21786#(or (<= (+ |ldv_skb_alloc_#t~ret260#1.base| 1) 0) (<= 1 |ldv_skb_alloc_#t~ret260#1.base|))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !false; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} 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; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} assume true; {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,095 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} {21705#true} #899#return; {21773#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} is VALID [2022-02-20 21:54:20,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {21773#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {21774#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} is VALID [2022-02-20 21:54:20,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {21774#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} assume !(~tmp~11.base != 0 || ~tmp~11.offset != 0); {21706#false} is VALID [2022-02-20 21:54:20,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {21706#false} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {21706#false} is VALID [2022-02-20 21:54:20,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {21706#false} assume true; {21706#false} is VALID [2022-02-20 21:54:20,096 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21706#false} {21705#true} #851#return; {21706#false} is VALID [2022-02-20 21:54:20,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {21705#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {21705#true} is VALID [2022-02-20 21:54:20,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {21705#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {21705#true} is VALID [2022-02-20 21:54:20,097 INFO L272 TraceCheckUtils]: 2: Hoare triple {21705#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {21750#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:20,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:20,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {21705#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21705#true} is VALID [2022-02-20 21:54:20,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,097 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {21705#true} {21705#true} #831#return; {21705#true} is VALID [2022-02-20 21:54:20,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {21705#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {21705#true} is VALID [2022-02-20 21:54:20,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {21705#true} assume { :end_inline_ldv_set_init } true; {21705#true} is VALID [2022-02-20 21:54:20,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {21705#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {21705#true} is VALID [2022-02-20 21:54:20,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {21705#true} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {21705#true} is VALID [2022-02-20 21:54:20,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {21705#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {21705#true} is VALID [2022-02-20 21:54:20,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {21705#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {21705#true} is VALID [2022-02-20 21:54:20,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {21705#true} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {21705#true} is VALID [2022-02-20 21:54:20,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {21705#true} assume main_#t~switch240#1; {21705#true} is VALID [2022-02-20 21:54:20,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {21705#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {21705#true} is VALID [2022-02-20 21:54:20,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {21705#true} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {21705#true} is VALID [2022-02-20 21:54:20,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {21705#true} assume main_#t~switch248#1; {21705#true} is VALID [2022-02-20 21:54:20,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {21705#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {21705#true} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {21705#true} is VALID [2022-02-20 21:54:20,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {21705#true} arcnet_rfc1201_init_#res#1 := 0; {21705#true} is VALID [2022-02-20 21:54:20,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {21705#true} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {21705#true} is VALID [2022-02-20 21:54:20,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {21705#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset, ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset, ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,100 INFO L272 TraceCheckUtils]: 23: Hoare triple {21705#true} call ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset := ldv_zalloc(20); {21750#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:20,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:20,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {21705#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21705#true} is VALID [2022-02-20 21:54:20,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,101 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21705#true} {21705#true} #889#return; {21705#true} is VALID [2022-02-20 21:54:20,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {21705#true} ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset := ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,101 INFO L272 TraceCheckUtils]: 29: Hoare triple {21705#true} call ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset := ldv_zalloc(3264); {21750#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:20,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:20,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {21705#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21705#true} is VALID [2022-02-20 21:54:20,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,102 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {21705#true} {21705#true} #891#return; {21705#true} is VALID [2022-02-20 21:54:20,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {21705#true} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {21705#true} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {21705#true} is VALID [2022-02-20 21:54:20,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {21705#true} assume !(0 != ~ldv_retval_0~0); {21705#true} is VALID [2022-02-20 21:54:20,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {21705#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {21705#true} is VALID [2022-02-20 21:54:20,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {21705#true} assume main_#t~switch240#1; {21705#true} is VALID [2022-02-20 21:54:20,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {21705#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet241#1 && main_#t~nondet241#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet241#1;havoc main_#t~nondet241#1;main_#t~switch242#1 := 0 == main_~tmp___7~0#1; {21705#true} is VALID [2022-02-20 21:54:20,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {21705#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 1 == main_~tmp___7~0#1; {21705#true} is VALID [2022-02-20 21:54:20,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {21705#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 2 == main_~tmp___7~0#1; {21705#true} is VALID [2022-02-20 21:54:20,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {21705#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 3 == main_~tmp___7~0#1; {21705#true} is VALID [2022-02-20 21:54:20,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {21705#true} assume main_#t~switch242#1; {21705#true} is VALID [2022-02-20 21:54:20,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {21705#true} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset, rx_#t~mem45#1, rx_#t~mem46#1, rx_#t~nondet47#1, rx_#t~mem54#1.base, rx_#t~mem54#1.offset, rx_#t~mem55#1, rx_#t~mem56#1.base, rx_#t~mem56#1.offset, rx_#t~nondet57#1, rx_#t~mem58#1, rx_#t~mem59#1, rx_#t~mem60#1, rx_#t~mem61#1, rx_#t~mem62#1.base, rx_#t~mem62#1.offset, rx_#t~mem63#1, rx_#t~mem64#1, rx_#t~mem65#1, rx_#t~ret66#1.base, rx_#t~ret66#1.offset, rx_#t~nondet67#1, rx_#t~mem68#1, rx_#t~ret69#1.base, rx_#t~ret69#1.offset, rx_#t~mem70#1.base, rx_#t~mem70#1.offset, rx_#t~memcpy~res71#1.base, rx_#t~memcpy~res71#1.offset, rx_#t~memcpy~res72#1.base, rx_#t~memcpy~res72#1.offset, rx_#t~mem79#1.base, rx_#t~mem79#1.offset, rx_#t~mem80#1, rx_#t~mem81#1, rx_#t~mem82#1, rx_#t~short83#1, rx_#t~mem84#1, rx_#t~nondet85#1, rx_#t~mem86#1, rx_#t~nondet87#1, rx_#t~mem88#1, rx_#t~mem89#1, rx_#t~mem90#1, rx_#t~mem91#1, rx_#t~ret92#1, rx_#t~ret93#1, rx_#t~mem94#1.base, rx_#t~mem94#1.offset, rx_#t~mem95#1, rx_#t~mem96#1, rx_#t~short97#1, rx_#t~nondet98#1, rx_#t~mem99#1, rx_#t~mem100#1, rx_#t~mem101#1, rx_#t~mem102#1.base, rx_#t~mem102#1.offset, rx_#t~mem103#1, rx_#t~mem104#1, rx_#t~mem105#1, rx_#t~mem106#1.base, rx_#t~mem106#1.offset, rx_#t~nondet107#1, rx_#t~mem108#1, rx_#t~mem109#1, rx_#t~mem110#1, rx_#t~mem111#1, rx_#t~mem112#1, rx_#t~mem113#1.base, rx_#t~mem113#1.offset, rx_#t~mem114#1, rx_#t~mem115#1, rx_#t~mem116#1, rx_#t~nondet117#1, rx_#t~mem118#1, rx_#t~mem119#1, rx_#t~mem120#1, rx_#t~mem121#1, rx_#t~mem122#1, rx_#t~ret123#1.base, rx_#t~ret123#1.offset, rx_#t~nondet124#1, rx_#t~mem125#1, rx_#t~mem126#1, rx_#t~mem127#1.base, rx_#t~mem127#1.offset, rx_#t~memcpy~res128#1.base, rx_#t~memcpy~res128#1.offset, rx_#t~memcpy~res129#1.base, rx_#t~memcpy~res129#1.offset, rx_#t~ret130#1.base, rx_#t~ret130#1.offset, rx_#t~mem131#1, rx_#t~mem132#1.base, rx_#t~mem132#1.offset, rx_#t~mem133#1, rx_#t~mem134#1, rx_#t~nondet135#1, rx_#t~mem136#1, rx_#t~mem137#1, rx_#t~mem138#1, rx_#t~mem139#1, rx_#t~mem140#1, rx_#t~mem141#1, rx_#t~mem142#1, rx_#t~mem143#1, rx_#t~nondet144#1, rx_#t~mem145#1, rx_#t~mem146#1, rx_#t~mem147#1, rx_#t~nondet148#1, rx_#t~mem149#1, rx_#t~mem150#1, rx_#t~mem151#1, rx_#t~mem152#1, rx_#t~mem153#1.base, rx_#t~mem153#1.offset, rx_#t~mem154#1, rx_#t~mem155#1, rx_#t~mem156#1.base, rx_#t~mem156#1.offset, rx_#t~mem157#1.base, rx_#t~mem157#1.offset, rx_#t~mem158#1.base, rx_#t~mem158#1.offset, rx_#t~mem165#1.base, rx_#t~mem165#1.offset, rx_#t~mem166#1, rx_#t~mem167#1.base, rx_#t~mem167#1.offset, rx_#t~ret168#1.base, rx_#t~ret168#1.offset, rx_#t~mem169#1, rx_#t~mem170#1, rx_#t~ret171#1, rx_#t~ret172#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~1#1.base, rx_~pkt~1#1.offset, rx_~soft~1#1.base, rx_~soft~1#1.offset, rx_~saddr~0#1, rx_~ofs~0#1, rx_~in~0#1.base, rx_~in~0#1.offset, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~0#1.offset, rx_~arp~0#1.base, rx_~arp~0#1.offset, rx_~cptr~0#1.base, rx_~cptr~0#1.offset, rx_~tmp___0~2#1, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset, rx_~packetnum~0#1, rx_~tmp___1~0#1, rx_~tmp___2~0#1;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~1#1.base, rx_~pkt~1#1.offset;havoc rx_~soft~1#1.base, rx_~soft~1#1.offset;havoc rx_~saddr~0#1;havoc rx_~ofs~0#1;havoc rx_~in~0#1.base, rx_~in~0#1.offset;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset;havoc rx_~arp~0#1.base, rx_~arp~0#1.offset;havoc rx_~cptr~0#1.base, rx_~cptr~0#1.offset;havoc rx_~tmp___0~2#1;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;havoc rx_~packetnum~0#1;havoc rx_~tmp___1~0#1;havoc rx_~tmp___2~0#1; {21705#true} is VALID [2022-02-20 21:54:20,105 INFO L272 TraceCheckUtils]: 45: Hoare triple {21705#true} call rx_#t~ret44#1.base, rx_#t~ret44#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {21705#true} is VALID [2022-02-20 21:54:20,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {21705#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {21705#true} is VALID [2022-02-20 21:54:20,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,106 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21705#true} {21705#true} #845#return; {21705#true} is VALID [2022-02-20 21:54:20,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {21705#true} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret44#1.base, rx_#t~ret44#1.offset;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset;rx_~soft~1#1.base, rx_~soft~1#1.offset := rx_~pkthdr#1.base, 4 + rx_~pkthdr#1.offset;call rx_#t~mem45#1 := read~int(rx_~pkt~1#1.base, rx_~pkt~1#1.offset, 1);rx_~saddr~0#1 := rx_#t~mem45#1 % 256;havoc rx_#t~mem45#1;rx_~in~0#1.base, rx_~in~0#1.offset := rx_~lp~0#1.base, 440 + rx_~lp~0#1.offset + 12 * (if rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 else rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); {21705#true} is VALID [2022-02-20 21:54:20,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {21705#true} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {21705#true} is VALID [2022-02-20 21:54:20,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {21705#true} call rx_#t~mem46#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {21705#true} is VALID [2022-02-20 21:54:20,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {21705#true} assume !(255 == rx_#t~mem46#1 % 256 % 4294967296);havoc rx_#t~mem46#1; {21705#true} is VALID [2022-02-20 21:54:20,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {21705#true} call rx_#t~mem55#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {21705#true} is VALID [2022-02-20 21:54:20,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {21705#true} assume 0 == rx_#t~mem55#1 % 256 % 4294967296;havoc rx_#t~mem55#1;call rx_#t~mem56#1.base, rx_#t~mem56#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8); {21705#true} is VALID [2022-02-20 21:54:20,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {21705#true} assume !(0 != (rx_#t~mem56#1.base + rx_#t~mem56#1.offset) % 18446744073709551616);havoc rx_#t~mem56#1.base, rx_#t~mem56#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {21705#true} call rx_#t~mem65#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem65#1, rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);havoc rx_#t~mem65#1; {21705#true} is VALID [2022-02-20 21:54:20,108 INFO L272 TraceCheckUtils]: 57: Hoare triple {21705#true} call rx_#t~ret66#1.base, rx_#t~ret66#1.offset := ldv_alloc_skb_12(4 + rx_~length#1, 32); {21751#(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:54:20,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {21751#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {21705#true} is VALID [2022-02-20 21:54:20,109 INFO L272 TraceCheckUtils]: 59: Hoare triple {21705#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {21751#(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:54:20,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {21751#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {21705#true} is VALID [2022-02-20 21:54:20,110 INFO L272 TraceCheckUtils]: 61: Hoare triple {21705#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {21750#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:20,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {21750#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {21705#true} is VALID [2022-02-20 21:54:20,111 INFO L290 TraceCheckUtils]: 63: Hoare triple {21705#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} is VALID [2022-02-20 21:54:20,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {21789#(or (<= (+ |ldv_zalloc_#t~malloc21#1.base| 1) 0) (not (<= |ldv_zalloc_#t~malloc21#1.base| 0)))} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,112 INFO L272 TraceCheckUtils]: 65: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {21705#true} is VALID [2022-02-20 21:54:20,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {21705#true} ~cond := #in~cond; {21705#true} is VALID [2022-02-20 21:54:20,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {21705#true} assume !(0 == ~cond); {21705#true} is VALID [2022-02-20 21:54:20,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {21705#true} assume true; {21705#true} is VALID [2022-02-20 21:54:20,113 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21705#true} {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #829#return; {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {21790#(or (<= 1 |ldv_zalloc_~p~1#1.base|) (<= (+ |ldv_zalloc_~p~1#1.base| 1) 0))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} assume true; {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,114 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21795#(or (<= 1 |ldv_zalloc_#res#1.base|) (<= (+ |ldv_zalloc_#res#1.base| 1) 0))} {21705#true} #815#return; {21786#(or (<= (+ |ldv_skb_alloc_#t~ret260#1.base| 1) 0) (<= 1 |ldv_skb_alloc_#t~ret260#1.base|))} is VALID [2022-02-20 21:54:20,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {21786#(or (<= (+ |ldv_skb_alloc_#t~ret260#1.base| 1) 0) (<= 1 |ldv_skb_alloc_#t~ret260#1.base|))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !false; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} 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; {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {21787#(or (<= 1 |ldv_skb_alloc_~skb~1#1.base|) (<= (+ |ldv_skb_alloc_~skb~1#1.base| 1) 0))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} assume true; {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} is VALID [2022-02-20 21:54:20,118 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21788#(or (<= 1 |ldv_skb_alloc_#res#1.base|) (<= (+ |ldv_skb_alloc_#res#1.base| 1) 0))} {21705#true} #899#return; {21773#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} is VALID [2022-02-20 21:54:20,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {21773#(not (= |ldv_alloc_skb_12_#t~ret250.base| 0))} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {21774#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} is VALID [2022-02-20 21:54:20,119 INFO L290 TraceCheckUtils]: 82: Hoare triple {21774#(not (= ldv_alloc_skb_12_~tmp~11.base 0))} assume !(~tmp~11.base != 0 || ~tmp~11.offset != 0); {21706#false} is VALID [2022-02-20 21:54:20,119 INFO L290 TraceCheckUtils]: 83: Hoare triple {21706#false} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {21706#false} is VALID [2022-02-20 21:54:20,119 INFO L290 TraceCheckUtils]: 84: Hoare triple {21706#false} assume true; {21706#false} is VALID [2022-02-20 21:54:20,119 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {21706#false} {21705#true} #851#return; {21706#false} is VALID [2022-02-20 21:54:20,119 INFO L290 TraceCheckUtils]: 86: Hoare triple {21706#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret66#1.base, rx_#t~ret66#1.offset;havoc rx_#t~ret66#1.base, rx_#t~ret66#1.offset; {21706#false} is VALID [2022-02-20 21:54:20,120 INFO L290 TraceCheckUtils]: 87: Hoare triple {21706#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {21706#false} is VALID [2022-02-20 21:54:20,120 INFO L290 TraceCheckUtils]: 88: Hoare triple {21706#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet67#1; {21706#false} is VALID [2022-02-20 21:54:20,120 INFO L290 TraceCheckUtils]: 89: Hoare triple {21706#false} call rx_#t~mem68#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem68#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem68#1; {21706#false} is VALID [2022-02-20 21:54:20,120 INFO L290 TraceCheckUtils]: 90: Hoare triple {21706#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {21706#false} is VALID [2022-02-20 21:54:20,120 INFO L290 TraceCheckUtils]: 91: Hoare triple {21706#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {21706#false} is VALID [2022-02-20 21:54:20,120 INFO L290 TraceCheckUtils]: 92: Hoare triple {21706#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {21706#false} is VALID [2022-02-20 21:54:20,120 INFO L290 TraceCheckUtils]: 93: Hoare triple {21706#false} assume main_#t~switch240#1; {21706#false} is VALID [2022-02-20 21:54:20,121 INFO L290 TraceCheckUtils]: 94: Hoare triple {21706#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {21706#false} is VALID [2022-02-20 21:54:20,121 INFO L290 TraceCheckUtils]: 95: Hoare triple {21706#false} assume main_#t~switch248#1; {21706#false} is VALID [2022-02-20 21:54:20,121 INFO L290 TraceCheckUtils]: 96: Hoare triple {21706#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {21706#false} is VALID [2022-02-20 21:54:20,121 INFO L290 TraceCheckUtils]: 97: Hoare triple {21706#false} assume { :end_inline_arcnet_unregister_proto } true; {21706#false} is VALID [2022-02-20 21:54:20,121 INFO L290 TraceCheckUtils]: 98: Hoare triple {21706#false} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {21706#false} is VALID [2022-02-20 21:54:20,121 INFO L290 TraceCheckUtils]: 99: Hoare triple {21706#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {21706#false} is VALID [2022-02-20 21:54:20,121 INFO L290 TraceCheckUtils]: 100: Hoare triple {21706#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {21706#false} is VALID [2022-02-20 21:54:20,122 INFO L290 TraceCheckUtils]: 101: Hoare triple {21706#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {21706#false} is VALID [2022-02-20 21:54:20,122 INFO L272 TraceCheckUtils]: 102: Hoare triple {21706#false} call ldv_error(); {21706#false} is VALID [2022-02-20 21:54:20,122 INFO L290 TraceCheckUtils]: 103: Hoare triple {21706#false} assume !false; {21706#false} is VALID [2022-02-20 21:54:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 21:54:20,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:20,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348641252] [2022-02-20 21:54:20,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348641252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:20,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:20,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 21:54:20,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376329474] [2022-02-20 21:54:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:20,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-02-20 21:54:20,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:20,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:20,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:20,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 21:54:20,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:20,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 21:54:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:54:20,204 INFO L87 Difference]: Start difference. First operand 642 states and 908 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:25,108 INFO L93 Difference]: Finished difference Result 1292 states and 1853 transitions. [2022-02-20 21:54:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 21:54:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-02-20 21:54:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 878 transitions. [2022-02-20 21:54:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 878 transitions. [2022-02-20 21:54:25,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 878 transitions. [2022-02-20 21:54:25,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 878 edges. 878 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:25,934 INFO L225 Difference]: With dead ends: 1292 [2022-02-20 21:54:25,934 INFO L226 Difference]: Without dead ends: 682 [2022-02-20 21:54:25,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-02-20 21:54:25,936 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 113 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:25,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 3322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 21:54:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-02-20 21:54:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 646. [2022-02-20 21:54:25,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:25,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:25,967 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:25,968 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:25,995 INFO L93 Difference]: Finished difference Result 682 states and 971 transitions. [2022-02-20 21:54:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 971 transitions. [2022-02-20 21:54:25,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:25,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:25,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) Second operand 682 states. [2022-02-20 21:54:25,999 INFO L87 Difference]: Start difference. First operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) Second operand 682 states. [2022-02-20 21:54:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:26,029 INFO L93 Difference]: Finished difference Result 682 states and 971 transitions. [2022-02-20 21:54:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 971 transitions. [2022-02-20 21:54:26,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:26,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:26,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:26,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 910 transitions. [2022-02-20 21:54:26,061 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 910 transitions. Word has length 104 [2022-02-20 21:54:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:26,061 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 910 transitions. [2022-02-20 21:54:26,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 910 transitions. [2022-02-20 21:54:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-20 21:54:26,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:26,073 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:26,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:54:26,073 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:26,074 INFO L85 PathProgramCache]: Analyzing trace with hash -556686604, now seen corresponding path program 1 times [2022-02-20 21:54:26,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:26,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678985464] [2022-02-20 21:54:26,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:26,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25602#true} {25602#true} #831#return; {25602#true} is VALID [2022-02-20 21:54:26,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:54:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25602#true} {25603#false} #889#return; {25603#false} is VALID [2022-02-20 21:54:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 21:54:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25602#true} {25603#false} #891#return; {25603#false} is VALID [2022-02-20 21:54:26,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:54:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {25602#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {25602#true} is VALID [2022-02-20 21:54:26,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25602#true} {25603#false} #845#return; {25603#false} is VALID [2022-02-20 21:54:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:54:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:54:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {25602#true} ~cond := #in~cond; {25602#true} is VALID [2022-02-20 21:54:26,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume !(0 == ~cond); {25602#true} is VALID [2022-02-20 21:54:26,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25602#true} {25602#true} #829#return; {25602#true} is VALID [2022-02-20 21:54:26,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {25602#true} is VALID [2022-02-20 21:54:26,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {25602#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,355 INFO L272 TraceCheckUtils]: 3: Hoare triple {25602#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {25602#true} is VALID [2022-02-20 21:54:26,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {25602#true} ~cond := #in~cond; {25602#true} is VALID [2022-02-20 21:54:26,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {25602#true} assume !(0 == ~cond); {25602#true} is VALID [2022-02-20 21:54:26,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,356 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25602#true} {25602#true} #829#return; {25602#true} is VALID [2022-02-20 21:54:26,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {25602#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25602#true} {25602#true} #815#return; {25602#true} is VALID [2022-02-20 21:54:26,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {25655#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,357 INFO L272 TraceCheckUtils]: 1: Hoare triple {25602#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {25654#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {25602#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {25602#true} is VALID [2022-02-20 21:54:26,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {25602#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,357 INFO L272 TraceCheckUtils]: 5: Hoare triple {25602#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {25602#true} is VALID [2022-02-20 21:54:26,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {25602#true} ~cond := #in~cond; {25602#true} is VALID [2022-02-20 21:54:26,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {25602#true} assume !(0 == ~cond); {25602#true} is VALID [2022-02-20 21:54:26,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,358 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {25602#true} {25602#true} #829#return; {25602#true} is VALID [2022-02-20 21:54:26,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {25602#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,358 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25602#true} {25602#true} #815#return; {25602#true} is VALID [2022-02-20 21:54:26,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {25602#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {25602#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {25602#true} is VALID [2022-02-20 21:54:26,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {25602#true} assume !false; {25602#true} is VALID [2022-02-20 21:54:26,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {25602#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {25602#true} is VALID [2022-02-20 21:54:26,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {25602#true} 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; {25602#true} is VALID [2022-02-20 21:54:26,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {25602#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,360 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25602#true} {25602#true} #899#return; {25602#true} is VALID [2022-02-20 21:54:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 21:54:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:26,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {25696#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {25602#true} is VALID [2022-02-20 21:54:26,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25602#true} {25602#true} #901#return; {25602#true} is VALID [2022-02-20 21:54:26,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {25655#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {25602#true} is VALID [2022-02-20 21:54:26,377 INFO L272 TraceCheckUtils]: 1: Hoare triple {25602#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {25655#(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:54:26,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {25655#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,378 INFO L272 TraceCheckUtils]: 3: Hoare triple {25602#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {25654#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {25602#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {25602#true} is VALID [2022-02-20 21:54:26,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {25602#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,379 INFO L272 TraceCheckUtils]: 7: Hoare triple {25602#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {25602#true} is VALID [2022-02-20 21:54:26,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {25602#true} ~cond := #in~cond; {25602#true} is VALID [2022-02-20 21:54:26,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {25602#true} assume !(0 == ~cond); {25602#true} is VALID [2022-02-20 21:54:26,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,380 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {25602#true} {25602#true} #829#return; {25602#true} is VALID [2022-02-20 21:54:26,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {25602#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,380 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {25602#true} {25602#true} #815#return; {25602#true} is VALID [2022-02-20 21:54:26,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {25602#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {25602#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {25602#true} is VALID [2022-02-20 21:54:26,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {25602#true} assume !false; {25602#true} is VALID [2022-02-20 21:54:26,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {25602#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {25602#true} is VALID [2022-02-20 21:54:26,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {25602#true} 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; {25602#true} is VALID [2022-02-20 21:54:26,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {25602#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,383 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25602#true} {25602#true} #899#return; {25602#true} is VALID [2022-02-20 21:54:26,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {25602#true} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {25602#true} is VALID [2022-02-20 21:54:26,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {25602#true} assume ~tmp~11.base != 0 || ~tmp~11.offset != 0; {25602#true} is VALID [2022-02-20 21:54:26,384 INFO L272 TraceCheckUtils]: 25: Hoare triple {25602#true} call #t~ret251.base, #t~ret251.offset := ldv_malloc(~size % 4294967296); {25696#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {25696#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {25602#true} is VALID [2022-02-20 21:54:26,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {25602#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,384 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {25602#true} {25602#true} #901#return; {25602#true} is VALID [2022-02-20 21:54:26,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {25602#true} call write~$Pointer$(#t~ret251.base, #t~ret251.offset, ~tmp~11.base, 224 + ~tmp~11.offset, 8);havoc #t~ret251.base, #t~ret251.offset;call #t~mem252.base, #t~mem252.offset := read~$Pointer$(~tmp~11.base, 224 + ~tmp~11.offset, 8);call write~$Pointer$(#t~mem252.base, #t~mem252.offset, ~tmp~11.base, 232 + ~tmp~11.offset, 8);havoc #t~mem252.base, #t~mem252.offset; {25602#true} is VALID [2022-02-20 21:54:26,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {25602#true} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {25602#true} is VALID [2022-02-20 21:54:26,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,385 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {25602#true} {25603#false} #869#return; {25603#false} is VALID [2022-02-20 21:54:26,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {25602#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {25602#true} is VALID [2022-02-20 21:54:26,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {25602#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {25602#true} is VALID [2022-02-20 21:54:26,386 INFO L272 TraceCheckUtils]: 2: Hoare triple {25602#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {25654#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {25602#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,387 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25602#true} {25602#true} #831#return; {25602#true} is VALID [2022-02-20 21:54:26,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {25602#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {25602#true} is VALID [2022-02-20 21:54:26,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {25602#true} assume { :end_inline_ldv_set_init } true; {25602#true} is VALID [2022-02-20 21:54:26,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {25602#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {25608#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr273#1| 0) (= (+ (- 1) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) 0))} is VALID [2022-02-20 21:54:26,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {25608#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr273#1| 0) (= (+ (- 1) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) 0))} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {25603#false} is VALID [2022-02-20 21:54:26,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {25603#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {25603#false} is VALID [2022-02-20 21:54:26,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {25603#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {25603#false} is VALID [2022-02-20 21:54:26,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {25603#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {25603#false} is VALID [2022-02-20 21:54:26,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {25603#false} assume main_#t~switch240#1; {25603#false} is VALID [2022-02-20 21:54:26,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {25603#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {25603#false} is VALID [2022-02-20 21:54:26,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {25603#false} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {25603#false} is VALID [2022-02-20 21:54:26,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {25603#false} assume main_#t~switch248#1; {25603#false} is VALID [2022-02-20 21:54:26,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {25603#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {25603#false} is VALID [2022-02-20 21:54:26,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {25603#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {25603#false} is VALID [2022-02-20 21:54:26,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {25603#false} arcnet_rfc1201_init_#res#1 := 0; {25603#false} is VALID [2022-02-20 21:54:26,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {25603#false} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {25603#false} is VALID [2022-02-20 21:54:26,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {25603#false} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset, ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset, ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {25603#false} is VALID [2022-02-20 21:54:26,390 INFO L272 TraceCheckUtils]: 23: Hoare triple {25603#false} call ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset := ldv_zalloc(20); {25654#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {25602#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,390 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25602#true} {25603#false} #889#return; {25603#false} is VALID [2022-02-20 21:54:26,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {25603#false} ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset := ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset; {25603#false} is VALID [2022-02-20 21:54:26,391 INFO L272 TraceCheckUtils]: 29: Hoare triple {25603#false} call ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset := ldv_zalloc(3264); {25654#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {25602#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,391 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {25602#true} {25603#false} #891#return; {25603#false} is VALID [2022-02-20 21:54:26,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {25603#false} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {25603#false} is VALID [2022-02-20 21:54:26,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {25603#false} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {25603#false} is VALID [2022-02-20 21:54:26,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {25603#false} assume !(0 != ~ldv_retval_0~0); {25603#false} is VALID [2022-02-20 21:54:26,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {25603#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {25603#false} is VALID [2022-02-20 21:54:26,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {25603#false} assume main_#t~switch240#1; {25603#false} is VALID [2022-02-20 21:54:26,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {25603#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet241#1 && main_#t~nondet241#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet241#1;havoc main_#t~nondet241#1;main_#t~switch242#1 := 0 == main_~tmp___7~0#1; {25603#false} is VALID [2022-02-20 21:54:26,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {25603#false} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 1 == main_~tmp___7~0#1; {25603#false} is VALID [2022-02-20 21:54:26,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {25603#false} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 2 == main_~tmp___7~0#1; {25603#false} is VALID [2022-02-20 21:54:26,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {25603#false} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 3 == main_~tmp___7~0#1; {25603#false} is VALID [2022-02-20 21:54:26,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {25603#false} assume main_#t~switch242#1; {25603#false} is VALID [2022-02-20 21:54:26,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {25603#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset, rx_#t~mem45#1, rx_#t~mem46#1, rx_#t~nondet47#1, rx_#t~mem54#1.base, rx_#t~mem54#1.offset, rx_#t~mem55#1, rx_#t~mem56#1.base, rx_#t~mem56#1.offset, rx_#t~nondet57#1, rx_#t~mem58#1, rx_#t~mem59#1, rx_#t~mem60#1, rx_#t~mem61#1, rx_#t~mem62#1.base, rx_#t~mem62#1.offset, rx_#t~mem63#1, rx_#t~mem64#1, rx_#t~mem65#1, rx_#t~ret66#1.base, rx_#t~ret66#1.offset, rx_#t~nondet67#1, rx_#t~mem68#1, rx_#t~ret69#1.base, rx_#t~ret69#1.offset, rx_#t~mem70#1.base, rx_#t~mem70#1.offset, rx_#t~memcpy~res71#1.base, rx_#t~memcpy~res71#1.offset, rx_#t~memcpy~res72#1.base, rx_#t~memcpy~res72#1.offset, rx_#t~mem79#1.base, rx_#t~mem79#1.offset, rx_#t~mem80#1, rx_#t~mem81#1, rx_#t~mem82#1, rx_#t~short83#1, rx_#t~mem84#1, rx_#t~nondet85#1, rx_#t~mem86#1, rx_#t~nondet87#1, rx_#t~mem88#1, rx_#t~mem89#1, rx_#t~mem90#1, rx_#t~mem91#1, rx_#t~ret92#1, rx_#t~ret93#1, rx_#t~mem94#1.base, rx_#t~mem94#1.offset, rx_#t~mem95#1, rx_#t~mem96#1, rx_#t~short97#1, rx_#t~nondet98#1, rx_#t~mem99#1, rx_#t~mem100#1, rx_#t~mem101#1, rx_#t~mem102#1.base, rx_#t~mem102#1.offset, rx_#t~mem103#1, rx_#t~mem104#1, rx_#t~mem105#1, rx_#t~mem106#1.base, rx_#t~mem106#1.offset, rx_#t~nondet107#1, rx_#t~mem108#1, rx_#t~mem109#1, rx_#t~mem110#1, rx_#t~mem111#1, rx_#t~mem112#1, rx_#t~mem113#1.base, rx_#t~mem113#1.offset, rx_#t~mem114#1, rx_#t~mem115#1, rx_#t~mem116#1, rx_#t~nondet117#1, rx_#t~mem118#1, rx_#t~mem119#1, rx_#t~mem120#1, rx_#t~mem121#1, rx_#t~mem122#1, rx_#t~ret123#1.base, rx_#t~ret123#1.offset, rx_#t~nondet124#1, rx_#t~mem125#1, rx_#t~mem126#1, rx_#t~mem127#1.base, rx_#t~mem127#1.offset, rx_#t~memcpy~res128#1.base, rx_#t~memcpy~res128#1.offset, rx_#t~memcpy~res129#1.base, rx_#t~memcpy~res129#1.offset, rx_#t~ret130#1.base, rx_#t~ret130#1.offset, rx_#t~mem131#1, rx_#t~mem132#1.base, rx_#t~mem132#1.offset, rx_#t~mem133#1, rx_#t~mem134#1, rx_#t~nondet135#1, rx_#t~mem136#1, rx_#t~mem137#1, rx_#t~mem138#1, rx_#t~mem139#1, rx_#t~mem140#1, rx_#t~mem141#1, rx_#t~mem142#1, rx_#t~mem143#1, rx_#t~nondet144#1, rx_#t~mem145#1, rx_#t~mem146#1, rx_#t~mem147#1, rx_#t~nondet148#1, rx_#t~mem149#1, rx_#t~mem150#1, rx_#t~mem151#1, rx_#t~mem152#1, rx_#t~mem153#1.base, rx_#t~mem153#1.offset, rx_#t~mem154#1, rx_#t~mem155#1, rx_#t~mem156#1.base, rx_#t~mem156#1.offset, rx_#t~mem157#1.base, rx_#t~mem157#1.offset, rx_#t~mem158#1.base, rx_#t~mem158#1.offset, rx_#t~mem165#1.base, rx_#t~mem165#1.offset, rx_#t~mem166#1, rx_#t~mem167#1.base, rx_#t~mem167#1.offset, rx_#t~ret168#1.base, rx_#t~ret168#1.offset, rx_#t~mem169#1, rx_#t~mem170#1, rx_#t~ret171#1, rx_#t~ret172#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~1#1.base, rx_~pkt~1#1.offset, rx_~soft~1#1.base, rx_~soft~1#1.offset, rx_~saddr~0#1, rx_~ofs~0#1, rx_~in~0#1.base, rx_~in~0#1.offset, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~0#1.offset, rx_~arp~0#1.base, rx_~arp~0#1.offset, rx_~cptr~0#1.base, rx_~cptr~0#1.offset, rx_~tmp___0~2#1, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset, rx_~packetnum~0#1, rx_~tmp___1~0#1, rx_~tmp___2~0#1;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~1#1.base, rx_~pkt~1#1.offset;havoc rx_~soft~1#1.base, rx_~soft~1#1.offset;havoc rx_~saddr~0#1;havoc rx_~ofs~0#1;havoc rx_~in~0#1.base, rx_~in~0#1.offset;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset;havoc rx_~arp~0#1.base, rx_~arp~0#1.offset;havoc rx_~cptr~0#1.base, rx_~cptr~0#1.offset;havoc rx_~tmp___0~2#1;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;havoc rx_~packetnum~0#1;havoc rx_~tmp___1~0#1;havoc rx_~tmp___2~0#1; {25603#false} is VALID [2022-02-20 21:54:26,393 INFO L272 TraceCheckUtils]: 45: Hoare triple {25603#false} call rx_#t~ret44#1.base, rx_#t~ret44#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {25602#true} is VALID [2022-02-20 21:54:26,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {25602#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {25602#true} is VALID [2022-02-20 21:54:26,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,393 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {25602#true} {25603#false} #845#return; {25603#false} is VALID [2022-02-20 21:54:26,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {25603#false} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret44#1.base, rx_#t~ret44#1.offset;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset;rx_~soft~1#1.base, rx_~soft~1#1.offset := rx_~pkthdr#1.base, 4 + rx_~pkthdr#1.offset;call rx_#t~mem45#1 := read~int(rx_~pkt~1#1.base, rx_~pkt~1#1.offset, 1);rx_~saddr~0#1 := rx_#t~mem45#1 % 256;havoc rx_#t~mem45#1;rx_~in~0#1.base, rx_~in~0#1.offset := rx_~lp~0#1.base, 440 + rx_~lp~0#1.offset + 12 * (if rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 else rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); {25603#false} is VALID [2022-02-20 21:54:26,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {25603#false} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {25603#false} is VALID [2022-02-20 21:54:26,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {25603#false} call rx_#t~mem46#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {25603#false} is VALID [2022-02-20 21:54:26,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {25603#false} assume !(255 == rx_#t~mem46#1 % 256 % 4294967296);havoc rx_#t~mem46#1; {25603#false} is VALID [2022-02-20 21:54:26,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {25603#false} call rx_#t~mem55#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {25603#false} is VALID [2022-02-20 21:54:26,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {25603#false} assume !(0 == rx_#t~mem55#1 % 256 % 4294967296);havoc rx_#t~mem55#1;call rx_#t~mem94#1.base, rx_#t~mem94#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8);rx_#t~short97#1 := 0 != (rx_#t~mem94#1.base + rx_#t~mem94#1.offset) % 18446744073709551616; {25603#false} is VALID [2022-02-20 21:54:26,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {25603#false} assume rx_#t~short97#1;call rx_#t~mem95#1 := read~int(rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);call rx_#t~mem96#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);rx_#t~short97#1 := rx_#t~mem95#1 % 65536 != rx_#t~mem96#1 % 65536; {25603#false} is VALID [2022-02-20 21:54:26,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {25603#false} assume !rx_#t~short97#1;havoc rx_#t~mem94#1.base, rx_#t~mem94#1.offset;havoc rx_#t~mem95#1;havoc rx_#t~mem96#1;havoc rx_#t~short97#1; {25603#false} is VALID [2022-02-20 21:54:26,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {25603#false} call rx_#t~mem105#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {25603#false} is VALID [2022-02-20 21:54:26,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {25603#false} assume 0 != rx_#t~mem105#1 % 256;havoc rx_#t~mem105#1;call rx_#t~mem106#1.base, rx_#t~mem106#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8); {25603#false} is VALID [2022-02-20 21:54:26,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {25603#false} assume !(0 != (rx_#t~mem106#1.base + rx_#t~mem106#1.offset) % 18446744073709551616);havoc rx_#t~mem106#1.base, rx_#t~mem106#1.offset; {25603#false} is VALID [2022-02-20 21:54:26,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {25603#false} call rx_#t~mem114#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem114#1, rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);havoc rx_#t~mem114#1;call rx_#t~mem115#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1);call write~int(2 + rx_#t~mem115#1 % 256 / 2 % 256, rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1);havoc rx_#t~mem115#1;call write~int(1, rx_~in~0#1.base, 10 + rx_~in~0#1.offset, 1);call rx_#t~mem116#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {25603#false} is VALID [2022-02-20 21:54:26,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {25603#false} assume !(rx_#t~mem116#1 % 256 % 4294967296 > 16);havoc rx_#t~mem116#1;call rx_#t~mem122#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {25603#false} is VALID [2022-02-20 21:54:26,395 INFO L272 TraceCheckUtils]: 62: Hoare triple {25603#false} call rx_#t~ret123#1.base, rx_#t~ret123#1.offset := ldv_alloc_skb_12(4 + 508 * (rx_#t~mem122#1 % 256), 32); {25655#(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:54:26,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {25655#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {25602#true} is VALID [2022-02-20 21:54:26,396 INFO L272 TraceCheckUtils]: 64: Hoare triple {25602#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {25655#(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:54:26,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {25655#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,397 INFO L272 TraceCheckUtils]: 66: Hoare triple {25602#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {25654#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {25654#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {25602#true} is VALID [2022-02-20 21:54:26,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {25602#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {25602#true} is VALID [2022-02-20 21:54:26,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {25602#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,397 INFO L272 TraceCheckUtils]: 70: Hoare triple {25602#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {25602#true} is VALID [2022-02-20 21:54:26,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {25602#true} ~cond := #in~cond; {25602#true} is VALID [2022-02-20 21:54:26,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {25602#true} assume !(0 == ~cond); {25602#true} is VALID [2022-02-20 21:54:26,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,398 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25602#true} {25602#true} #829#return; {25602#true} is VALID [2022-02-20 21:54:26,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {25602#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,398 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25602#true} {25602#true} #815#return; {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {25602#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L290 TraceCheckUtils]: 79: Hoare triple {25602#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {25602#true} assume !false; {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {25602#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L290 TraceCheckUtils]: 82: Hoare triple {25602#true} 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; {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L290 TraceCheckUtils]: 83: Hoare triple {25602#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L290 TraceCheckUtils]: 84: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,399 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {25602#true} {25602#true} #899#return; {25602#true} is VALID [2022-02-20 21:54:26,400 INFO L290 TraceCheckUtils]: 86: Hoare triple {25602#true} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {25602#true} is VALID [2022-02-20 21:54:26,400 INFO L290 TraceCheckUtils]: 87: Hoare triple {25602#true} assume ~tmp~11.base != 0 || ~tmp~11.offset != 0; {25602#true} is VALID [2022-02-20 21:54:26,400 INFO L272 TraceCheckUtils]: 88: Hoare triple {25602#true} call #t~ret251.base, #t~ret251.offset := ldv_malloc(~size % 4294967296); {25696#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:26,400 INFO L290 TraceCheckUtils]: 89: Hoare triple {25696#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {25602#true} is VALID [2022-02-20 21:54:26,401 INFO L290 TraceCheckUtils]: 90: Hoare triple {25602#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {25602#true} is VALID [2022-02-20 21:54:26,401 INFO L290 TraceCheckUtils]: 91: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,401 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {25602#true} {25602#true} #901#return; {25602#true} is VALID [2022-02-20 21:54:26,401 INFO L290 TraceCheckUtils]: 93: Hoare triple {25602#true} call write~$Pointer$(#t~ret251.base, #t~ret251.offset, ~tmp~11.base, 224 + ~tmp~11.offset, 8);havoc #t~ret251.base, #t~ret251.offset;call #t~mem252.base, #t~mem252.offset := read~$Pointer$(~tmp~11.base, 224 + ~tmp~11.offset, 8);call write~$Pointer$(#t~mem252.base, #t~mem252.offset, ~tmp~11.base, 232 + ~tmp~11.offset, 8);havoc #t~mem252.base, #t~mem252.offset; {25602#true} is VALID [2022-02-20 21:54:26,401 INFO L290 TraceCheckUtils]: 94: Hoare triple {25602#true} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {25602#true} is VALID [2022-02-20 21:54:26,401 INFO L290 TraceCheckUtils]: 95: Hoare triple {25602#true} assume true; {25602#true} is VALID [2022-02-20 21:54:26,401 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25602#true} {25603#false} #869#return; {25603#false} is VALID [2022-02-20 21:54:26,402 INFO L290 TraceCheckUtils]: 97: Hoare triple {25603#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret123#1.base, rx_#t~ret123#1.offset;havoc rx_#t~mem122#1;havoc rx_#t~ret123#1.base, rx_#t~ret123#1.offset;call write~$Pointer$(rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~in~0#1.base, rx_~in~0#1.offset, 8); {25603#false} is VALID [2022-02-20 21:54:26,402 INFO L290 TraceCheckUtils]: 98: Hoare triple {25603#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {25603#false} is VALID [2022-02-20 21:54:26,403 INFO L290 TraceCheckUtils]: 99: Hoare triple {25603#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet124#1; {25603#false} is VALID [2022-02-20 21:54:26,403 INFO L290 TraceCheckUtils]: 100: Hoare triple {25603#false} call rx_#t~mem125#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem125#1, rx_~lp~0#1.base, 438 + rx_~lp~0#1.offset, 2);havoc rx_#t~mem125#1;call rx_#t~mem126#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem126#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem126#1; {25603#false} is VALID [2022-02-20 21:54:26,403 INFO L290 TraceCheckUtils]: 101: Hoare triple {25603#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {25603#false} is VALID [2022-02-20 21:54:26,403 INFO L290 TraceCheckUtils]: 102: Hoare triple {25603#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {25603#false} is VALID [2022-02-20 21:54:26,403 INFO L290 TraceCheckUtils]: 103: Hoare triple {25603#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {25603#false} is VALID [2022-02-20 21:54:26,403 INFO L290 TraceCheckUtils]: 104: Hoare triple {25603#false} assume main_#t~switch240#1; {25603#false} is VALID [2022-02-20 21:54:26,403 INFO L290 TraceCheckUtils]: 105: Hoare triple {25603#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {25603#false} is VALID [2022-02-20 21:54:26,404 INFO L290 TraceCheckUtils]: 106: Hoare triple {25603#false} assume main_#t~switch248#1; {25603#false} is VALID [2022-02-20 21:54:26,404 INFO L290 TraceCheckUtils]: 107: Hoare triple {25603#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {25603#false} is VALID [2022-02-20 21:54:26,404 INFO L290 TraceCheckUtils]: 108: Hoare triple {25603#false} assume { :end_inline_arcnet_unregister_proto } true; {25603#false} is VALID [2022-02-20 21:54:26,404 INFO L290 TraceCheckUtils]: 109: Hoare triple {25603#false} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {25603#false} is VALID [2022-02-20 21:54:26,404 INFO L290 TraceCheckUtils]: 110: Hoare triple {25603#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {25603#false} is VALID [2022-02-20 21:54:26,404 INFO L290 TraceCheckUtils]: 111: Hoare triple {25603#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {25603#false} is VALID [2022-02-20 21:54:26,404 INFO L290 TraceCheckUtils]: 112: Hoare triple {25603#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {25603#false} is VALID [2022-02-20 21:54:26,405 INFO L272 TraceCheckUtils]: 113: Hoare triple {25603#false} call ldv_error(); {25603#false} is VALID [2022-02-20 21:54:26,405 INFO L290 TraceCheckUtils]: 114: Hoare triple {25603#false} assume !false; {25603#false} is VALID [2022-02-20 21:54:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-02-20 21:54:26,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:26,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678985464] [2022-02-20 21:54:26,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678985464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:26,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:26,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:54:26,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277635278] [2022-02-20 21:54:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:26,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2022-02-20 21:54:26,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:26,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:26,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:26,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:54:26,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:54:26,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:54:26,502 INFO L87 Difference]: Start difference. First operand 646 states and 910 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:28,233 INFO L93 Difference]: Finished difference Result 1347 states and 1922 transitions. [2022-02-20 21:54:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:54:28,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2022-02-20 21:54:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2022-02-20 21:54:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2022-02-20 21:54:28,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 903 transitions. [2022-02-20 21:54:29,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 903 edges. 903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:29,056 INFO L225 Difference]: With dead ends: 1347 [2022-02-20 21:54:29,057 INFO L226 Difference]: Without dead ends: 719 [2022-02-20 21:54:29,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:54:29,059 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 143 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:29,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 1029 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:54:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-02-20 21:54:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 647. [2022-02-20 21:54:29,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:29,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:29,107 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:29,107 INFO L87 Difference]: Start difference. First operand 719 states. Second operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:29,137 INFO L93 Difference]: Finished difference Result 719 states and 1031 transitions. [2022-02-20 21:54:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1031 transitions. [2022-02-20 21:54:29,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:29,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:29,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) Second operand 719 states. [2022-02-20 21:54:29,142 INFO L87 Difference]: Start difference. First operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) Second operand 719 states. [2022-02-20 21:54:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:29,177 INFO L93 Difference]: Finished difference Result 719 states and 1031 transitions. [2022-02-20 21:54:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1031 transitions. [2022-02-20 21:54:29,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:29,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:29,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:29,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2022-02-20 21:54:29,211 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 115 [2022-02-20 21:54:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:29,211 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2022-02-20 21:54:29,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2022-02-20 21:54:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-20 21:54:29,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:29,213 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:29,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 21:54:29,214 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash -363635253, now seen corresponding path program 1 times [2022-02-20 21:54:29,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:29,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230322015] [2022-02-20 21:54:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29632#true} {29632#true} #831#return; {29632#true} is VALID [2022-02-20 21:54:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:54:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29632#true} {29632#true} #889#return; {29632#true} is VALID [2022-02-20 21:54:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:54:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29632#true} {29632#true} #891#return; {29632#true} is VALID [2022-02-20 21:54:29,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:54:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {29632#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {29632#true} is VALID [2022-02-20 21:54:29,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29632#true} {29632#true} #845#return; {29632#true} is VALID [2022-02-20 21:54:29,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-20 21:54:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:54:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {29632#true} ~cond := #in~cond; {29632#true} is VALID [2022-02-20 21:54:29,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume !(0 == ~cond); {29632#true} is VALID [2022-02-20 21:54:29,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29632#true} {29632#true} #829#return; {29632#true} is VALID [2022-02-20 21:54:29,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {29632#true} is VALID [2022-02-20 21:54:29,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {29632#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,519 INFO L272 TraceCheckUtils]: 3: Hoare triple {29632#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {29632#true} is VALID [2022-02-20 21:54:29,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {29632#true} ~cond := #in~cond; {29632#true} is VALID [2022-02-20 21:54:29,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {29632#true} assume !(0 == ~cond); {29632#true} is VALID [2022-02-20 21:54:29,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,520 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29632#true} {29632#true} #829#return; {29632#true} is VALID [2022-02-20 21:54:29,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {29632#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29632#true} {29632#true} #815#return; {29632#true} is VALID [2022-02-20 21:54:29,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {29687#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,521 INFO L272 TraceCheckUtils]: 1: Hoare triple {29632#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {29686#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {29632#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {29632#true} is VALID [2022-02-20 21:54:29,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {29632#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,522 INFO L272 TraceCheckUtils]: 5: Hoare triple {29632#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {29632#true} is VALID [2022-02-20 21:54:29,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {29632#true} ~cond := #in~cond; {29632#true} is VALID [2022-02-20 21:54:29,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {29632#true} assume !(0 == ~cond); {29632#true} is VALID [2022-02-20 21:54:29,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,522 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {29632#true} {29632#true} #829#return; {29632#true} is VALID [2022-02-20 21:54:29,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {29632#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,523 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29632#true} {29632#true} #815#return; {29632#true} is VALID [2022-02-20 21:54:29,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {29632#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {29632#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {29632#true} is VALID [2022-02-20 21:54:29,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {29632#true} assume !false; {29632#true} is VALID [2022-02-20 21:54:29,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {29632#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {29632#true} is VALID [2022-02-20 21:54:29,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {29632#true} 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; {29632#true} is VALID [2022-02-20 21:54:29,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {29632#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,524 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29632#true} {29632#true} #899#return; {29632#true} is VALID [2022-02-20 21:54:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 21:54:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:29,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {29728#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {29632#true} is VALID [2022-02-20 21:54:29,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29632#true} {29632#true} #901#return; {29632#true} is VALID [2022-02-20 21:54:29,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {29687#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {29632#true} is VALID [2022-02-20 21:54:29,540 INFO L272 TraceCheckUtils]: 1: Hoare triple {29632#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {29687#(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:54:29,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {29687#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,540 INFO L272 TraceCheckUtils]: 3: Hoare triple {29632#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {29686#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {29632#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {29632#true} is VALID [2022-02-20 21:54:29,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {29632#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,541 INFO L272 TraceCheckUtils]: 7: Hoare triple {29632#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {29632#true} is VALID [2022-02-20 21:54:29,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {29632#true} ~cond := #in~cond; {29632#true} is VALID [2022-02-20 21:54:29,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {29632#true} assume !(0 == ~cond); {29632#true} is VALID [2022-02-20 21:54:29,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,542 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29632#true} {29632#true} #829#return; {29632#true} is VALID [2022-02-20 21:54:29,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {29632#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,542 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {29632#true} {29632#true} #815#return; {29632#true} is VALID [2022-02-20 21:54:29,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {29632#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {29632#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {29632#true} is VALID [2022-02-20 21:54:29,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {29632#true} assume !false; {29632#true} is VALID [2022-02-20 21:54:29,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {29632#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {29632#true} is VALID [2022-02-20 21:54:29,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {29632#true} 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; {29632#true} is VALID [2022-02-20 21:54:29,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {29632#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,543 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29632#true} {29632#true} #899#return; {29632#true} is VALID [2022-02-20 21:54:29,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {29632#true} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {29632#true} is VALID [2022-02-20 21:54:29,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {29632#true} assume ~tmp~11.base != 0 || ~tmp~11.offset != 0; {29632#true} is VALID [2022-02-20 21:54:29,544 INFO L272 TraceCheckUtils]: 25: Hoare triple {29632#true} call #t~ret251.base, #t~ret251.offset := ldv_malloc(~size % 4294967296); {29728#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {29728#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {29632#true} is VALID [2022-02-20 21:54:29,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {29632#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,545 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {29632#true} {29632#true} #901#return; {29632#true} is VALID [2022-02-20 21:54:29,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {29632#true} call write~$Pointer$(#t~ret251.base, #t~ret251.offset, ~tmp~11.base, 224 + ~tmp~11.offset, 8);havoc #t~ret251.base, #t~ret251.offset;call #t~mem252.base, #t~mem252.offset := read~$Pointer$(~tmp~11.base, 224 + ~tmp~11.offset, 8);call write~$Pointer$(#t~mem252.base, #t~mem252.offset, ~tmp~11.base, 232 + ~tmp~11.offset, 8);havoc #t~mem252.base, #t~mem252.offset; {29632#true} is VALID [2022-02-20 21:54:29,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {29632#true} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {29632#true} is VALID [2022-02-20 21:54:29,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,545 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {29632#true} {29633#false} #869#return; {29633#false} is VALID [2022-02-20 21:54:29,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {29632#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {29632#true} is VALID [2022-02-20 21:54:29,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {29632#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {29632#true} is VALID [2022-02-20 21:54:29,546 INFO L272 TraceCheckUtils]: 2: Hoare triple {29632#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {29686#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {29632#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,547 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29632#true} {29632#true} #831#return; {29632#true} is VALID [2022-02-20 21:54:29,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {29632#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {29632#true} is VALID [2022-02-20 21:54:29,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {29632#true} assume { :end_inline_ldv_set_init } true; {29632#true} is VALID [2022-02-20 21:54:29,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {29632#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {29632#true} is VALID [2022-02-20 21:54:29,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {29632#true} assume #Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr273#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr273#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr273#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr273#1 := 1 + #Ultimate.C_memset_#t~loopctr273#1; {29632#true} is VALID [2022-02-20 21:54:29,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {29632#true} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {29632#true} is VALID [2022-02-20 21:54:29,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {29632#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {29632#true} is VALID [2022-02-20 21:54:29,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {29632#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {29632#true} is VALID [2022-02-20 21:54:29,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {29632#true} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {29632#true} is VALID [2022-02-20 21:54:29,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {29632#true} assume main_#t~switch240#1; {29632#true} is VALID [2022-02-20 21:54:29,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {29632#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {29632#true} is VALID [2022-02-20 21:54:29,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {29632#true} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {29632#true} is VALID [2022-02-20 21:54:29,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {29632#true} assume main_#t~switch248#1; {29632#true} is VALID [2022-02-20 21:54:29,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {29632#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {29632#true} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {29632#true} is VALID [2022-02-20 21:54:29,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {29632#true} arcnet_rfc1201_init_#res#1 := 0; {29632#true} is VALID [2022-02-20 21:54:29,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {29632#true} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {29632#true} is VALID [2022-02-20 21:54:29,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {29632#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset, ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset, ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,550 INFO L272 TraceCheckUtils]: 24: Hoare triple {29632#true} call ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset := ldv_zalloc(20); {29686#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {29632#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,550 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {29632#true} {29632#true} #889#return; {29632#true} is VALID [2022-02-20 21:54:29,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {29632#true} ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset := ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,551 INFO L272 TraceCheckUtils]: 30: Hoare triple {29632#true} call ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset := ldv_zalloc(3264); {29686#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {29632#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,552 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29632#true} {29632#true} #891#return; {29632#true} is VALID [2022-02-20 21:54:29,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {29632#true} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {29632#true} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {29632#true} is VALID [2022-02-20 21:54:29,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {29632#true} assume !(0 != ~ldv_retval_0~0); {29632#true} is VALID [2022-02-20 21:54:29,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {29632#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {29632#true} is VALID [2022-02-20 21:54:29,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {29632#true} assume main_#t~switch240#1; {29632#true} is VALID [2022-02-20 21:54:29,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {29632#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet241#1 && main_#t~nondet241#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet241#1;havoc main_#t~nondet241#1;main_#t~switch242#1 := 0 == main_~tmp___7~0#1; {29632#true} is VALID [2022-02-20 21:54:29,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {29632#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 1 == main_~tmp___7~0#1; {29632#true} is VALID [2022-02-20 21:54:29,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {29632#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 2 == main_~tmp___7~0#1; {29632#true} is VALID [2022-02-20 21:54:29,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {29632#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 3 == main_~tmp___7~0#1; {29632#true} is VALID [2022-02-20 21:54:29,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {29632#true} assume main_#t~switch242#1; {29632#true} is VALID [2022-02-20 21:54:29,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {29632#true} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset, rx_#t~mem45#1, rx_#t~mem46#1, rx_#t~nondet47#1, rx_#t~mem54#1.base, rx_#t~mem54#1.offset, rx_#t~mem55#1, rx_#t~mem56#1.base, rx_#t~mem56#1.offset, rx_#t~nondet57#1, rx_#t~mem58#1, rx_#t~mem59#1, rx_#t~mem60#1, rx_#t~mem61#1, rx_#t~mem62#1.base, rx_#t~mem62#1.offset, rx_#t~mem63#1, rx_#t~mem64#1, rx_#t~mem65#1, rx_#t~ret66#1.base, rx_#t~ret66#1.offset, rx_#t~nondet67#1, rx_#t~mem68#1, rx_#t~ret69#1.base, rx_#t~ret69#1.offset, rx_#t~mem70#1.base, rx_#t~mem70#1.offset, rx_#t~memcpy~res71#1.base, rx_#t~memcpy~res71#1.offset, rx_#t~memcpy~res72#1.base, rx_#t~memcpy~res72#1.offset, rx_#t~mem79#1.base, rx_#t~mem79#1.offset, rx_#t~mem80#1, rx_#t~mem81#1, rx_#t~mem82#1, rx_#t~short83#1, rx_#t~mem84#1, rx_#t~nondet85#1, rx_#t~mem86#1, rx_#t~nondet87#1, rx_#t~mem88#1, rx_#t~mem89#1, rx_#t~mem90#1, rx_#t~mem91#1, rx_#t~ret92#1, rx_#t~ret93#1, rx_#t~mem94#1.base, rx_#t~mem94#1.offset, rx_#t~mem95#1, rx_#t~mem96#1, rx_#t~short97#1, rx_#t~nondet98#1, rx_#t~mem99#1, rx_#t~mem100#1, rx_#t~mem101#1, rx_#t~mem102#1.base, rx_#t~mem102#1.offset, rx_#t~mem103#1, rx_#t~mem104#1, rx_#t~mem105#1, rx_#t~mem106#1.base, rx_#t~mem106#1.offset, rx_#t~nondet107#1, rx_#t~mem108#1, rx_#t~mem109#1, rx_#t~mem110#1, rx_#t~mem111#1, rx_#t~mem112#1, rx_#t~mem113#1.base, rx_#t~mem113#1.offset, rx_#t~mem114#1, rx_#t~mem115#1, rx_#t~mem116#1, rx_#t~nondet117#1, rx_#t~mem118#1, rx_#t~mem119#1, rx_#t~mem120#1, rx_#t~mem121#1, rx_#t~mem122#1, rx_#t~ret123#1.base, rx_#t~ret123#1.offset, rx_#t~nondet124#1, rx_#t~mem125#1, rx_#t~mem126#1, rx_#t~mem127#1.base, rx_#t~mem127#1.offset, rx_#t~memcpy~res128#1.base, rx_#t~memcpy~res128#1.offset, rx_#t~memcpy~res129#1.base, rx_#t~memcpy~res129#1.offset, rx_#t~ret130#1.base, rx_#t~ret130#1.offset, rx_#t~mem131#1, rx_#t~mem132#1.base, rx_#t~mem132#1.offset, rx_#t~mem133#1, rx_#t~mem134#1, rx_#t~nondet135#1, rx_#t~mem136#1, rx_#t~mem137#1, rx_#t~mem138#1, rx_#t~mem139#1, rx_#t~mem140#1, rx_#t~mem141#1, rx_#t~mem142#1, rx_#t~mem143#1, rx_#t~nondet144#1, rx_#t~mem145#1, rx_#t~mem146#1, rx_#t~mem147#1, rx_#t~nondet148#1, rx_#t~mem149#1, rx_#t~mem150#1, rx_#t~mem151#1, rx_#t~mem152#1, rx_#t~mem153#1.base, rx_#t~mem153#1.offset, rx_#t~mem154#1, rx_#t~mem155#1, rx_#t~mem156#1.base, rx_#t~mem156#1.offset, rx_#t~mem157#1.base, rx_#t~mem157#1.offset, rx_#t~mem158#1.base, rx_#t~mem158#1.offset, rx_#t~mem165#1.base, rx_#t~mem165#1.offset, rx_#t~mem166#1, rx_#t~mem167#1.base, rx_#t~mem167#1.offset, rx_#t~ret168#1.base, rx_#t~ret168#1.offset, rx_#t~mem169#1, rx_#t~mem170#1, rx_#t~ret171#1, rx_#t~ret172#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~1#1.base, rx_~pkt~1#1.offset, rx_~soft~1#1.base, rx_~soft~1#1.offset, rx_~saddr~0#1, rx_~ofs~0#1, rx_~in~0#1.base, rx_~in~0#1.offset, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~0#1.offset, rx_~arp~0#1.base, rx_~arp~0#1.offset, rx_~cptr~0#1.base, rx_~cptr~0#1.offset, rx_~tmp___0~2#1, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset, rx_~packetnum~0#1, rx_~tmp___1~0#1, rx_~tmp___2~0#1;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~1#1.base, rx_~pkt~1#1.offset;havoc rx_~soft~1#1.base, rx_~soft~1#1.offset;havoc rx_~saddr~0#1;havoc rx_~ofs~0#1;havoc rx_~in~0#1.base, rx_~in~0#1.offset;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset;havoc rx_~arp~0#1.base, rx_~arp~0#1.offset;havoc rx_~cptr~0#1.base, rx_~cptr~0#1.offset;havoc rx_~tmp___0~2#1;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;havoc rx_~packetnum~0#1;havoc rx_~tmp___1~0#1;havoc rx_~tmp___2~0#1; {29632#true} is VALID [2022-02-20 21:54:29,553 INFO L272 TraceCheckUtils]: 46: Hoare triple {29632#true} call rx_#t~ret44#1.base, rx_#t~ret44#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {29632#true} is VALID [2022-02-20 21:54:29,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {29632#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {29632#true} is VALID [2022-02-20 21:54:29,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,554 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29632#true} {29632#true} #845#return; {29632#true} is VALID [2022-02-20 21:54:29,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {29632#true} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret44#1.base, rx_#t~ret44#1.offset;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset;rx_~soft~1#1.base, rx_~soft~1#1.offset := rx_~pkthdr#1.base, 4 + rx_~pkthdr#1.offset;call rx_#t~mem45#1 := read~int(rx_~pkt~1#1.base, rx_~pkt~1#1.offset, 1);rx_~saddr~0#1 := rx_#t~mem45#1 % 256;havoc rx_#t~mem45#1;rx_~in~0#1.base, rx_~in~0#1.offset := rx_~lp~0#1.base, 440 + rx_~lp~0#1.offset + 12 * (if rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 else rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); {29632#true} is VALID [2022-02-20 21:54:29,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {29632#true} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {29632#true} is VALID [2022-02-20 21:54:29,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {29632#true} call rx_#t~mem46#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {29632#true} is VALID [2022-02-20 21:54:29,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {29632#true} assume !(255 == rx_#t~mem46#1 % 256 % 4294967296);havoc rx_#t~mem46#1; {29632#true} is VALID [2022-02-20 21:54:29,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {29632#true} call rx_#t~mem55#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {29632#true} is VALID [2022-02-20 21:54:29,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {29632#true} assume !(0 == rx_#t~mem55#1 % 256 % 4294967296);havoc rx_#t~mem55#1;call rx_#t~mem94#1.base, rx_#t~mem94#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8);rx_#t~short97#1 := 0 != (rx_#t~mem94#1.base + rx_#t~mem94#1.offset) % 18446744073709551616; {29649#(or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616))) (not |ULTIMATE.start_rx_#t~short97#1|))} is VALID [2022-02-20 21:54:29,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {29649#(or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616))) (not |ULTIMATE.start_rx_#t~short97#1|))} assume rx_#t~short97#1;call rx_#t~mem95#1 := read~int(rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);call rx_#t~mem96#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);rx_#t~short97#1 := rx_#t~mem95#1 % 65536 != rx_#t~mem96#1 % 65536; {29650#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616)))} is VALID [2022-02-20 21:54:29,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {29650#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616)))} assume !rx_#t~short97#1;havoc rx_#t~mem94#1.base, rx_#t~mem94#1.offset;havoc rx_#t~mem95#1;havoc rx_#t~mem96#1;havoc rx_#t~short97#1; {29650#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616)))} is VALID [2022-02-20 21:54:29,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {29650#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616)))} call rx_#t~mem105#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {29650#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616)))} is VALID [2022-02-20 21:54:29,559 INFO L290 TraceCheckUtils]: 59: Hoare triple {29650#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) (+ 18446744073709551615 (* (div (+ (- 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_rx_~in~0#1.base|) |ULTIMATE.start_rx_~in~0#1.offset|)) 18446744073709551616) 18446744073709551616)))} assume 0 != rx_#t~mem105#1 % 256;havoc rx_#t~mem105#1;call rx_#t~mem106#1.base, rx_#t~mem106#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8); {29651#(<= (+ (* 18446744073709551616 (div (+ |ULTIMATE.start_rx_#t~mem106#1.offset| |ULTIMATE.start_rx_#t~mem106#1.base|) 18446744073709551616)) 1) (+ |ULTIMATE.start_rx_#t~mem106#1.offset| |ULTIMATE.start_rx_#t~mem106#1.base|))} is VALID [2022-02-20 21:54:29,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {29651#(<= (+ (* 18446744073709551616 (div (+ |ULTIMATE.start_rx_#t~mem106#1.offset| |ULTIMATE.start_rx_#t~mem106#1.base|) 18446744073709551616)) 1) (+ |ULTIMATE.start_rx_#t~mem106#1.offset| |ULTIMATE.start_rx_#t~mem106#1.base|))} assume !(0 != (rx_#t~mem106#1.base + rx_#t~mem106#1.offset) % 18446744073709551616);havoc rx_#t~mem106#1.base, rx_#t~mem106#1.offset; {29633#false} is VALID [2022-02-20 21:54:29,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {29633#false} call rx_#t~mem114#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem114#1, rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);havoc rx_#t~mem114#1;call rx_#t~mem115#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1);call write~int(2 + rx_#t~mem115#1 % 256 / 2 % 256, rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1);havoc rx_#t~mem115#1;call write~int(1, rx_~in~0#1.base, 10 + rx_~in~0#1.offset, 1);call rx_#t~mem116#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {29633#false} is VALID [2022-02-20 21:54:29,560 INFO L290 TraceCheckUtils]: 62: Hoare triple {29633#false} assume !(rx_#t~mem116#1 % 256 % 4294967296 > 16);havoc rx_#t~mem116#1;call rx_#t~mem122#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {29633#false} is VALID [2022-02-20 21:54:29,560 INFO L272 TraceCheckUtils]: 63: Hoare triple {29633#false} call rx_#t~ret123#1.base, rx_#t~ret123#1.offset := ldv_alloc_skb_12(4 + 508 * (rx_#t~mem122#1 % 256), 32); {29687#(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:54:29,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {29687#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {29632#true} is VALID [2022-02-20 21:54:29,561 INFO L272 TraceCheckUtils]: 65: Hoare triple {29632#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {29687#(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:54:29,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {29687#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,562 INFO L272 TraceCheckUtils]: 67: Hoare triple {29632#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {29686#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {29686#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {29632#true} is VALID [2022-02-20 21:54:29,562 INFO L290 TraceCheckUtils]: 69: Hoare triple {29632#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {29632#true} is VALID [2022-02-20 21:54:29,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {29632#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,563 INFO L272 TraceCheckUtils]: 71: Hoare triple {29632#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {29632#true} is VALID [2022-02-20 21:54:29,563 INFO L290 TraceCheckUtils]: 72: Hoare triple {29632#true} ~cond := #in~cond; {29632#true} is VALID [2022-02-20 21:54:29,563 INFO L290 TraceCheckUtils]: 73: Hoare triple {29632#true} assume !(0 == ~cond); {29632#true} is VALID [2022-02-20 21:54:29,563 INFO L290 TraceCheckUtils]: 74: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,563 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {29632#true} {29632#true} #829#return; {29632#true} is VALID [2022-02-20 21:54:29,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {29632#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,564 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {29632#true} {29632#true} #815#return; {29632#true} is VALID [2022-02-20 21:54:29,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {29632#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {29632#true} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {29632#true} is VALID [2022-02-20 21:54:29,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {29632#true} assume !false; {29632#true} is VALID [2022-02-20 21:54:29,564 INFO L290 TraceCheckUtils]: 82: Hoare triple {29632#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {29632#true} is VALID [2022-02-20 21:54:29,564 INFO L290 TraceCheckUtils]: 83: Hoare triple {29632#true} 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; {29632#true} is VALID [2022-02-20 21:54:29,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {29632#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {29632#true} is VALID [2022-02-20 21:54:29,565 INFO L290 TraceCheckUtils]: 85: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,565 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {29632#true} {29632#true} #899#return; {29632#true} is VALID [2022-02-20 21:54:29,565 INFO L290 TraceCheckUtils]: 87: Hoare triple {29632#true} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {29632#true} is VALID [2022-02-20 21:54:29,565 INFO L290 TraceCheckUtils]: 88: Hoare triple {29632#true} assume ~tmp~11.base != 0 || ~tmp~11.offset != 0; {29632#true} is VALID [2022-02-20 21:54:29,565 INFO L272 TraceCheckUtils]: 89: Hoare triple {29632#true} call #t~ret251.base, #t~ret251.offset := ldv_malloc(~size % 4294967296); {29728#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:29,566 INFO L290 TraceCheckUtils]: 90: Hoare triple {29728#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {29632#true} is VALID [2022-02-20 21:54:29,566 INFO L290 TraceCheckUtils]: 91: Hoare triple {29632#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {29632#true} is VALID [2022-02-20 21:54:29,566 INFO L290 TraceCheckUtils]: 92: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,566 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {29632#true} {29632#true} #901#return; {29632#true} is VALID [2022-02-20 21:54:29,566 INFO L290 TraceCheckUtils]: 94: Hoare triple {29632#true} call write~$Pointer$(#t~ret251.base, #t~ret251.offset, ~tmp~11.base, 224 + ~tmp~11.offset, 8);havoc #t~ret251.base, #t~ret251.offset;call #t~mem252.base, #t~mem252.offset := read~$Pointer$(~tmp~11.base, 224 + ~tmp~11.offset, 8);call write~$Pointer$(#t~mem252.base, #t~mem252.offset, ~tmp~11.base, 232 + ~tmp~11.offset, 8);havoc #t~mem252.base, #t~mem252.offset; {29632#true} is VALID [2022-02-20 21:54:29,566 INFO L290 TraceCheckUtils]: 95: Hoare triple {29632#true} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {29632#true} is VALID [2022-02-20 21:54:29,566 INFO L290 TraceCheckUtils]: 96: Hoare triple {29632#true} assume true; {29632#true} is VALID [2022-02-20 21:54:29,567 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29632#true} {29633#false} #869#return; {29633#false} is VALID [2022-02-20 21:54:29,567 INFO L290 TraceCheckUtils]: 98: Hoare triple {29633#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret123#1.base, rx_#t~ret123#1.offset;havoc rx_#t~mem122#1;havoc rx_#t~ret123#1.base, rx_#t~ret123#1.offset;call write~$Pointer$(rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~in~0#1.base, rx_~in~0#1.offset, 8); {29633#false} is VALID [2022-02-20 21:54:29,567 INFO L290 TraceCheckUtils]: 99: Hoare triple {29633#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {29633#false} is VALID [2022-02-20 21:54:29,567 INFO L290 TraceCheckUtils]: 100: Hoare triple {29633#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet124#1; {29633#false} is VALID [2022-02-20 21:54:29,567 INFO L290 TraceCheckUtils]: 101: Hoare triple {29633#false} call rx_#t~mem125#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem125#1, rx_~lp~0#1.base, 438 + rx_~lp~0#1.offset, 2);havoc rx_#t~mem125#1;call rx_#t~mem126#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem126#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem126#1; {29633#false} is VALID [2022-02-20 21:54:29,567 INFO L290 TraceCheckUtils]: 102: Hoare triple {29633#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {29633#false} is VALID [2022-02-20 21:54:29,567 INFO L290 TraceCheckUtils]: 103: Hoare triple {29633#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {29633#false} is VALID [2022-02-20 21:54:29,568 INFO L290 TraceCheckUtils]: 104: Hoare triple {29633#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {29633#false} is VALID [2022-02-20 21:54:29,568 INFO L290 TraceCheckUtils]: 105: Hoare triple {29633#false} assume main_#t~switch240#1; {29633#false} is VALID [2022-02-20 21:54:29,568 INFO L290 TraceCheckUtils]: 106: Hoare triple {29633#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {29633#false} is VALID [2022-02-20 21:54:29,568 INFO L290 TraceCheckUtils]: 107: Hoare triple {29633#false} assume main_#t~switch248#1; {29633#false} is VALID [2022-02-20 21:54:29,568 INFO L290 TraceCheckUtils]: 108: Hoare triple {29633#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {29633#false} is VALID [2022-02-20 21:54:29,568 INFO L290 TraceCheckUtils]: 109: Hoare triple {29633#false} assume { :end_inline_arcnet_unregister_proto } true; {29633#false} is VALID [2022-02-20 21:54:29,568 INFO L290 TraceCheckUtils]: 110: Hoare triple {29633#false} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {29633#false} is VALID [2022-02-20 21:54:29,569 INFO L290 TraceCheckUtils]: 111: Hoare triple {29633#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {29633#false} is VALID [2022-02-20 21:54:29,569 INFO L290 TraceCheckUtils]: 112: Hoare triple {29633#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {29633#false} is VALID [2022-02-20 21:54:29,569 INFO L290 TraceCheckUtils]: 113: Hoare triple {29633#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {29633#false} is VALID [2022-02-20 21:54:29,569 INFO L272 TraceCheckUtils]: 114: Hoare triple {29633#false} call ldv_error(); {29633#false} is VALID [2022-02-20 21:54:29,569 INFO L290 TraceCheckUtils]: 115: Hoare triple {29633#false} assume !false; {29633#false} is VALID [2022-02-20 21:54:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 21:54:29,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:29,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230322015] [2022-02-20 21:54:29,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230322015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:29,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:29,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:54:29,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028433676] [2022-02-20 21:54:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:29,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-02-20 21:54:29,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:29,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:29,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:29,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:54:29,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:29,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:54:29,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:54:29,668 INFO L87 Difference]: Start difference. First operand 647 states and 911 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:35,474 INFO L93 Difference]: Finished difference Result 1503 states and 2175 transitions. [2022-02-20 21:54:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:54:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-02-20 21:54:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1020 transitions. [2022-02-20 21:54:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1020 transitions. [2022-02-20 21:54:35,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1020 transitions. [2022-02-20 21:54:36,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1020 edges. 1020 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:36,454 INFO L225 Difference]: With dead ends: 1503 [2022-02-20 21:54:36,454 INFO L226 Difference]: Without dead ends: 889 [2022-02-20 21:54:36,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:54:36,456 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 183 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:36,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 2155 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 21:54:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-02-20 21:54:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 655. [2022-02-20 21:54:36,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:36,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 889 states. Second operand has 655 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 535 states have internal predecessors, (737), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:36,517 INFO L74 IsIncluded]: Start isIncluded. First operand 889 states. Second operand has 655 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 535 states have internal predecessors, (737), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:36,519 INFO L87 Difference]: Start difference. First operand 889 states. Second operand has 655 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 535 states have internal predecessors, (737), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:36,564 INFO L93 Difference]: Finished difference Result 889 states and 1301 transitions. [2022-02-20 21:54:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1301 transitions. [2022-02-20 21:54:36,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:36,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:36,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 655 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 535 states have internal predecessors, (737), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) Second operand 889 states. [2022-02-20 21:54:36,569 INFO L87 Difference]: Start difference. First operand has 655 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 535 states have internal predecessors, (737), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) Second operand 889 states. [2022-02-20 21:54:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:36,613 INFO L93 Difference]: Finished difference Result 889 states and 1301 transitions. [2022-02-20 21:54:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1301 transitions. [2022-02-20 21:54:36,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:36,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:36,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:36,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 535 states have internal predecessors, (737), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-02-20 21:54:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 923 transitions. [2022-02-20 21:54:36,648 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 923 transitions. Word has length 116 [2022-02-20 21:54:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:36,648 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 923 transitions. [2022-02-20 21:54:36,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:54:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 923 transitions. [2022-02-20 21:54:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-20 21:54:36,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:36,653 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:36,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 21:54:36,653 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash -161811319, now seen corresponding path program 1 times [2022-02-20 21:54:36,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:36,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740112720] [2022-02-20 21:54:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:36,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:36,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {34196#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:36,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:36,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34196#true} {34196#true} #831#return; {34196#true} is VALID [2022-02-20 21:54:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:54:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:36,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:36,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {34196#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:36,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:36,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34196#true} {34196#true} #889#return; {34196#true} is VALID [2022-02-20 21:54:36,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:54:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:36,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:36,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {34196#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:36,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:36,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34196#true} {34196#true} #891#return; {34196#true} is VALID [2022-02-20 21:54:36,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:54:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:36,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {34196#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {34196#true} is VALID [2022-02-20 21:54:36,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:36,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34196#true} {34196#true} #845#return; {34196#true} is VALID [2022-02-20 21:54:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-20 21:54:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:37,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:54:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:37,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {34196#true} ~cond := #in~cond; {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:54:37,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} #829#return; {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} is VALID [2022-02-20 21:54:37,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:37,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {34196#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} is VALID [2022-02-20 21:54:37,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} is VALID [2022-02-20 21:54:37,336 INFO L272 TraceCheckUtils]: 3: Hoare triple {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {34196#true} is VALID [2022-02-20 21:54:37,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {34196#true} ~cond := #in~cond; {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:54:37,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,338 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} #829#return; {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} is VALID [2022-02-20 21:54:37,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} assume true; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} {34196#true} #815#return; {34290#(and (= |ldv_skb_alloc_#t~ret260#1.offset| 0) (<= |ldv_skb_alloc_#t~ret260#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#t~ret260#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {34250#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,342 INFO L272 TraceCheckUtils]: 1: Hoare triple {34196#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {34249#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:37,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {34196#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} is VALID [2022-02-20 21:54:37,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} is VALID [2022-02-20 21:54:37,344 INFO L272 TraceCheckUtils]: 5: Hoare triple {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {34196#true} is VALID [2022-02-20 21:54:37,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {34196#true} ~cond := #in~cond; {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:54:37,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,346 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} #829#return; {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} is VALID [2022-02-20 21:54:37,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} assume true; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,349 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} {34196#true} #815#return; {34290#(and (= |ldv_skb_alloc_#t~ret260#1.offset| 0) (<= |ldv_skb_alloc_#t~ret260#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#t~ret260#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {34290#(and (= |ldv_skb_alloc_#t~ret260#1.offset| 0) (<= |ldv_skb_alloc_#t~ret260#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#t~ret260#1.base|) 18446744073709551616)))))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !false; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} 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; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} assume true; {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,355 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} {34196#true} #899#return; {34272#(and (= |ldv_alloc_skb_12_#t~ret250.offset| 0) (<= 1 (+ |ldv_alloc_skb_12_#t~ret250.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#t~ret250.base|)) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 21:54:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:37,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {34303#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {34196#true} is VALID [2022-02-20 21:54:37,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {34196#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:37,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:37,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34196#true} {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} #901#return; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {34250#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {34196#true} is VALID [2022-02-20 21:54:37,388 INFO L272 TraceCheckUtils]: 1: Hoare triple {34196#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {34250#(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:54:37,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {34250#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,389 INFO L272 TraceCheckUtils]: 3: Hoare triple {34196#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {34249#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:37,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {34196#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} is VALID [2022-02-20 21:54:37,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} is VALID [2022-02-20 21:54:37,390 INFO L272 TraceCheckUtils]: 7: Hoare triple {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {34196#true} is VALID [2022-02-20 21:54:37,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {34196#true} ~cond := #in~cond; {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:54:37,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,392 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} #829#return; {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} is VALID [2022-02-20 21:54:37,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} assume true; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,396 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} {34196#true} #815#return; {34290#(and (= |ldv_skb_alloc_#t~ret260#1.offset| 0) (<= |ldv_skb_alloc_#t~ret260#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#t~ret260#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {34290#(and (= |ldv_skb_alloc_#t~ret260#1.offset| 0) (<= |ldv_skb_alloc_#t~ret260#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#t~ret260#1.base|) 18446744073709551616)))))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !false; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} 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; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} assume true; {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,401 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} {34196#true} #899#return; {34272#(and (= |ldv_alloc_skb_12_#t~ret250.offset| 0) (<= 1 (+ |ldv_alloc_skb_12_#t~ret250.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#t~ret250.base|)) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {34272#(and (= |ldv_alloc_skb_12_#t~ret250.offset| 0) (<= 1 (+ |ldv_alloc_skb_12_#t~ret250.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#t~ret250.base|)) 18446744073709551616)))))} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} assume ~tmp~11.base != 0 || ~tmp~11.offset != 0; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,403 INFO L272 TraceCheckUtils]: 25: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} call #t~ret251.base, #t~ret251.offset := ldv_malloc(~size % 4294967296); {34303#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {34303#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {34196#true} is VALID [2022-02-20 21:54:37,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {34196#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:37,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:37,405 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {34196#true} {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} #901#return; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} call write~$Pointer$(#t~ret251.base, #t~ret251.offset, ~tmp~11.base, 224 + ~tmp~11.offset, 8);havoc #t~ret251.base, #t~ret251.offset;call #t~mem252.base, #t~mem252.offset := read~$Pointer$(~tmp~11.base, 224 + ~tmp~11.offset, 8);call write~$Pointer$(#t~mem252.base, #t~mem252.offset, ~tmp~11.base, 232 + ~tmp~11.offset, 8);havoc #t~mem252.base, #t~mem252.offset; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} is VALID [2022-02-20 21:54:37,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} assume true; {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} is VALID [2022-02-20 21:54:37,408 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} {34196#true} #869#return; {34247#(and (<= |ULTIMATE.start_rx_#t~ret123#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_rx_#t~ret123#1.base|) 18446744073709551616)))) (= |ULTIMATE.start_rx_#t~ret123#1.offset| 0))} is VALID [2022-02-20 21:54:37,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {34196#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(105, 2);call #Ultimate.allocInit(64, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(2, 5);call write~init~int(14, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(77, 6);call #Ultimate.allocInit(2, 7);call write~init~int(14, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);call #Ultimate.allocInit(50, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(44, 12);call #Ultimate.allocInit(2, 13);call write~init~int(12, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(2, 15);call write~init~int(14, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(67, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(72, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(2, 21);call write~init~int(12, 21, 0, 1);call write~init~int(0, 21, 1, 1);call #Ultimate.allocInit(88, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(85, 26);call #Ultimate.allocInit(2, 27);call write~init~int(14, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(54, 28);call #Ultimate.allocInit(2, 29);call write~init~int(12, 29, 0, 1);call write~init~int(0, 29, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := 0, 0;~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset := 30, 0;call #Ultimate.allocInit(49, 30);call write~init~int(97, ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, 1);call write~init~int(1500, ~#rfc1201_proto~0.base, 1 + ~#rfc1201_proto~0.offset, 4);call write~init~int(1, ~#rfc1201_proto~0.base, 5 + ~#rfc1201_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1201_proto~0.base, 9 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1201_proto~0.base, 17 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1201_proto~0.base, 25 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~continue_tx.base, #funAddr~continue_tx.offset, ~#rfc1201_proto~0.base, 33 + ~#rfc1201_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1201_proto~0.base, 41 + ~#rfc1201_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 31, 0;call #Ultimate.allocInit(120, 31);#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; {34196#true} is VALID [2022-02-20 21:54:37,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {34196#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet231#1, main_#t~ret232#1.base, main_#t~ret232#1.offset, main_#t~nondet233#1, main_#t~nondet234#1, main_#t~nondet235#1, main_#t~nondet236#1, main_#t~nondet237#1, main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset, main_#t~nondet239#1, main_#t~switch240#1, main_#t~nondet241#1, main_#t~switch242#1, main_#t~ret243#1, main_#t~ret244#1, main_#t~mem245#1, main_#t~ret246#1, main_#t~nondet247#1, main_#t~switch248#1, main_#t~ret249#1, main_~ldvarg7~0#1, main_~tmp~10#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~2#1, main_~ldvarg5~0#1, main_~tmp___2~2#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~10#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~2#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~2#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet231#1 && main_#t~nondet231#1 <= 2147483647;main_~tmp~10#1 := main_#t~nondet231#1;havoc main_#t~nondet231#1;main_~ldvarg7~0#1 := main_~tmp~10#1; {34196#true} is VALID [2022-02-20 21:54:37,409 INFO L272 TraceCheckUtils]: 2: Hoare triple {34196#true} call main_#t~ret232#1.base, main_#t~ret232#1.offset := ldv_zalloc(232); {34249#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:37,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {34196#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:37,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:37,410 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {34196#true} {34196#true} #831#return; {34196#true} is VALID [2022-02-20 21:54:37,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {34196#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret232#1.base, main_#t~ret232#1.offset;havoc main_#t~ret232#1.base, main_#t~ret232#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet233#1 && main_#t~nondet233#1 <= 2147483647;main_~tmp___1~2#1 := main_#t~nondet233#1;havoc main_#t~nondet233#1;main_~ldvarg0~0#1 := main_~tmp___1~2#1;assume -2147483648 <= main_#t~nondet234#1 && main_#t~nondet234#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet234#1;havoc main_#t~nondet234#1;main_~ldvarg5~0#1 := main_~tmp___2~2#1;assume -2147483648 <= main_#t~nondet235#1 && main_#t~nondet235#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet235#1;havoc main_#t~nondet235#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet236#1 && main_#t~nondet236#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet236#1;havoc main_#t~nondet236#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;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; {34196#true} is VALID [2022-02-20 21:54:37,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {34196#true} assume { :end_inline_ldv_set_init } true; {34196#true} is VALID [2022-02-20 21:54:37,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {34196#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr273#1;#Ultimate.C_memset_#t~loopctr273#1 := 0; {34196#true} is VALID [2022-02-20 21:54:37,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {34196#true} assume #Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr273#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr273#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr273#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr273#1 := 1 + #Ultimate.C_memset_#t~loopctr273#1; {34196#true} is VALID [2022-02-20 21:54:37,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {34196#true} assume !(#Ultimate.C_memset_#t~loopctr273#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {34196#true} is VALID [2022-02-20 21:54:37,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {34196#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res238#1.base, main_#t~memset~res238#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {34196#true} is VALID [2022-02-20 21:54:37,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {34196#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {34196#true} is VALID [2022-02-20 21:54:37,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {34196#true} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {34196#true} is VALID [2022-02-20 21:54:37,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {34196#true} assume main_#t~switch240#1; {34196#true} is VALID [2022-02-20 21:54:37,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {34196#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {34196#true} is VALID [2022-02-20 21:54:37,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {34196#true} assume !main_#t~switch248#1;main_#t~switch248#1 := main_#t~switch248#1 || 1 == main_~tmp___8~0#1; {34196#true} is VALID [2022-02-20 21:54:37,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {34196#true} assume main_#t~switch248#1; {34196#true} is VALID [2022-02-20 21:54:37,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {34196#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1201_init } true;havoc arcnet_rfc1201_init_#res#1;havoc arcnet_rfc1201_init_#t~nondet27#1, arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset;havoc arcnet_rfc1201_init_#t~nondet27#1;call write~$Pointer$(~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset, ~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1888 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset, ~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem28#1.base, arcnet_rfc1201_init_#t~mem28#1.offset;call arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 2000 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset, ~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem29#1.base, arcnet_rfc1201_init_#t~mem29#1.offset;call arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1712 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset, ~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem30#1.base, arcnet_rfc1201_init_#t~mem30#1.offset;call arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1704 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset, ~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem31#1.base, arcnet_rfc1201_init_#t~mem31#1.offset;call arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1568 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset, ~#arc_proto_map~0.base, 1696 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1201_init_#t~mem32#1.base, arcnet_rfc1201_init_#t~mem32#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {34196#true} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset; {34196#true} is VALID [2022-02-20 21:54:37,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {34196#true} arcnet_rfc1201_init_#res#1 := 0; {34196#true} is VALID [2022-02-20 21:54:37,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {34196#true} main_#t~ret249#1 := arcnet_rfc1201_init_#res#1;assume { :end_inline_arcnet_rfc1201_init } true;assume -2147483648 <= main_#t~ret249#1 && main_#t~ret249#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret249#1;havoc main_#t~ret249#1; {34196#true} is VALID [2022-02-20 21:54:37,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {34196#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset, ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset, ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,413 INFO L272 TraceCheckUtils]: 24: Hoare triple {34196#true} call ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset := ldv_zalloc(20); {34249#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:37,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {34196#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:37,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:37,414 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {34196#true} {34196#true} #889#return; {34196#true} is VALID [2022-02-20 21:54:37,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {34196#true} ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset := ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret229#1.base, ldv_initialize_ArcProto_1_#t~ret229#1.offset;~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~9#1.base, ldv_initialize_ArcProto_1_~tmp~9#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,415 INFO L272 TraceCheckUtils]: 30: Hoare triple {34196#true} call ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset := ldv_zalloc(3264); {34249#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:37,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {34196#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:37,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:37,416 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {34196#true} {34196#true} #891#return; {34196#true} is VALID [2022-02-20 21:54:37,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {34196#true} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret230#1.base, ldv_initialize_ArcProto_1_#t~ret230#1.offset;~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {34196#true} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {34196#true} is VALID [2022-02-20 21:54:37,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {34196#true} assume !(0 != ~ldv_retval_0~0); {34196#true} is VALID [2022-02-20 21:54:37,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {34196#true} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {34196#true} is VALID [2022-02-20 21:54:37,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {34196#true} assume main_#t~switch240#1; {34196#true} is VALID [2022-02-20 21:54:37,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {34196#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet241#1 && main_#t~nondet241#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet241#1;havoc main_#t~nondet241#1;main_#t~switch242#1 := 0 == main_~tmp___7~0#1; {34196#true} is VALID [2022-02-20 21:54:37,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {34196#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 1 == main_~tmp___7~0#1; {34196#true} is VALID [2022-02-20 21:54:37,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {34196#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 2 == main_~tmp___7~0#1; {34196#true} is VALID [2022-02-20 21:54:37,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {34196#true} assume !main_#t~switch242#1;main_#t~switch242#1 := main_#t~switch242#1 || 3 == main_~tmp___7~0#1; {34196#true} is VALID [2022-02-20 21:54:37,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {34196#true} assume main_#t~switch242#1; {34196#true} is VALID [2022-02-20 21:54:37,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {34196#true} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~rfc1201_proto_group1~0.base, ~rfc1201_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1201_proto_group0~0.base, ~rfc1201_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset, rx_#t~mem45#1, rx_#t~mem46#1, rx_#t~nondet47#1, rx_#t~mem54#1.base, rx_#t~mem54#1.offset, rx_#t~mem55#1, rx_#t~mem56#1.base, rx_#t~mem56#1.offset, rx_#t~nondet57#1, rx_#t~mem58#1, rx_#t~mem59#1, rx_#t~mem60#1, rx_#t~mem61#1, rx_#t~mem62#1.base, rx_#t~mem62#1.offset, rx_#t~mem63#1, rx_#t~mem64#1, rx_#t~mem65#1, rx_#t~ret66#1.base, rx_#t~ret66#1.offset, rx_#t~nondet67#1, rx_#t~mem68#1, rx_#t~ret69#1.base, rx_#t~ret69#1.offset, rx_#t~mem70#1.base, rx_#t~mem70#1.offset, rx_#t~memcpy~res71#1.base, rx_#t~memcpy~res71#1.offset, rx_#t~memcpy~res72#1.base, rx_#t~memcpy~res72#1.offset, rx_#t~mem79#1.base, rx_#t~mem79#1.offset, rx_#t~mem80#1, rx_#t~mem81#1, rx_#t~mem82#1, rx_#t~short83#1, rx_#t~mem84#1, rx_#t~nondet85#1, rx_#t~mem86#1, rx_#t~nondet87#1, rx_#t~mem88#1, rx_#t~mem89#1, rx_#t~mem90#1, rx_#t~mem91#1, rx_#t~ret92#1, rx_#t~ret93#1, rx_#t~mem94#1.base, rx_#t~mem94#1.offset, rx_#t~mem95#1, rx_#t~mem96#1, rx_#t~short97#1, rx_#t~nondet98#1, rx_#t~mem99#1, rx_#t~mem100#1, rx_#t~mem101#1, rx_#t~mem102#1.base, rx_#t~mem102#1.offset, rx_#t~mem103#1, rx_#t~mem104#1, rx_#t~mem105#1, rx_#t~mem106#1.base, rx_#t~mem106#1.offset, rx_#t~nondet107#1, rx_#t~mem108#1, rx_#t~mem109#1, rx_#t~mem110#1, rx_#t~mem111#1, rx_#t~mem112#1, rx_#t~mem113#1.base, rx_#t~mem113#1.offset, rx_#t~mem114#1, rx_#t~mem115#1, rx_#t~mem116#1, rx_#t~nondet117#1, rx_#t~mem118#1, rx_#t~mem119#1, rx_#t~mem120#1, rx_#t~mem121#1, rx_#t~mem122#1, rx_#t~ret123#1.base, rx_#t~ret123#1.offset, rx_#t~nondet124#1, rx_#t~mem125#1, rx_#t~mem126#1, rx_#t~mem127#1.base, rx_#t~mem127#1.offset, rx_#t~memcpy~res128#1.base, rx_#t~memcpy~res128#1.offset, rx_#t~memcpy~res129#1.base, rx_#t~memcpy~res129#1.offset, rx_#t~ret130#1.base, rx_#t~ret130#1.offset, rx_#t~mem131#1, rx_#t~mem132#1.base, rx_#t~mem132#1.offset, rx_#t~mem133#1, rx_#t~mem134#1, rx_#t~nondet135#1, rx_#t~mem136#1, rx_#t~mem137#1, rx_#t~mem138#1, rx_#t~mem139#1, rx_#t~mem140#1, rx_#t~mem141#1, rx_#t~mem142#1, rx_#t~mem143#1, rx_#t~nondet144#1, rx_#t~mem145#1, rx_#t~mem146#1, rx_#t~mem147#1, rx_#t~nondet148#1, rx_#t~mem149#1, rx_#t~mem150#1, rx_#t~mem151#1, rx_#t~mem152#1, rx_#t~mem153#1.base, rx_#t~mem153#1.offset, rx_#t~mem154#1, rx_#t~mem155#1, rx_#t~mem156#1.base, rx_#t~mem156#1.offset, rx_#t~mem157#1.base, rx_#t~mem157#1.offset, rx_#t~mem158#1.base, rx_#t~mem158#1.offset, rx_#t~mem165#1.base, rx_#t~mem165#1.offset, rx_#t~mem166#1, rx_#t~mem167#1.base, rx_#t~mem167#1.offset, rx_#t~ret168#1.base, rx_#t~ret168#1.offset, rx_#t~mem169#1, rx_#t~mem170#1, rx_#t~ret171#1, rx_#t~ret172#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~1#1.base, rx_~pkt~1#1.offset, rx_~soft~1#1.base, rx_~soft~1#1.offset, rx_~saddr~0#1, rx_~ofs~0#1, rx_~in~0#1.base, rx_~in~0#1.offset, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~0#1.offset, rx_~arp~0#1.base, rx_~arp~0#1.offset, rx_~cptr~0#1.base, rx_~cptr~0#1.offset, rx_~tmp___0~2#1, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset, rx_~packetnum~0#1, rx_~tmp___1~0#1, rx_~tmp___2~0#1;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~1#1.base, rx_~pkt~1#1.offset;havoc rx_~soft~1#1.base, rx_~soft~1#1.offset;havoc rx_~saddr~0#1;havoc rx_~ofs~0#1;havoc rx_~in~0#1.base, rx_~in~0#1.offset;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset;havoc rx_~arp~0#1.base, rx_~arp~0#1.offset;havoc rx_~cptr~0#1.base, rx_~cptr~0#1.offset;havoc rx_~tmp___0~2#1;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;havoc rx_~packetnum~0#1;havoc rx_~tmp___1~0#1;havoc rx_~tmp___2~0#1; {34196#true} is VALID [2022-02-20 21:54:37,418 INFO L272 TraceCheckUtils]: 46: Hoare triple {34196#true} call rx_#t~ret44#1.base, rx_#t~ret44#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {34196#true} is VALID [2022-02-20 21:54:37,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {34196#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {34196#true} is VALID [2022-02-20 21:54:37,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:37,418 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {34196#true} {34196#true} #845#return; {34196#true} is VALID [2022-02-20 21:54:37,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {34196#true} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret44#1.base, rx_#t~ret44#1.offset;havoc rx_#t~ret44#1.base, rx_#t~ret44#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset;rx_~soft~1#1.base, rx_~soft~1#1.offset := rx_~pkthdr#1.base, 4 + rx_~pkthdr#1.offset;call rx_#t~mem45#1 := read~int(rx_~pkt~1#1.base, rx_~pkt~1#1.offset, 1);rx_~saddr~0#1 := rx_#t~mem45#1 % 256;havoc rx_#t~mem45#1;rx_~in~0#1.base, rx_~in~0#1.offset := rx_~lp~0#1.base, 440 + rx_~lp~0#1.offset + 12 * (if rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 else rx_~saddr~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); {34196#true} is VALID [2022-02-20 21:54:37,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {34196#true} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {34196#true} is VALID [2022-02-20 21:54:37,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {34196#true} call rx_#t~mem46#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {34196#true} is VALID [2022-02-20 21:54:37,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {34196#true} assume !(255 == rx_#t~mem46#1 % 256 % 4294967296);havoc rx_#t~mem46#1; {34196#true} is VALID [2022-02-20 21:54:37,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {34196#true} call rx_#t~mem55#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {34196#true} is VALID [2022-02-20 21:54:37,419 INFO L290 TraceCheckUtils]: 55: Hoare triple {34196#true} assume !(0 == rx_#t~mem55#1 % 256 % 4294967296);havoc rx_#t~mem55#1;call rx_#t~mem94#1.base, rx_#t~mem94#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8);rx_#t~short97#1 := 0 != (rx_#t~mem94#1.base + rx_#t~mem94#1.offset) % 18446744073709551616; {34196#true} is VALID [2022-02-20 21:54:37,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {34196#true} assume !rx_#t~short97#1; {34196#true} is VALID [2022-02-20 21:54:37,419 INFO L290 TraceCheckUtils]: 57: Hoare triple {34196#true} assume !rx_#t~short97#1;havoc rx_#t~mem94#1.base, rx_#t~mem94#1.offset;havoc rx_#t~mem95#1;havoc rx_#t~mem96#1;havoc rx_#t~short97#1; {34196#true} is VALID [2022-02-20 21:54:37,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {34196#true} call rx_#t~mem105#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1); {34196#true} is VALID [2022-02-20 21:54:37,419 INFO L290 TraceCheckUtils]: 59: Hoare triple {34196#true} assume 0 != rx_#t~mem105#1 % 256;havoc rx_#t~mem105#1;call rx_#t~mem106#1.base, rx_#t~mem106#1.offset := read~$Pointer$(rx_~in~0#1.base, rx_~in~0#1.offset, 8); {34196#true} is VALID [2022-02-20 21:54:37,420 INFO L290 TraceCheckUtils]: 60: Hoare triple {34196#true} assume !(0 != (rx_#t~mem106#1.base + rx_#t~mem106#1.offset) % 18446744073709551616);havoc rx_#t~mem106#1.base, rx_#t~mem106#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,420 INFO L290 TraceCheckUtils]: 61: Hoare triple {34196#true} call rx_#t~mem114#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem114#1, rx_~in~0#1.base, 8 + rx_~in~0#1.offset, 2);havoc rx_#t~mem114#1;call rx_#t~mem115#1 := read~int(rx_~soft~1#1.base, 1 + rx_~soft~1#1.offset, 1);call write~int(2 + rx_#t~mem115#1 % 256 / 2 % 256, rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1);havoc rx_#t~mem115#1;call write~int(1, rx_~in~0#1.base, 10 + rx_~in~0#1.offset, 1);call rx_#t~mem116#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {34196#true} is VALID [2022-02-20 21:54:37,420 INFO L290 TraceCheckUtils]: 62: Hoare triple {34196#true} assume !(rx_#t~mem116#1 % 256 % 4294967296 > 16);havoc rx_#t~mem116#1;call rx_#t~mem122#1 := read~int(rx_~in~0#1.base, 11 + rx_~in~0#1.offset, 1); {34196#true} is VALID [2022-02-20 21:54:37,421 INFO L272 TraceCheckUtils]: 63: Hoare triple {34196#true} call rx_#t~ret123#1.base, rx_#t~ret123#1.offset := ldv_alloc_skb_12(4 + 508 * (rx_#t~mem122#1 % 256), 32); {34250#(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:54:37,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {34250#(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))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~11.base, ~tmp~11.offset; {34196#true} is VALID [2022-02-20 21:54:37,422 INFO L272 TraceCheckUtils]: 65: Hoare triple {34196#true} call #t~ret250.base, #t~ret250.offset := ldv_skb_alloc(); {34250#(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:54:37,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {34250#(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~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {34196#true} is VALID [2022-02-20 21:54:37,423 INFO L272 TraceCheckUtils]: 67: Hoare triple {34196#true} call #t~ret260#1.base, #t~ret260#1.offset := ldv_zalloc(248); {34249#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {34249#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet20#1 && #t~nondet20#1 <= 2147483647;~tmp___0~1#1 := #t~nondet20#1;havoc #t~nondet20#1; {34196#true} is VALID [2022-02-20 21:54:37,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {34196#true} assume !(0 != ~tmp___0~1#1);call #t~malloc21#1.base, #t~malloc21#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc21#1.base, #t~malloc21#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} is VALID [2022-02-20 21:54:37,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {34293#(= |ldv_zalloc_#t~malloc21#1.offset| 0)} assume { :end_inline_#Ultimate.meminit } true;~tmp~1#1.base, ~tmp~1#1.offset := #t~malloc21#1.base, #t~malloc21#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~1#1.base, ~tmp~1#1.offset; {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} is VALID [2022-02-20 21:54:37,424 INFO L272 TraceCheckUtils]: 71: Hoare triple {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {34196#true} is VALID [2022-02-20 21:54:37,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {34196#true} ~cond := #in~cond; {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:54:37,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {34301#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {34302#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 21:54:37,427 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {34302#(not (= |assume_abort_if_not_#in~cond| 0))} {34294#(= |ldv_zalloc_~p~1#1.offset| 0)} #829#return; {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} is VALID [2022-02-20 21:54:37,428 INFO L290 TraceCheckUtils]: 76: Hoare triple {34299#(and (= |ldv_zalloc_~p~1#1.offset| 0) (< (* 18446744073709551616 (div (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|) 18446744073709551616)) (+ |ldv_zalloc_~p~1#1.base| |ldv_zalloc_~p~1#1.offset|)))} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} assume true; {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,430 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {34300#(and (<= 1 (+ |ldv_zalloc_#res#1.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_zalloc_#res#1.base|)) 18446744073709551616)))) (= |ldv_zalloc_#res#1.offset| 0))} {34196#true} #815#return; {34290#(and (= |ldv_skb_alloc_#t~ret260#1.offset| 0) (<= |ldv_skb_alloc_#t~ret260#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#t~ret260#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {34290#(and (= |ldv_skb_alloc_#t~ret260#1.offset| 0) (<= |ldv_skb_alloc_#t~ret260#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#t~ret260#1.base|) 18446744073709551616)))))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret260#1.base, #t~ret260#1.offset;havoc #t~ret260#1.base, #t~ret260#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,432 INFO L290 TraceCheckUtils]: 80: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !(~skb~1#1.base == 0 && ~skb~1#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~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem255#1.base, ldv_set_add_#t~mem255#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~0#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~0#1;ldv_set_add_~i~0#1 := 0; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !false; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,434 INFO L290 TraceCheckUtils]: 83: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} 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; {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,435 INFO L290 TraceCheckUtils]: 84: Hoare triple {34291#(and (= |ldv_skb_alloc_~skb~1#1.offset| 0) (<= |ldv_skb_alloc_~skb~1#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_~skb~1#1.base|) 18446744073709551616)))))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,435 INFO L290 TraceCheckUtils]: 85: Hoare triple {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} assume true; {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} is VALID [2022-02-20 21:54:37,437 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {34292#(and (<= |ldv_skb_alloc_#res#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ldv_skb_alloc_#res#1.base|) 18446744073709551616)))) (= |ldv_skb_alloc_#res#1.offset| 0))} {34196#true} #899#return; {34272#(and (= |ldv_alloc_skb_12_#t~ret250.offset| 0) (<= 1 (+ |ldv_alloc_skb_12_#t~ret250.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#t~ret250.base|)) 18446744073709551616)))))} is VALID [2022-02-20 21:54:37,437 INFO L290 TraceCheckUtils]: 87: Hoare triple {34272#(and (= |ldv_alloc_skb_12_#t~ret250.offset| 0) (<= 1 (+ |ldv_alloc_skb_12_#t~ret250.base| (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#t~ret250.base|)) 18446744073709551616)))))} ~tmp~11.base, ~tmp~11.offset := #t~ret250.base, #t~ret250.offset;havoc #t~ret250.base, #t~ret250.offset; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} assume ~tmp~11.base != 0 || ~tmp~11.offset != 0; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,439 INFO L272 TraceCheckUtils]: 89: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} call #t~ret251.base, #t~ret251.offset := ldv_malloc(~size % 4294967296); {34303#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:37,439 INFO L290 TraceCheckUtils]: 90: Hoare triple {34303#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~tmp___0~0 := #t~nondet18;havoc #t~nondet18; {34196#true} is VALID [2022-02-20 21:54:37,439 INFO L290 TraceCheckUtils]: 91: Hoare triple {34196#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {34196#true} is VALID [2022-02-20 21:54:37,439 INFO L290 TraceCheckUtils]: 92: Hoare triple {34196#true} assume true; {34196#true} is VALID [2022-02-20 21:54:37,440 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {34196#true} {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} #901#return; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,441 INFO L290 TraceCheckUtils]: 94: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} call write~$Pointer$(#t~ret251.base, #t~ret251.offset, ~tmp~11.base, 224 + ~tmp~11.offset, 8);havoc #t~ret251.base, #t~ret251.offset;call #t~mem252.base, #t~mem252.offset := read~$Pointer$(~tmp~11.base, 224 + ~tmp~11.offset, 8);call write~$Pointer$(#t~mem252.base, #t~mem252.offset, ~tmp~11.base, 232 + ~tmp~11.offset, 8);havoc #t~mem252.base, #t~mem252.offset; {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} is VALID [2022-02-20 21:54:37,442 INFO L290 TraceCheckUtils]: 95: Hoare triple {34273#(and (<= 1 (+ (* (div (+ 18446744073709551615 (* (- 1) ldv_alloc_skb_12_~tmp~11.base)) 18446744073709551616) 18446744073709551616) ldv_alloc_skb_12_~tmp~11.base)) (= ldv_alloc_skb_12_~tmp~11.offset 0))} #res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} is VALID [2022-02-20 21:54:37,443 INFO L290 TraceCheckUtils]: 96: Hoare triple {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} assume true; {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} is VALID [2022-02-20 21:54:37,444 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {34278#(and (<= 1 (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ldv_alloc_skb_12_#res.base|)) 18446744073709551616)) |ldv_alloc_skb_12_#res.base|)) (= |ldv_alloc_skb_12_#res.offset| 0))} {34196#true} #869#return; {34247#(and (<= |ULTIMATE.start_rx_#t~ret123#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_rx_#t~ret123#1.base|) 18446744073709551616)))) (= |ULTIMATE.start_rx_#t~ret123#1.offset| 0))} is VALID [2022-02-20 21:54:37,446 INFO L290 TraceCheckUtils]: 98: Hoare triple {34247#(and (<= |ULTIMATE.start_rx_#t~ret123#1.base| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_rx_#t~ret123#1.base|) 18446744073709551616)))) (= |ULTIMATE.start_rx_#t~ret123#1.offset| 0))} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret123#1.base, rx_#t~ret123#1.offset;havoc rx_#t~mem122#1;havoc rx_#t~ret123#1.base, rx_#t~ret123#1.offset;call write~$Pointer$(rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~in~0#1.base, rx_~in~0#1.offset, 8); {34248#(and (<= (+ (* 18446744073709551616 (div (+ |ULTIMATE.start_rx_~skb~0#1.base| |ULTIMATE.start_rx_~skb~0#1.offset|) 18446744073709551616)) 1) |ULTIMATE.start_rx_~skb~0#1.base|) (= 0 |ULTIMATE.start_rx_~skb~0#1.offset|))} is VALID [2022-02-20 21:54:37,446 INFO L290 TraceCheckUtils]: 99: Hoare triple {34248#(and (<= (+ (* 18446744073709551616 (div (+ |ULTIMATE.start_rx_~skb~0#1.base| |ULTIMATE.start_rx_~skb~0#1.offset|) 18446744073709551616)) 1) |ULTIMATE.start_rx_~skb~0#1.base|) (= 0 |ULTIMATE.start_rx_~skb~0#1.offset|))} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {34197#false} is VALID [2022-02-20 21:54:37,447 INFO L290 TraceCheckUtils]: 100: Hoare triple {34197#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet124#1; {34197#false} is VALID [2022-02-20 21:54:37,447 INFO L290 TraceCheckUtils]: 101: Hoare triple {34197#false} call rx_#t~mem125#1 := read~int(rx_~soft~1#1.base, 2 + rx_~soft~1#1.offset, 2);call write~int(rx_#t~mem125#1, rx_~lp~0#1.base, 438 + rx_~lp~0#1.offset, 2);havoc rx_#t~mem125#1;call rx_#t~mem126#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem126#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem126#1; {34197#false} is VALID [2022-02-20 21:54:37,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {34197#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {34197#false} is VALID [2022-02-20 21:54:37,447 INFO L290 TraceCheckUtils]: 103: Hoare triple {34197#false} assume -2147483648 <= main_#t~nondet239#1 && main_#t~nondet239#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet239#1;havoc main_#t~nondet239#1;main_#t~switch240#1 := 0 == main_~tmp___6~0#1; {34197#false} is VALID [2022-02-20 21:54:37,447 INFO L290 TraceCheckUtils]: 104: Hoare triple {34197#false} assume !main_#t~switch240#1;main_#t~switch240#1 := main_#t~switch240#1 || 1 == main_~tmp___6~0#1; {34197#false} is VALID [2022-02-20 21:54:37,447 INFO L290 TraceCheckUtils]: 105: Hoare triple {34197#false} assume main_#t~switch240#1; {34197#false} is VALID [2022-02-20 21:54:37,447 INFO L290 TraceCheckUtils]: 106: Hoare triple {34197#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet247#1 && main_#t~nondet247#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet247#1;havoc main_#t~nondet247#1;main_#t~switch248#1 := 0 == main_~tmp___8~0#1; {34197#false} is VALID [2022-02-20 21:54:37,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {34197#false} assume main_#t~switch248#1; {34197#false} is VALID [2022-02-20 21:54:37,448 INFO L290 TraceCheckUtils]: 108: Hoare triple {34197#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1201_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1201_proto~0.base, ~#rfc1201_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {34197#false} is VALID [2022-02-20 21:54:37,448 INFO L290 TraceCheckUtils]: 109: Hoare triple {34197#false} assume { :end_inline_arcnet_unregister_proto } true; {34197#false} is VALID [2022-02-20 21:54:37,448 INFO L290 TraceCheckUtils]: 110: Hoare triple {34197#false} assume { :end_inline_arcnet_rfc1201_exit } true;~ldv_state_variable_0~0 := 2; {34197#false} is VALID [2022-02-20 21:54:37,448 INFO L290 TraceCheckUtils]: 111: Hoare triple {34197#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret264#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {34197#false} is VALID [2022-02-20 21:54:37,448 INFO L290 TraceCheckUtils]: 112: Hoare triple {34197#false} ldv_check_final_state_#t~ret264#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret264#1 && ldv_check_final_state_#t~ret264#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret264#1;havoc ldv_check_final_state_#t~ret264#1; {34197#false} is VALID [2022-02-20 21:54:37,448 INFO L290 TraceCheckUtils]: 113: Hoare triple {34197#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {34197#false} is VALID [2022-02-20 21:54:37,449 INFO L272 TraceCheckUtils]: 114: Hoare triple {34197#false} call ldv_error(); {34197#false} is VALID [2022-02-20 21:54:37,449 INFO L290 TraceCheckUtils]: 115: Hoare triple {34197#false} assume !false; {34197#false} is VALID [2022-02-20 21:54:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 21:54:37,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:37,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740112720] [2022-02-20 21:54:37,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740112720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:37,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:37,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 21:54:37,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092671051] [2022-02-20 21:54:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 116 [2022-02-20 21:54:37,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:37,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:54:37,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:37,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 21:54:37,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 21:54:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-02-20 21:54:37,576 INFO L87 Difference]: Start difference. First operand 655 states and 923 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9)