./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--wan--hdlc_ppp.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--wan--hdlc_ppp.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 790ee47547867d006f1299e2cf5c9d6d26b057091574ae3950813e98f75c3c5e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:55:41,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:55:41,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:55:41,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:55:41,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:55:41,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:55:41,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:55:41,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:55:41,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:55:41,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:55:41,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:55:41,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:55:41,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:55:41,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:55:41,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:55:41,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:55:41,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:55:41,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:55:41,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:55:41,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:55:41,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:55:41,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:55:41,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:55:41,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:55:41,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:55:41,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:55:41,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:55:41,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:55:41,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:55:41,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:55:41,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:55:41,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:55:41,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:55:41,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:55:41,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:55:41,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:55:41,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:55:41,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:55:41,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:55:41,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:55:41,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:55:41,152 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:55:41,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:55:41,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:55:41,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:55:41,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:55:41,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:55:41,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:55:41,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:55:41,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:55:41,184 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:55:41,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:55:41,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:55:41,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:55:41,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:55:41,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:55:41,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:55:41,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:55:41,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:55:41,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:55:41,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:55:41,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:55:41,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:55:41,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:41,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:55:41,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:55:41,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:55:41,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:55:41,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:55:41,189 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:55:41,189 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:55:41,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:55:41,190 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 -> 790ee47547867d006f1299e2cf5c9d6d26b057091574ae3950813e98f75c3c5e [2022-02-20 21:55:41,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:55:41,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:55:41,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:55:41,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:55:41,465 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:55:41,467 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--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-02-20 21:55:41,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4e9682/14b98eed23ea4f788d13046138b87fb4/FLAG37c3052b5 [2022-02-20 21:55:42,152 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:55:42,153 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--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-02-20 21:55:42,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4e9682/14b98eed23ea4f788d13046138b87fb4/FLAG37c3052b5 [2022-02-20 21:55:42,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4e9682/14b98eed23ea4f788d13046138b87fb4 [2022-02-20 21:55:42,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:55:42,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:55:42,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:42,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:55:42,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:55:42,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:55:42" (1/1) ... [2022-02-20 21:55:42,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6077accd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:42, skipping insertion in model container [2022-02-20 21:55:42,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:55:42" (1/1) ... [2022-02-20 21:55:42,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:55:42,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:55:43,196 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--wan--hdlc_ppp.ko-entry_point.cil.out.i[152029,152042] [2022-02-20 21:55:43,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:43,433 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:55:43,554 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--wan--hdlc_ppp.ko-entry_point.cil.out.i[152029,152042] [2022-02-20 21:55:43,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:43,735 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:55:43,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43 WrapperNode [2022-02-20 21:55:43,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:43,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:43,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:55:43,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:55:43,744 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:55:43" (1/1) ... [2022-02-20 21:55:43,798 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:55:43" (1/1) ... [2022-02-20 21:55:43,901 INFO L137 Inliner]: procedures = 134, calls = 555, calls flagged for inlining = 53, calls inlined = 50, statements flattened = 1647 [2022-02-20 21:55:43,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:43,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:55:43,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:55:43,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:55:43,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:43,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:43,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:43,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:44,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:44,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:44,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:44,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:55:44,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:55:44,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:55:44,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:55:44,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (1/1) ... [2022-02-20 21:55:44,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:55:44,095 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:55:44,097 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:55:44,126 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_hard_header [2022-02-20 21:55:44,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_hard_header [2022-02-20 21:55:44,127 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 21:55:44,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 21:55:44,127 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_rx [2022-02-20 21:55:44,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_rx [2022-02-20 21:55:44,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:55:44,128 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_type_trans [2022-02-20 21:55:44,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_type_trans [2022-02-20 21:55:44,128 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-02-20 21:55:44,129 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-02-20 21:55:44,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:55:44,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:55:44,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:55:44,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:55:44,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:55:44,132 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-02-20 21:55:44,133 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-02-20 21:55:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:55:44,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:55:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_3 [2022-02-20 21:55:44,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_3 [2022-02-20 21:55:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:55:44,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:55:44,134 INFO L130 BoogieDeclarations]: Found specification of procedure netif_dormant_on [2022-02-20 21:55:44,134 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_dormant_on [2022-02-20 21:55:44,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:55:44,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:55:44,134 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:55:44,134 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:55:44,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:55:44,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:55:44,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:55:44,135 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_tx_flush [2022-02-20 21:55:44,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_tx_flush [2022-02-20 21:55:44,135 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-02-20 21:55:44,136 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-02-20 21:55:44,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:55:44,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:55:44,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:55:44,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:55:44,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:55:44,137 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 21:55:44,137 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 21:55:44,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:55:44,137 INFO L130 BoogieDeclarations]: Found specification of procedure get_ppp [2022-02-20 21:55:44,137 INFO L138 BoogieDeclarations]: Found implementation of procedure get_ppp [2022-02-20 21:55:44,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:55:44,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:55:44,138 INFO L130 BoogieDeclarations]: Found specification of procedure get_proto [2022-02-20 21:55:44,138 INFO L138 BoogieDeclarations]: Found implementation of procedure get_proto [2022-02-20 21:55:44,138 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 21:55:44,138 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-02-20 21:55:44,138 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-02-20 21:55:44,139 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_tx_cp [2022-02-20 21:55:44,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_tx_cp [2022-02-20 21:55:44,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:55:44,140 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 21:55:44,140 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 21:55:44,141 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 21:55:44,142 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 21:55:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:55:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:55:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_cp_event [2022-02-20 21:55:44,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_cp_event [2022-02-20 21:55:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:55:44,143 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:55:44,143 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-02-20 21:55:44,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-02-20 21:55:44,143 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 21:55:44,143 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 21:55:44,143 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_ioctl [2022-02-20 21:55:44,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_ioctl [2022-02-20 21:55:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure proto_name [2022-02-20 21:55:44,144 INFO L138 BoogieDeclarations]: Found implementation of procedure proto_name [2022-02-20 21:55:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:55:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-02-20 21:55:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-02-20 21:55:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:55:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:55:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:55:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:55:44,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:55:44,460 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:55:44,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:55:44,998 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:55:45,848 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:55:45,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:55:45,871 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 21:55:45,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:45 BoogieIcfgContainer [2022-02-20 21:55:45,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:55:45,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:55:45,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:55:45,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:55:45,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:55:42" (1/3) ... [2022-02-20 21:55:45,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6d51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:45, skipping insertion in model container [2022-02-20 21:55:45,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:43" (2/3) ... [2022-02-20 21:55:45,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6d51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:45, skipping insertion in model container [2022-02-20 21:55:45,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:45" (3/3) ... [2022-02-20 21:55:45,882 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-02-20 21:55:45,887 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:55:45,887 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:55:45,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:55:45,955 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:55:45,956 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:55:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 433 states have (on average 1.4133949191685913) internal successors, (612), 454 states have internal predecessors, (612), 126 states have call successors, (126), 33 states have call predecessors, (126), 32 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2022-02-20 21:55:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 21:55:46,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:46,010 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:46,010 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash 461964592, now seen corresponding path program 1 times [2022-02-20 21:55:46,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:46,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605869227] [2022-02-20 21:55:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:46,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #1583#return; {596#true} is VALID [2022-02-20 21:55:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:46,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #1585#return; {596#true} is VALID [2022-02-20 21:55:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:46,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #1587#return; {596#true} is VALID [2022-02-20 21:55:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:55:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:46,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #1589#return; {596#true} is VALID [2022-02-20 21:55:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:55:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:46,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #1591#return; {596#true} is VALID [2022-02-20 21:55:46,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#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(103, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(4, 4);call write~init~int(76, 4, 0, 1);call write~init~int(67, 4, 1, 1);call write~init~int(80, 4, 2, 1);call write~init~int(0, 4, 3, 1);call #Ultimate.allocInit(5, 5);call write~init~int(73, 5, 0, 1);call write~init~int(80, 5, 1, 1);call write~init~int(67, 5, 2, 1);call write~init~int(80, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(7, 6);call write~init~int(73, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(86, 6, 2, 1);call write~init~int(54, 6, 3, 1);call write~init~int(67, 6, 4, 1);call write~init~int(80, 6, 5, 1);call write~init~int(0, 6, 6, 1);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(7, 8);call write~init~int(37, 8, 0, 1);call write~init~int(115, 8, 1, 1);call write~init~int(32, 8, 2, 1);call write~init~int(117, 8, 3, 1);call write~init~int(112, 8, 4, 1);call write~init~int(10, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(21, 11);~LDV_IN_INTERRUPT~0 := 1;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#tx_queue~0.base, ~#tx_queue~0.offset := 12, 0;call #Ultimate.allocInit(88, 12);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 8 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 16 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 20 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 24 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 28 + ~#tx_queue~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 32 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 40 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 48 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 56 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 64 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 72 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 76 + ~#tx_queue~0.offset, 8);~#cp_table~0.base, ~#cp_table~0.offset := 13, 0;call #Ultimate.allocInit(364, 13);call write~init~int(163, ~#cp_table~0.base, ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 4 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 8 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 12 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 16 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 20 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 24 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 28 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 32 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 36 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 40 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 44 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 48 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 52 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 56 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 60 + ~#cp_table~0.offset, 4);call write~init~int(1026, ~#cp_table~0.base, 64 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 68 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 72 + ~#cp_table~0.offset, 4);call write~init~int(133, ~#cp_table~0.base, 76 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 80 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 84 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 88 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 92 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 96 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 100 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 104 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 108 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 112 + ~#cp_table~0.offset, 4);call write~init~int(421, ~#cp_table~0.base, 116 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 120 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 124 + ~#cp_table~0.offset, 4);call write~init~int(262, ~#cp_table~0.base, 128 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 132 + ~#cp_table~0.offset, 4);call write~init~int(389, ~#cp_table~0.base, 136 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 140 + ~#cp_table~0.offset, 4);call write~init~int(675, ~#cp_table~0.base, 144 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 148 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 152 + ~#cp_table~0.offset, 4);call write~init~int(516, ~#cp_table~0.base, 156 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 160 + ~#cp_table~0.offset, 4);call write~init~int(643, ~#cp_table~0.base, 164 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 168 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 172 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 176 + ~#cp_table~0.offset, 4);call write~init~int(36, ~#cp_table~0.base, 180 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 184 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 188 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 192 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 196 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 200 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 204 + ~#cp_table~0.offset, 4);call write~init~int(163, ~#cp_table~0.base, 208 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 212 + ~#cp_table~0.offset, 4);call write~init~int(165, ~#cp_table~0.base, 216 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 220 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 224 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 228 + ~#cp_table~0.offset, 4);call write~init~int(2050, ~#cp_table~0.base, 232 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 236 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 240 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 244 + ~#cp_table~0.offset, 4);call write~init~int(2114, ~#cp_table~0.base, 248 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 252 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 256 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 260 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 264 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 268 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 272 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 276 + ~#cp_table~0.offset, 4);call write~init~int(4096, ~#cp_table~0.base, 280 + ~#cp_table~0.offset, 4);call write~init~int(4097, ~#cp_table~0.base, 284 + ~#cp_table~0.offset, 4);call write~init~int(4098, ~#cp_table~0.base, 288 + ~#cp_table~0.offset, 4);call write~init~int(4099, ~#cp_table~0.base, 292 + ~#cp_table~0.offset, 4);call write~init~int(4100, ~#cp_table~0.base, 296 + ~#cp_table~0.offset, 4);call write~init~int(4101, ~#cp_table~0.base, 300 + ~#cp_table~0.offset, 4);call write~init~int(4102, ~#cp_table~0.base, 304 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 308 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 312 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 316 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 320 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 324 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 328 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 332 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 336 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 340 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 344 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 348 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 352 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 356 + ~#cp_table~0.offset, 4);call write~init~int(1058, ~#cp_table~0.base, 360 + ~#cp_table~0.offset, 4);~#proto~0.base, ~#proto~0.offset := 14, 0;call #Ultimate.allocInit(88, 14);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_close.base, #funAddr~ppp_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_start.base, #funAddr~ppp_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_stop.base, #funAddr~ppp_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_ioctl.base, #funAddr~ppp_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_type_trans.base, #funAddr~ppp_type_trans.offset, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_rx.base, #funAddr~ppp_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset := 15, 0;call #Ultimate.allocInit(40, 15);call write~init~$Pointer$(#funAddr~ppp_hard_header.base, #funAddr~ppp_hard_header.offset, ~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 8 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 16 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 24 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 32 + ~#ppp_header_ops~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {596#true} is VALID [2022-02-20 21:55:46,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset, main_#t~nondet237#1, main_#t~nondet238#1, main_#t~ret239#1.base, main_#t~ret239#1.offset, main_#t~ret240#1.base, main_#t~ret240#1.offset, main_#t~ret241#1.base, main_#t~ret241#1.offset, main_#t~ret242#1.base, main_#t~ret242#1.offset, main_#t~nondet243#1, main_#t~switch244#1, main_#t~nondet245#1, main_#t~switch246#1, main_#t~ret247#1, main_#t~nondet248#1, main_#t~switch249#1, main_#t~ret250#1, main_#t~ret251#1, main_#t~ret252#1, main_#t~ret253#1, main_#t~ret254#1, main_#t~ret255#1, main_#t~ret256#1, main_#t~ret257#1, main_#t~ret258#1, main_#t~ret259#1, main_#t~ret260#1, main_#t~ret261#1, main_#t~ret262#1, main_#t~ret263#1, main_#t~ret264#1, main_#t~ret265#1, main_#t~ret266#1, main_#t~ret267#1, main_#t~ret268#1, main_#t~ret269#1, main_#t~ret270#1, main_#t~nondet271#1, main_#t~switch272#1, main_#t~ret273#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~19#1.base, main_~tmp~19#1.offset, main_~ldvarg1~0#1, main_~tmp___0~9#1, main_~ldvarg4~0#1, main_~tmp___1~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~tmp___6~1#1, main_~tmp___7~1#1, main_~tmp___8~0#1, main_~tmp___9~0#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~19#1.base, main_~tmp~19#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___0~9#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___1~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~tmp___6~1#1;havoc main_~tmp___7~1#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {596#true} is VALID [2022-02-20 21:55:46,472 INFO L272 TraceCheckUtils]: 2: Hoare triple {596#true} call main_#t~ret236#1.base, main_#t~ret236#1.offset := ldv_zalloc(40); {619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:46,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,473 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {596#true} {596#true} #1583#return; {596#true} is VALID [2022-02-20 21:55:46,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} main_~tmp~19#1.base, main_~tmp~19#1.offset := main_#t~ret236#1.base, main_#t~ret236#1.offset;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~19#1.base, main_~tmp~19#1.offset;main_~tmp___0~9#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg1~0#1 := main_~tmp___0~9#1;main_~tmp___1~3#1 := main_#t~nondet238#1;havoc main_#t~nondet238#1;main_~ldvarg4~0#1 := main_~tmp___1~3#1; {596#true} is VALID [2022-02-20 21:55:46,474 INFO L272 TraceCheckUtils]: 8: Hoare triple {596#true} call main_#t~ret239#1.base, main_#t~ret239#1.offset := ldv_zalloc(232); {619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:46,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,497 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {596#true} {596#true} #1585#return; {596#true} is VALID [2022-02-20 21:55:46,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret239#1.base, main_#t~ret239#1.offset;havoc main_#t~ret239#1.base, main_#t~ret239#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset; {596#true} is VALID [2022-02-20 21:55:46,500 INFO L272 TraceCheckUtils]: 14: Hoare triple {596#true} call main_#t~ret240#1.base, main_#t~ret240#1.offset := ldv_zalloc(3264); {619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:46,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,501 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {596#true} {596#true} #1587#return; {596#true} is VALID [2022-02-20 21:55:46,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret240#1.base, main_#t~ret240#1.offset;havoc main_#t~ret240#1.base, main_#t~ret240#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {596#true} is VALID [2022-02-20 21:55:46,502 INFO L272 TraceCheckUtils]: 20: Hoare triple {596#true} call main_#t~ret241#1.base, main_#t~ret241#1.offset := ldv_zalloc(1); {619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:46,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,503 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {596#true} {596#true} #1589#return; {596#true} is VALID [2022-02-20 21:55:46,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#true} main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset := main_#t~ret241#1.base, main_#t~ret241#1.offset;havoc main_#t~ret241#1.base, main_#t~ret241#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset; {596#true} is VALID [2022-02-20 21:55:46,504 INFO L272 TraceCheckUtils]: 26: Hoare triple {596#true} call main_#t~ret242#1.base, main_#t~ret242#1.offset := ldv_zalloc(1); {619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:46,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {619#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {596#true} is VALID [2022-02-20 21:55:46,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {596#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {596#true} is VALID [2022-02-20 21:55:46,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {596#true} assume true; {596#true} is VALID [2022-02-20 21:55:46,504 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {596#true} {596#true} #1591#return; {596#true} is VALID [2022-02-20 21:55:46,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {596#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret242#1.base, main_#t~ret242#1.offset;havoc main_#t~ret242#1.base, main_#t~ret242#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {596#true} is VALID [2022-02-20 21:55:46,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {596#true} assume { :end_inline_ldv_set_init } true; {596#true} is VALID [2022-02-20 21:55:46,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {596#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {618#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:46,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {618#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {618#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:46,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {618#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {618#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:46,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {618#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch244#1; {618#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:46,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {618#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {618#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:46,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {618#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch246#1; {618#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:46,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {618#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_mod_exit } true;assume { :begin_inline_unregister_hdlc_protocol } true;unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset;unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset := unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset; {597#false} is VALID [2022-02-20 21:55:46,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {597#false} assume { :end_inline_unregister_hdlc_protocol } true; {597#false} is VALID [2022-02-20 21:55:46,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {597#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {597#false} is VALID [2022-02-20 21:55:46,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {597#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret288#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {597#false} is VALID [2022-02-20 21:55:46,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {597#false} ldv_check_final_state_#t~ret288#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret288#1 && ldv_check_final_state_#t~ret288#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret288#1;havoc ldv_check_final_state_#t~ret288#1; {597#false} is VALID [2022-02-20 21:55:46,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {597#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {597#false} is VALID [2022-02-20 21:55:46,511 INFO L272 TraceCheckUtils]: 45: Hoare triple {597#false} call ldv_error(); {597#false} is VALID [2022-02-20 21:55:46,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-02-20 21:55:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:55:46,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:46,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605869227] [2022-02-20 21:55:46,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605869227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:46,514 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:46,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:55:46,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161585812] [2022-02-20 21:55:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:46,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-02-20 21:55:46,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:46,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:55:46,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:46,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:55:46,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:55:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:55:46,606 INFO L87 Difference]: Start difference. First operand has 593 states, 433 states have (on average 1.4133949191685913) internal successors, (612), 454 states have internal predecessors, (612), 126 states have call successors, (126), 33 states have call predecessors, (126), 32 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:55:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:52,057 INFO L93 Difference]: Finished difference Result 1924 states and 3013 transitions. [2022-02-20 21:55:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:55:52,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-02-20 21:55:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:55:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3013 transitions. [2022-02-20 21:55:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:55:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3013 transitions. [2022-02-20 21:55:52,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3013 transitions. [2022-02-20 21:55:54,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3013 edges. 3013 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:55,205 INFO L225 Difference]: With dead ends: 1924 [2022-02-20 21:55:55,206 INFO L226 Difference]: Without dead ends: 1316 [2022-02-20 21:55:55,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:55:55,231 INFO L933 BasicCegarLoop]: 950 mSDtfsCounter, 1221 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:55,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1283 Valid, 2182 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 21:55:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-02-20 21:55:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1124. [2022-02-20 21:55:55,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:55,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1316 states. Second operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:55:55,380 INFO L74 IsIncluded]: Start isIncluded. First operand 1316 states. Second operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:55:55,386 INFO L87 Difference]: Start difference. First operand 1316 states. Second operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:55:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:55,501 INFO L93 Difference]: Finished difference Result 1316 states and 1971 transitions. [2022-02-20 21:55:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1971 transitions. [2022-02-20 21:55:55,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:55,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:55,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) Second operand 1316 states. [2022-02-20 21:55:55,529 INFO L87 Difference]: Start difference. First operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) Second operand 1316 states. [2022-02-20 21:55:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:55,634 INFO L93 Difference]: Finished difference Result 1316 states and 1971 transitions. [2022-02-20 21:55:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1971 transitions. [2022-02-20 21:55:55,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:55,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:55,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:55,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:55:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1626 transitions. [2022-02-20 21:55:55,775 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1626 transitions. Word has length 47 [2022-02-20 21:55:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:55,776 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 1626 transitions. [2022-02-20 21:55:55,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:55:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1626 transitions. [2022-02-20 21:55:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 21:55:55,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:55,781 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:55:55,786 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash -203116028, now seen corresponding path program 1 times [2022-02-20 21:55:55,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:55,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553957919] [2022-02-20 21:55:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:55,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:55,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:55,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:55,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7411#true} {7411#true} #1583#return; {7411#true} is VALID [2022-02-20 21:55:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7411#true} {7411#true} #1585#return; {7411#true} is VALID [2022-02-20 21:55:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7411#true} {7411#true} #1587#return; {7411#true} is VALID [2022-02-20 21:55:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:55:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7411#true} {7411#true} #1589#return; {7411#true} is VALID [2022-02-20 21:55:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:55:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7411#true} {7411#true} #1591#return; {7411#true} is VALID [2022-02-20 21:55:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:55:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {7411#true} is VALID [2022-02-20 21:55:56,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7411#true} {7411#true} #1613#return; {7411#true} is VALID [2022-02-20 21:55:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:55:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {7411#true} is VALID [2022-02-20 21:55:56,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7411#true} {7411#true} #1615#return; {7411#true} is VALID [2022-02-20 21:55:56,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#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(103, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(4, 4);call write~init~int(76, 4, 0, 1);call write~init~int(67, 4, 1, 1);call write~init~int(80, 4, 2, 1);call write~init~int(0, 4, 3, 1);call #Ultimate.allocInit(5, 5);call write~init~int(73, 5, 0, 1);call write~init~int(80, 5, 1, 1);call write~init~int(67, 5, 2, 1);call write~init~int(80, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(7, 6);call write~init~int(73, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(86, 6, 2, 1);call write~init~int(54, 6, 3, 1);call write~init~int(67, 6, 4, 1);call write~init~int(80, 6, 5, 1);call write~init~int(0, 6, 6, 1);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(7, 8);call write~init~int(37, 8, 0, 1);call write~init~int(115, 8, 1, 1);call write~init~int(32, 8, 2, 1);call write~init~int(117, 8, 3, 1);call write~init~int(112, 8, 4, 1);call write~init~int(10, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(21, 11);~LDV_IN_INTERRUPT~0 := 1;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#tx_queue~0.base, ~#tx_queue~0.offset := 12, 0;call #Ultimate.allocInit(88, 12);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 8 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 16 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 20 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 24 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 28 + ~#tx_queue~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 32 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 40 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 48 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 56 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 64 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 72 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 76 + ~#tx_queue~0.offset, 8);~#cp_table~0.base, ~#cp_table~0.offset := 13, 0;call #Ultimate.allocInit(364, 13);call write~init~int(163, ~#cp_table~0.base, ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 4 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 8 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 12 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 16 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 20 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 24 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 28 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 32 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 36 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 40 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 44 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 48 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 52 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 56 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 60 + ~#cp_table~0.offset, 4);call write~init~int(1026, ~#cp_table~0.base, 64 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 68 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 72 + ~#cp_table~0.offset, 4);call write~init~int(133, ~#cp_table~0.base, 76 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 80 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 84 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 88 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 92 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 96 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 100 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 104 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 108 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 112 + ~#cp_table~0.offset, 4);call write~init~int(421, ~#cp_table~0.base, 116 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 120 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 124 + ~#cp_table~0.offset, 4);call write~init~int(262, ~#cp_table~0.base, 128 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 132 + ~#cp_table~0.offset, 4);call write~init~int(389, ~#cp_table~0.base, 136 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 140 + ~#cp_table~0.offset, 4);call write~init~int(675, ~#cp_table~0.base, 144 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 148 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 152 + ~#cp_table~0.offset, 4);call write~init~int(516, ~#cp_table~0.base, 156 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 160 + ~#cp_table~0.offset, 4);call write~init~int(643, ~#cp_table~0.base, 164 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 168 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 172 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 176 + ~#cp_table~0.offset, 4);call write~init~int(36, ~#cp_table~0.base, 180 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 184 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 188 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 192 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 196 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 200 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 204 + ~#cp_table~0.offset, 4);call write~init~int(163, ~#cp_table~0.base, 208 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 212 + ~#cp_table~0.offset, 4);call write~init~int(165, ~#cp_table~0.base, 216 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 220 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 224 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 228 + ~#cp_table~0.offset, 4);call write~init~int(2050, ~#cp_table~0.base, 232 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 236 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 240 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 244 + ~#cp_table~0.offset, 4);call write~init~int(2114, ~#cp_table~0.base, 248 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 252 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 256 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 260 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 264 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 268 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 272 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 276 + ~#cp_table~0.offset, 4);call write~init~int(4096, ~#cp_table~0.base, 280 + ~#cp_table~0.offset, 4);call write~init~int(4097, ~#cp_table~0.base, 284 + ~#cp_table~0.offset, 4);call write~init~int(4098, ~#cp_table~0.base, 288 + ~#cp_table~0.offset, 4);call write~init~int(4099, ~#cp_table~0.base, 292 + ~#cp_table~0.offset, 4);call write~init~int(4100, ~#cp_table~0.base, 296 + ~#cp_table~0.offset, 4);call write~init~int(4101, ~#cp_table~0.base, 300 + ~#cp_table~0.offset, 4);call write~init~int(4102, ~#cp_table~0.base, 304 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 308 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 312 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 316 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 320 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 324 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 328 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 332 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 336 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 340 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 344 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 348 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 352 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 356 + ~#cp_table~0.offset, 4);call write~init~int(1058, ~#cp_table~0.base, 360 + ~#cp_table~0.offset, 4);~#proto~0.base, ~#proto~0.offset := 14, 0;call #Ultimate.allocInit(88, 14);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_close.base, #funAddr~ppp_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_start.base, #funAddr~ppp_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_stop.base, #funAddr~ppp_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_ioctl.base, #funAddr~ppp_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_type_trans.base, #funAddr~ppp_type_trans.offset, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_rx.base, #funAddr~ppp_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset := 15, 0;call #Ultimate.allocInit(40, 15);call write~init~$Pointer$(#funAddr~ppp_hard_header.base, #funAddr~ppp_hard_header.offset, ~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 8 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 16 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 24 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 32 + ~#ppp_header_ops~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {7411#true} is VALID [2022-02-20 21:55:56,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset, main_#t~nondet237#1, main_#t~nondet238#1, main_#t~ret239#1.base, main_#t~ret239#1.offset, main_#t~ret240#1.base, main_#t~ret240#1.offset, main_#t~ret241#1.base, main_#t~ret241#1.offset, main_#t~ret242#1.base, main_#t~ret242#1.offset, main_#t~nondet243#1, main_#t~switch244#1, main_#t~nondet245#1, main_#t~switch246#1, main_#t~ret247#1, main_#t~nondet248#1, main_#t~switch249#1, main_#t~ret250#1, main_#t~ret251#1, main_#t~ret252#1, main_#t~ret253#1, main_#t~ret254#1, main_#t~ret255#1, main_#t~ret256#1, main_#t~ret257#1, main_#t~ret258#1, main_#t~ret259#1, main_#t~ret260#1, main_#t~ret261#1, main_#t~ret262#1, main_#t~ret263#1, main_#t~ret264#1, main_#t~ret265#1, main_#t~ret266#1, main_#t~ret267#1, main_#t~ret268#1, main_#t~ret269#1, main_#t~ret270#1, main_#t~nondet271#1, main_#t~switch272#1, main_#t~ret273#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~19#1.base, main_~tmp~19#1.offset, main_~ldvarg1~0#1, main_~tmp___0~9#1, main_~ldvarg4~0#1, main_~tmp___1~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~tmp___6~1#1, main_~tmp___7~1#1, main_~tmp___8~0#1, main_~tmp___9~0#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~19#1.base, main_~tmp~19#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___0~9#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___1~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~tmp___6~1#1;havoc main_~tmp___7~1#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {7411#true} is VALID [2022-02-20 21:55:56,051 INFO L272 TraceCheckUtils]: 2: Hoare triple {7411#true} call main_#t~ret236#1.base, main_#t~ret236#1.offset := ldv_zalloc(40); {7441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,052 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7411#true} {7411#true} #1583#return; {7411#true} is VALID [2022-02-20 21:55:56,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {7411#true} main_~tmp~19#1.base, main_~tmp~19#1.offset := main_#t~ret236#1.base, main_#t~ret236#1.offset;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~19#1.base, main_~tmp~19#1.offset;main_~tmp___0~9#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg1~0#1 := main_~tmp___0~9#1;main_~tmp___1~3#1 := main_#t~nondet238#1;havoc main_#t~nondet238#1;main_~ldvarg4~0#1 := main_~tmp___1~3#1; {7411#true} is VALID [2022-02-20 21:55:56,055 INFO L272 TraceCheckUtils]: 8: Hoare triple {7411#true} call main_#t~ret239#1.base, main_#t~ret239#1.offset := ldv_zalloc(232); {7441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,055 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7411#true} {7411#true} #1585#return; {7411#true} is VALID [2022-02-20 21:55:56,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {7411#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret239#1.base, main_#t~ret239#1.offset;havoc main_#t~ret239#1.base, main_#t~ret239#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset; {7411#true} is VALID [2022-02-20 21:55:56,056 INFO L272 TraceCheckUtils]: 14: Hoare triple {7411#true} call main_#t~ret240#1.base, main_#t~ret240#1.offset := ldv_zalloc(3264); {7441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,058 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7411#true} {7411#true} #1587#return; {7411#true} is VALID [2022-02-20 21:55:56,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {7411#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret240#1.base, main_#t~ret240#1.offset;havoc main_#t~ret240#1.base, main_#t~ret240#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {7411#true} is VALID [2022-02-20 21:55:56,059 INFO L272 TraceCheckUtils]: 20: Hoare triple {7411#true} call main_#t~ret241#1.base, main_#t~ret241#1.offset := ldv_zalloc(1); {7441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,069 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7411#true} {7411#true} #1589#return; {7411#true} is VALID [2022-02-20 21:55:56,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {7411#true} main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset := main_#t~ret241#1.base, main_#t~ret241#1.offset;havoc main_#t~ret241#1.base, main_#t~ret241#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset; {7411#true} is VALID [2022-02-20 21:55:56,073 INFO L272 TraceCheckUtils]: 26: Hoare triple {7411#true} call main_#t~ret242#1.base, main_#t~ret242#1.offset := ldv_zalloc(1); {7441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {7441#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {7411#true} is VALID [2022-02-20 21:55:56,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {7411#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {7411#true} is VALID [2022-02-20 21:55:56,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,074 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {7411#true} {7411#true} #1591#return; {7411#true} is VALID [2022-02-20 21:55:56,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {7411#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret242#1.base, main_#t~ret242#1.offset;havoc main_#t~ret242#1.base, main_#t~ret242#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {7411#true} is VALID [2022-02-20 21:55:56,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#true} assume { :end_inline_ldv_set_init } true; {7411#true} is VALID [2022-02-20 21:55:56,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {7411#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {7411#true} is VALID [2022-02-20 21:55:56,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {7411#true} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {7411#true} is VALID [2022-02-20 21:55:56,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {7411#true} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {7411#true} is VALID [2022-02-20 21:55:56,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {7411#true} assume main_#t~switch244#1; {7411#true} is VALID [2022-02-20 21:55:56,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {7411#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {7411#true} is VALID [2022-02-20 21:55:56,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {7411#true} assume !main_#t~switch246#1;main_#t~switch246#1 := main_#t~switch246#1 || 1 == main_~tmp___7~1#1; {7411#true} is VALID [2022-02-20 21:55:56,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {7411#true} assume main_#t~switch246#1; {7411#true} is VALID [2022-02-20 21:55:56,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {7411#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;assume { :begin_inline_skb_queue_head_init } true;skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset, skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset;skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset := skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset;call skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset := #Ultimate.allocOnStack(8); {7411#true} is VALID [2022-02-20 21:55:56,076 INFO L272 TraceCheckUtils]: 41: Hoare triple {7411#true} call skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset := spinlock_check(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset); {7411#true} is VALID [2022-02-20 21:55:56,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {7411#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {7411#true} is VALID [2022-02-20 21:55:56,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,077 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7411#true} {7411#true} #1613#return; {7411#true} is VALID [2022-02-20 21:55:56,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {7411#true} havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset; {7411#true} is VALID [2022-02-20 21:55:56,077 INFO L272 TraceCheckUtils]: 46: Hoare triple {7411#true} call __raw_spin_lock_init(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset, 3, 0, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset); {7411#true} is VALID [2022-02-20 21:55:56,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {7411#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {7411#true} is VALID [2022-02-20 21:55:56,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {7411#true} assume true; {7411#true} is VALID [2022-02-20 21:55:56,079 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7411#true} {7411#true} #1615#return; {7411#true} is VALID [2022-02-20 21:55:56,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {7411#true} assume { :begin_inline___skb_queue_head_init } true;__skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset := skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset;havoc __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset := __skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset;havoc __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset := __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset;call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, 8);call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, 8 + __skb_queue_head_init_~list#1.offset, 8);call write~int(0, __skb_queue_head_init_~list#1.base, 16 + __skb_queue_head_init_~list#1.offset, 4); {7411#true} is VALID [2022-02-20 21:55:56,084 INFO L290 TraceCheckUtils]: 51: Hoare triple {7411#true} assume { :end_inline___skb_queue_head_init } true;call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; {7411#true} is VALID [2022-02-20 21:55:56,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {7411#true} assume { :end_inline_skb_queue_head_init } true;assume { :begin_inline_register_hdlc_protocol } true;register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset;register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset := register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset; {7411#true} is VALID [2022-02-20 21:55:56,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {7411#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {7439#(= |ULTIMATE.start_mod_init_#res#1| 0)} is VALID [2022-02-20 21:55:56,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {7439#(= |ULTIMATE.start_mod_init_#res#1| 0)} main_#t~ret247#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret247#1 && main_#t~ret247#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret247#1;havoc main_#t~ret247#1; {7440#(= ~ldv_retval_0~0 0)} is VALID [2022-02-20 21:55:56,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {7440#(= ~ldv_retval_0~0 0)} assume !(0 == ~ldv_retval_0~0); {7412#false} is VALID [2022-02-20 21:55:56,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {7412#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {7412#false} is VALID [2022-02-20 21:55:56,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {7412#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret288#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {7412#false} is VALID [2022-02-20 21:55:56,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {7412#false} ldv_check_final_state_#t~ret288#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret288#1 && ldv_check_final_state_#t~ret288#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret288#1;havoc ldv_check_final_state_#t~ret288#1; {7412#false} is VALID [2022-02-20 21:55:56,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {7412#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {7412#false} is VALID [2022-02-20 21:55:56,086 INFO L272 TraceCheckUtils]: 60: Hoare triple {7412#false} call ldv_error(); {7412#false} is VALID [2022-02-20 21:55:56,087 INFO L290 TraceCheckUtils]: 61: Hoare triple {7412#false} assume !false; {7412#false} is VALID [2022-02-20 21:55:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:55:56,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:56,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553957919] [2022-02-20 21:55:56,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553957919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:56,088 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:56,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:55:56,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113895214] [2022-02-20 21:55:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-02-20 21:55:56,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:56,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:55:56,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:56,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:55:56,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:56,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:55:56,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:55:56,146 INFO L87 Difference]: Start difference. First operand 1124 states and 1626 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:56:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:01,112 INFO L93 Difference]: Finished difference Result 2425 states and 3576 transitions. [2022-02-20 21:56:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:56:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-02-20 21:56:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:56:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2075 transitions. [2022-02-20 21:56:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:56:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2075 transitions. [2022-02-20 21:56:01,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 2075 transitions. [2022-02-20 21:56:02,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2075 edges. 2075 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:03,103 INFO L225 Difference]: With dead ends: 2425 [2022-02-20 21:56:03,104 INFO L226 Difference]: Without dead ends: 1315 [2022-02-20 21:56:03,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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:56:03,111 INFO L933 BasicCegarLoop]: 1047 mSDtfsCounter, 1210 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:03,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1261 Valid, 2357 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 21:56:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-02-20 21:56:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1123. [2022-02-20 21:56:03,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:03,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1315 states. Second operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:56:03,170 INFO L74 IsIncluded]: Start isIncluded. First operand 1315 states. Second operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:56:03,172 INFO L87 Difference]: Start difference. First operand 1315 states. Second operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:56:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:03,277 INFO L93 Difference]: Finished difference Result 1315 states and 1967 transitions. [2022-02-20 21:56:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1967 transitions. [2022-02-20 21:56:03,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:03,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:03,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) Second operand 1315 states. [2022-02-20 21:56:03,297 INFO L87 Difference]: Start difference. First operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) Second operand 1315 states. [2022-02-20 21:56:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:03,391 INFO L93 Difference]: Finished difference Result 1315 states and 1967 transitions. [2022-02-20 21:56:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1967 transitions. [2022-02-20 21:56:03,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:03,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:03,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:03,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-02-20 21:56:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1622 transitions. [2022-02-20 21:56:03,505 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1622 transitions. Word has length 62 [2022-02-20 21:56:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:03,507 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1622 transitions. [2022-02-20 21:56:03,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 21:56:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1622 transitions. [2022-02-20 21:56:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 21:56:03,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:03,512 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:03,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:56:03,512 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1442675309, now seen corresponding path program 1 times [2022-02-20 21:56:03,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:03,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985017249] [2022-02-20 21:56:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14895#true} {14895#true} #1583#return; {14895#true} is VALID [2022-02-20 21:56:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:56:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14895#true} {14895#true} #1585#return; {14895#true} is VALID [2022-02-20 21:56:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:56:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14895#true} {14895#true} #1587#return; {14895#true} is VALID [2022-02-20 21:56:03,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:56:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14895#true} {14895#true} #1589#return; {14895#true} is VALID [2022-02-20 21:56:03,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:56:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14895#true} {14895#true} #1591#return; {14895#true} is VALID [2022-02-20 21:56:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:56:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {14895#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {14895#true} is VALID [2022-02-20 21:56:03,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1613#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {14895#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {14895#true} is VALID [2022-02-20 21:56:03,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1615#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:56:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1617#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:56:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:03,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1619#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {14895#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(103, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(4, 4);call write~init~int(76, 4, 0, 1);call write~init~int(67, 4, 1, 1);call write~init~int(80, 4, 2, 1);call write~init~int(0, 4, 3, 1);call #Ultimate.allocInit(5, 5);call write~init~int(73, 5, 0, 1);call write~init~int(80, 5, 1, 1);call write~init~int(67, 5, 2, 1);call write~init~int(80, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(7, 6);call write~init~int(73, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(86, 6, 2, 1);call write~init~int(54, 6, 3, 1);call write~init~int(67, 6, 4, 1);call write~init~int(80, 6, 5, 1);call write~init~int(0, 6, 6, 1);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(7, 8);call write~init~int(37, 8, 0, 1);call write~init~int(115, 8, 1, 1);call write~init~int(32, 8, 2, 1);call write~init~int(117, 8, 3, 1);call write~init~int(112, 8, 4, 1);call write~init~int(10, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(21, 11);~LDV_IN_INTERRUPT~0 := 1;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#tx_queue~0.base, ~#tx_queue~0.offset := 12, 0;call #Ultimate.allocInit(88, 12);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 8 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 16 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 20 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 24 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 28 + ~#tx_queue~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 32 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 40 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 48 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 56 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 64 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 72 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 76 + ~#tx_queue~0.offset, 8);~#cp_table~0.base, ~#cp_table~0.offset := 13, 0;call #Ultimate.allocInit(364, 13);call write~init~int(163, ~#cp_table~0.base, ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 4 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 8 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 12 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 16 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 20 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 24 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 28 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 32 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 36 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 40 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 44 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 48 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 52 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 56 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 60 + ~#cp_table~0.offset, 4);call write~init~int(1026, ~#cp_table~0.base, 64 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 68 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 72 + ~#cp_table~0.offset, 4);call write~init~int(133, ~#cp_table~0.base, 76 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 80 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 84 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 88 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 92 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 96 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 100 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 104 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 108 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 112 + ~#cp_table~0.offset, 4);call write~init~int(421, ~#cp_table~0.base, 116 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 120 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 124 + ~#cp_table~0.offset, 4);call write~init~int(262, ~#cp_table~0.base, 128 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 132 + ~#cp_table~0.offset, 4);call write~init~int(389, ~#cp_table~0.base, 136 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 140 + ~#cp_table~0.offset, 4);call write~init~int(675, ~#cp_table~0.base, 144 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 148 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 152 + ~#cp_table~0.offset, 4);call write~init~int(516, ~#cp_table~0.base, 156 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 160 + ~#cp_table~0.offset, 4);call write~init~int(643, ~#cp_table~0.base, 164 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 168 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 172 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 176 + ~#cp_table~0.offset, 4);call write~init~int(36, ~#cp_table~0.base, 180 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 184 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 188 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 192 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 196 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 200 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 204 + ~#cp_table~0.offset, 4);call write~init~int(163, ~#cp_table~0.base, 208 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 212 + ~#cp_table~0.offset, 4);call write~init~int(165, ~#cp_table~0.base, 216 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 220 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 224 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 228 + ~#cp_table~0.offset, 4);call write~init~int(2050, ~#cp_table~0.base, 232 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 236 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 240 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 244 + ~#cp_table~0.offset, 4);call write~init~int(2114, ~#cp_table~0.base, 248 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 252 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 256 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 260 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 264 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 268 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 272 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 276 + ~#cp_table~0.offset, 4);call write~init~int(4096, ~#cp_table~0.base, 280 + ~#cp_table~0.offset, 4);call write~init~int(4097, ~#cp_table~0.base, 284 + ~#cp_table~0.offset, 4);call write~init~int(4098, ~#cp_table~0.base, 288 + ~#cp_table~0.offset, 4);call write~init~int(4099, ~#cp_table~0.base, 292 + ~#cp_table~0.offset, 4);call write~init~int(4100, ~#cp_table~0.base, 296 + ~#cp_table~0.offset, 4);call write~init~int(4101, ~#cp_table~0.base, 300 + ~#cp_table~0.offset, 4);call write~init~int(4102, ~#cp_table~0.base, 304 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 308 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 312 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 316 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 320 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 324 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 328 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 332 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 336 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 340 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 344 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 348 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 352 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 356 + ~#cp_table~0.offset, 4);call write~init~int(1058, ~#cp_table~0.base, 360 + ~#cp_table~0.offset, 4);~#proto~0.base, ~#proto~0.offset := 14, 0;call #Ultimate.allocInit(88, 14);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_close.base, #funAddr~ppp_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_start.base, #funAddr~ppp_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_stop.base, #funAddr~ppp_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_ioctl.base, #funAddr~ppp_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_type_trans.base, #funAddr~ppp_type_trans.offset, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_rx.base, #funAddr~ppp_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset := 15, 0;call #Ultimate.allocInit(40, 15);call write~init~$Pointer$(#funAddr~ppp_hard_header.base, #funAddr~ppp_hard_header.offset, ~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 8 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 16 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 24 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 32 + ~#ppp_header_ops~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {14895#true} is VALID [2022-02-20 21:56:03,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {14895#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset, main_#t~nondet237#1, main_#t~nondet238#1, main_#t~ret239#1.base, main_#t~ret239#1.offset, main_#t~ret240#1.base, main_#t~ret240#1.offset, main_#t~ret241#1.base, main_#t~ret241#1.offset, main_#t~ret242#1.base, main_#t~ret242#1.offset, main_#t~nondet243#1, main_#t~switch244#1, main_#t~nondet245#1, main_#t~switch246#1, main_#t~ret247#1, main_#t~nondet248#1, main_#t~switch249#1, main_#t~ret250#1, main_#t~ret251#1, main_#t~ret252#1, main_#t~ret253#1, main_#t~ret254#1, main_#t~ret255#1, main_#t~ret256#1, main_#t~ret257#1, main_#t~ret258#1, main_#t~ret259#1, main_#t~ret260#1, main_#t~ret261#1, main_#t~ret262#1, main_#t~ret263#1, main_#t~ret264#1, main_#t~ret265#1, main_#t~ret266#1, main_#t~ret267#1, main_#t~ret268#1, main_#t~ret269#1, main_#t~ret270#1, main_#t~nondet271#1, main_#t~switch272#1, main_#t~ret273#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~19#1.base, main_~tmp~19#1.offset, main_~ldvarg1~0#1, main_~tmp___0~9#1, main_~ldvarg4~0#1, main_~tmp___1~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~tmp___6~1#1, main_~tmp___7~1#1, main_~tmp___8~0#1, main_~tmp___9~0#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~19#1.base, main_~tmp~19#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___0~9#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___1~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~tmp___6~1#1;havoc main_~tmp___7~1#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {14895#true} is VALID [2022-02-20 21:56:03,790 INFO L272 TraceCheckUtils]: 2: Hoare triple {14895#true} call main_#t~ret236#1.base, main_#t~ret236#1.offset := ldv_zalloc(40); {14934#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:03,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,791 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14895#true} {14895#true} #1583#return; {14895#true} is VALID [2022-02-20 21:56:03,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {14895#true} main_~tmp~19#1.base, main_~tmp~19#1.offset := main_#t~ret236#1.base, main_#t~ret236#1.offset;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~19#1.base, main_~tmp~19#1.offset;main_~tmp___0~9#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg1~0#1 := main_~tmp___0~9#1;main_~tmp___1~3#1 := main_#t~nondet238#1;havoc main_#t~nondet238#1;main_~ldvarg4~0#1 := main_~tmp___1~3#1; {14895#true} is VALID [2022-02-20 21:56:03,792 INFO L272 TraceCheckUtils]: 8: Hoare triple {14895#true} call main_#t~ret239#1.base, main_#t~ret239#1.offset := ldv_zalloc(232); {14934#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:03,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,793 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14895#true} {14895#true} #1585#return; {14895#true} is VALID [2022-02-20 21:56:03,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {14895#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret239#1.base, main_#t~ret239#1.offset;havoc main_#t~ret239#1.base, main_#t~ret239#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset; {14895#true} is VALID [2022-02-20 21:56:03,793 INFO L272 TraceCheckUtils]: 14: Hoare triple {14895#true} call main_#t~ret240#1.base, main_#t~ret240#1.offset := ldv_zalloc(3264); {14934#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:03,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,816 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14895#true} {14895#true} #1587#return; {14895#true} is VALID [2022-02-20 21:56:03,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {14895#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret240#1.base, main_#t~ret240#1.offset;havoc main_#t~ret240#1.base, main_#t~ret240#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {14895#true} is VALID [2022-02-20 21:56:03,818 INFO L272 TraceCheckUtils]: 20: Hoare triple {14895#true} call main_#t~ret241#1.base, main_#t~ret241#1.offset := ldv_zalloc(1); {14934#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:03,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,818 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14895#true} {14895#true} #1589#return; {14895#true} is VALID [2022-02-20 21:56:03,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {14895#true} main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset := main_#t~ret241#1.base, main_#t~ret241#1.offset;havoc main_#t~ret241#1.base, main_#t~ret241#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset; {14895#true} is VALID [2022-02-20 21:56:03,819 INFO L272 TraceCheckUtils]: 26: Hoare triple {14895#true} call main_#t~ret242#1.base, main_#t~ret242#1.offset := ldv_zalloc(1); {14934#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:03,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,820 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {14895#true} {14895#true} #1591#return; {14895#true} is VALID [2022-02-20 21:56:03,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {14895#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret242#1.base, main_#t~ret242#1.offset;havoc main_#t~ret242#1.base, main_#t~ret242#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {14917#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {14917#(= ~last_index~0 0)} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {14917#(= ~last_index~0 0)} assume main_#t~switch244#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {14917#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {14917#(= ~last_index~0 0)} assume !main_#t~switch246#1;main_#t~switch246#1 := main_#t~switch246#1 || 1 == main_~tmp___7~1#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {14917#(= ~last_index~0 0)} assume main_#t~switch246#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {14917#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;assume { :begin_inline_skb_queue_head_init } true;skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset, skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset;skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset := skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset;call skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset := #Ultimate.allocOnStack(8); {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,825 INFO L272 TraceCheckUtils]: 41: Hoare triple {14917#(= ~last_index~0 0)} call skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset := spinlock_check(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset); {14895#true} is VALID [2022-02-20 21:56:03,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {14895#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {14895#true} is VALID [2022-02-20 21:56:03,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,826 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1613#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {14917#(= ~last_index~0 0)} havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,827 INFO L272 TraceCheckUtils]: 46: Hoare triple {14917#(= ~last_index~0 0)} call __raw_spin_lock_init(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset, 3, 0, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset); {14895#true} is VALID [2022-02-20 21:56:03,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {14895#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {14895#true} is VALID [2022-02-20 21:56:03,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,828 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1615#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {14917#(= ~last_index~0 0)} assume { :begin_inline___skb_queue_head_init } true;__skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset := skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset;havoc __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset := __skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset;havoc __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset := __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset;call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, 8);call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, 8 + __skb_queue_head_init_~list#1.offset, 8);call write~int(0, __skb_queue_head_init_~list#1.base, 16 + __skb_queue_head_init_~list#1.offset, 4); {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline___skb_queue_head_init } true;call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline_skb_queue_head_init } true;assume { :begin_inline_register_hdlc_protocol } true;register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset;register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset := register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {14917#(= ~last_index~0 0)} main_#t~ret247#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret247#1 && main_#t~ret247#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret247#1;havoc main_#t~ret247#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {14917#(= ~last_index~0 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_3 } true;havoc ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset, ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset, ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset;havoc ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,840 INFO L272 TraceCheckUtils]: 56: Hoare triple {14917#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset := ldv_zalloc(3264); {14934#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:03,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,842 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1617#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {14917#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset := ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset;havoc ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,844 INFO L272 TraceCheckUtils]: 62: Hoare triple {14917#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset := ldv_zalloc(232); {14934#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:03,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {14934#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {14895#true} is VALID [2022-02-20 21:56:03,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {14895#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {14895#true} is VALID [2022-02-20 21:56:03,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {14895#true} assume true; {14895#true} is VALID [2022-02-20 21:56:03,851 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14895#true} {14917#(= ~last_index~0 0)} #1619#return; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {14917#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset;havoc ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_hdlc_proto_3 } true; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {14917#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_0~0); {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {14917#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {14917#(= ~last_index~0 0)} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {14917#(= ~last_index~0 0)} assume main_#t~switch244#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {14917#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {14917#(= ~last_index~0 0)} assume main_#t~switch246#1; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,855 INFO L290 TraceCheckUtils]: 75: Hoare triple {14917#(= ~last_index~0 0)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_mod_exit } true;assume { :begin_inline_unregister_hdlc_protocol } true;unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset;unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset := unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,856 INFO L290 TraceCheckUtils]: 76: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline_unregister_hdlc_protocol } true; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,856 INFO L290 TraceCheckUtils]: 77: Hoare triple {14917#(= ~last_index~0 0)} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {14917#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:03,856 INFO L290 TraceCheckUtils]: 78: Hoare triple {14917#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret288#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {14932#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} is VALID [2022-02-20 21:56:03,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {14932#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} ldv_check_final_state_#t~ret288#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret288#1 && ldv_check_final_state_#t~ret288#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret288#1;havoc ldv_check_final_state_#t~ret288#1; {14933#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~7#1|)} is VALID [2022-02-20 21:56:03,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {14933#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~7#1|)} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {14896#false} is VALID [2022-02-20 21:56:03,858 INFO L272 TraceCheckUtils]: 81: Hoare triple {14896#false} call ldv_error(); {14896#false} is VALID [2022-02-20 21:56:03,858 INFO L290 TraceCheckUtils]: 82: Hoare triple {14896#false} assume !false; {14896#false} is VALID [2022-02-20 21:56:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-02-20 21:56:03,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:03,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985017249] [2022-02-20 21:56:03,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985017249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:03,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:03,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:56:03,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050913388] [2022-02-20 21:56:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:03,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 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 83 [2022-02-20 21:56:03,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:03,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 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:56:03,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:03,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:56:03,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:56:03,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:56:03,927 INFO L87 Difference]: Start difference. First operand 1123 states and 1622 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 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:56:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:11,980 INFO L93 Difference]: Finished difference Result 3722 states and 5707 transitions. [2022-02-20 21:56:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:56:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 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 83 [2022-02-20 21:56:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 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:56:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2910 transitions. [2022-02-20 21:56:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 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:56:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2910 transitions. [2022-02-20 21:56:12,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 2910 transitions. [2022-02-20 21:56:14,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2910 edges. 2910 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:15,273 INFO L225 Difference]: With dead ends: 3722 [2022-02-20 21:56:15,274 INFO L226 Difference]: Without dead ends: 2608 [2022-02-20 21:56:15,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 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:56:15,289 INFO L933 BasicCegarLoop]: 1020 mSDtfsCounter, 1170 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:15,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1232 Valid, 3923 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 21:56:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2022-02-20 21:56:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2370. [2022-02-20 21:56:15,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:15,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2608 states. Second operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) [2022-02-20 21:56:15,425 INFO L74 IsIncluded]: Start isIncluded. First operand 2608 states. Second operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) [2022-02-20 21:56:15,431 INFO L87 Difference]: Start difference. First operand 2608 states. Second operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) [2022-02-20 21:56:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:15,658 INFO L93 Difference]: Finished difference Result 2608 states and 3996 transitions. [2022-02-20 21:56:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3996 transitions. [2022-02-20 21:56:15,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:15,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:15,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) Second operand 2608 states. [2022-02-20 21:56:15,710 INFO L87 Difference]: Start difference. First operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) Second operand 2608 states. [2022-02-20 21:56:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:16,023 INFO L93 Difference]: Finished difference Result 2608 states and 3996 transitions. [2022-02-20 21:56:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3996 transitions. [2022-02-20 21:56:16,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:16,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:16,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:16,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) [2022-02-20 21:56:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3545 transitions. [2022-02-20 21:56:16,402 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3545 transitions. Word has length 83 [2022-02-20 21:56:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:16,403 INFO L470 AbstractCegarLoop]: Abstraction has 2370 states and 3545 transitions. [2022-02-20 21:56:16,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 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:56:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3545 transitions. [2022-02-20 21:56:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-20 21:56:16,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:16,409 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:16,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:56:16,409 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:16,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1545482870, now seen corresponding path program 1 times [2022-02-20 21:56:16,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:16,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971733426] [2022-02-20 21:56:16,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:16,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28397#true} #1583#return; {28397#true} is VALID [2022-02-20 21:56:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:56:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28397#true} #1585#return; {28397#true} is VALID [2022-02-20 21:56:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:56:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28397#true} #1587#return; {28397#true} is VALID [2022-02-20 21:56:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:56:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28397#true} #1589#return; {28397#true} is VALID [2022-02-20 21:56:16,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:56:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28397#true} #1591#return; {28397#true} is VALID [2022-02-20 21:56:16,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28397#true} #1519#return; {28397#true} is VALID [2022-02-20 21:56:16,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {28457#(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~2#1.base, ~skb~2#1.offset;havoc ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,634 INFO L272 TraceCheckUtils]: 1: Hoare triple {28397#true} call #t~ret284#1.base, #t~ret284#1.offset := ldv_zalloc(248); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,635 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28397#true} {28397#true} #1519#return; {28397#true} is VALID [2022-02-20 21:56:16,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {28397#true} ~tmp___7~3#1.base, ~tmp___7~3#1.offset := #t~ret284#1.base, #t~ret284#1.offset;havoc #t~ret284#1.base, #t~ret284#1.offset;~skb~2#1.base, ~skb~2#1.offset := ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {28397#true} assume !(~skb~2#1.base == 0 && ~skb~2#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~2#1.base, ~skb~2#1.offset;havoc ldv_set_add_#t~mem279#1.base, ldv_set_add_#t~mem279#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~1#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~1#1;ldv_set_add_~i~1#1 := 0; {28397#true} is VALID [2022-02-20 21:56:16,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {28397#true} assume !false; {28397#true} is VALID [2022-02-20 21:56:16,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {28397#true} assume !(ldv_set_add_~i~1#1 < ~last_index~0); {28397#true} is VALID [2022-02-20 21:56:16,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {28397#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; {28397#true} is VALID [2022-02-20 21:56:16,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {28397#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~2#1.base, ~skb~2#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,638 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28397#true} {28397#true} #1565#return; {28397#true} is VALID [2022-02-20 21:56:16,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {28457#(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~0#1.base, ~skb~0#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume { :begin_inline_ldv_skb_dequeue_12 } true;ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset, ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset, ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset;ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset := ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,639 INFO L272 TraceCheckUtils]: 2: Hoare triple {28397#true} call ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset := ldv_skb_alloc(); {28457#(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:56:16,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {28457#(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~2#1.base, ~skb~2#1.offset;havoc ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {28397#true} call #t~ret284#1.base, #t~ret284#1.offset := ldv_zalloc(248); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,641 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {28397#true} {28397#true} #1519#return; {28397#true} is VALID [2022-02-20 21:56:16,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {28397#true} ~tmp___7~3#1.base, ~tmp___7~3#1.offset := #t~ret284#1.base, #t~ret284#1.offset;havoc #t~ret284#1.base, #t~ret284#1.offset;~skb~2#1.base, ~skb~2#1.offset := ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {28397#true} assume !(~skb~2#1.base == 0 && ~skb~2#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~2#1.base, ~skb~2#1.offset;havoc ldv_set_add_#t~mem279#1.base, ldv_set_add_#t~mem279#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~1#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~1#1;ldv_set_add_~i~1#1 := 0; {28397#true} is VALID [2022-02-20 21:56:16,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {28397#true} assume !false; {28397#true} is VALID [2022-02-20 21:56:16,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {28397#true} assume !(ldv_set_add_~i~1#1 < ~last_index~0); {28397#true} is VALID [2022-02-20 21:56:16,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {28397#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; {28397#true} is VALID [2022-02-20 21:56:16,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {28397#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~2#1.base, ~skb~2#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,647 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28397#true} {28397#true} #1565#return; {28397#true} is VALID [2022-02-20 21:56:16,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {28397#true} ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset := ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset := ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {28397#true} #t~ret77#1.base, #t~ret77#1.offset := ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret77#1.base, #t~ret77#1.offset;havoc #t~ret77#1.base, #t~ret77#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {28397#true} assume !(0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616); {28397#true} is VALID [2022-02-20 21:56:16,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,649 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28397#true} {28398#false} #1661#return; {28398#false} is VALID [2022-02-20 21:56:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-02-20 21:56:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {28397#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {28397#true} is VALID [2022-02-20 21:56:16,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28397#true} {28398#false} #1613#return; {28398#false} is VALID [2022-02-20 21:56:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-20 21:56:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {28397#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {28397#true} is VALID [2022-02-20 21:56:16,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28397#true} {28398#false} #1615#return; {28398#false} is VALID [2022-02-20 21:56:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-02-20 21:56:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28398#false} #1617#return; {28398#false} is VALID [2022-02-20 21:56:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-20 21:56:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28397#true} {28398#false} #1619#return; {28398#false} is VALID [2022-02-20 21:56:16,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {28397#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(103, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(4, 4);call write~init~int(76, 4, 0, 1);call write~init~int(67, 4, 1, 1);call write~init~int(80, 4, 2, 1);call write~init~int(0, 4, 3, 1);call #Ultimate.allocInit(5, 5);call write~init~int(73, 5, 0, 1);call write~init~int(80, 5, 1, 1);call write~init~int(67, 5, 2, 1);call write~init~int(80, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(7, 6);call write~init~int(73, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(86, 6, 2, 1);call write~init~int(54, 6, 3, 1);call write~init~int(67, 6, 4, 1);call write~init~int(80, 6, 5, 1);call write~init~int(0, 6, 6, 1);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(7, 8);call write~init~int(37, 8, 0, 1);call write~init~int(115, 8, 1, 1);call write~init~int(32, 8, 2, 1);call write~init~int(117, 8, 3, 1);call write~init~int(112, 8, 4, 1);call write~init~int(10, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(21, 11);~LDV_IN_INTERRUPT~0 := 1;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#tx_queue~0.base, ~#tx_queue~0.offset := 12, 0;call #Ultimate.allocInit(88, 12);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 8 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 16 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 20 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 24 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 28 + ~#tx_queue~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 32 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 40 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 48 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 56 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 64 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 72 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 76 + ~#tx_queue~0.offset, 8);~#cp_table~0.base, ~#cp_table~0.offset := 13, 0;call #Ultimate.allocInit(364, 13);call write~init~int(163, ~#cp_table~0.base, ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 4 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 8 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 12 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 16 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 20 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 24 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 28 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 32 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 36 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 40 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 44 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 48 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 52 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 56 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 60 + ~#cp_table~0.offset, 4);call write~init~int(1026, ~#cp_table~0.base, 64 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 68 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 72 + ~#cp_table~0.offset, 4);call write~init~int(133, ~#cp_table~0.base, 76 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 80 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 84 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 88 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 92 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 96 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 100 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 104 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 108 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 112 + ~#cp_table~0.offset, 4);call write~init~int(421, ~#cp_table~0.base, 116 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 120 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 124 + ~#cp_table~0.offset, 4);call write~init~int(262, ~#cp_table~0.base, 128 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 132 + ~#cp_table~0.offset, 4);call write~init~int(389, ~#cp_table~0.base, 136 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 140 + ~#cp_table~0.offset, 4);call write~init~int(675, ~#cp_table~0.base, 144 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 148 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 152 + ~#cp_table~0.offset, 4);call write~init~int(516, ~#cp_table~0.base, 156 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 160 + ~#cp_table~0.offset, 4);call write~init~int(643, ~#cp_table~0.base, 164 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 168 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 172 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 176 + ~#cp_table~0.offset, 4);call write~init~int(36, ~#cp_table~0.base, 180 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 184 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 188 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 192 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 196 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 200 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 204 + ~#cp_table~0.offset, 4);call write~init~int(163, ~#cp_table~0.base, 208 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 212 + ~#cp_table~0.offset, 4);call write~init~int(165, ~#cp_table~0.base, 216 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 220 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 224 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 228 + ~#cp_table~0.offset, 4);call write~init~int(2050, ~#cp_table~0.base, 232 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 236 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 240 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 244 + ~#cp_table~0.offset, 4);call write~init~int(2114, ~#cp_table~0.base, 248 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 252 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 256 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 260 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 264 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 268 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 272 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 276 + ~#cp_table~0.offset, 4);call write~init~int(4096, ~#cp_table~0.base, 280 + ~#cp_table~0.offset, 4);call write~init~int(4097, ~#cp_table~0.base, 284 + ~#cp_table~0.offset, 4);call write~init~int(4098, ~#cp_table~0.base, 288 + ~#cp_table~0.offset, 4);call write~init~int(4099, ~#cp_table~0.base, 292 + ~#cp_table~0.offset, 4);call write~init~int(4100, ~#cp_table~0.base, 296 + ~#cp_table~0.offset, 4);call write~init~int(4101, ~#cp_table~0.base, 300 + ~#cp_table~0.offset, 4);call write~init~int(4102, ~#cp_table~0.base, 304 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 308 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 312 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 316 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 320 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 324 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 328 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 332 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 336 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 340 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 344 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 348 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 352 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 356 + ~#cp_table~0.offset, 4);call write~init~int(1058, ~#cp_table~0.base, 360 + ~#cp_table~0.offset, 4);~#proto~0.base, ~#proto~0.offset := 14, 0;call #Ultimate.allocInit(88, 14);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_close.base, #funAddr~ppp_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_start.base, #funAddr~ppp_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_stop.base, #funAddr~ppp_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_ioctl.base, #funAddr~ppp_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_type_trans.base, #funAddr~ppp_type_trans.offset, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_rx.base, #funAddr~ppp_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset := 15, 0;call #Ultimate.allocInit(40, 15);call write~init~$Pointer$(#funAddr~ppp_hard_header.base, #funAddr~ppp_hard_header.offset, ~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 8 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 16 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 24 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 32 + ~#ppp_header_ops~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {28397#true} is VALID [2022-02-20 21:56:16,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {28397#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset, main_#t~nondet237#1, main_#t~nondet238#1, main_#t~ret239#1.base, main_#t~ret239#1.offset, main_#t~ret240#1.base, main_#t~ret240#1.offset, main_#t~ret241#1.base, main_#t~ret241#1.offset, main_#t~ret242#1.base, main_#t~ret242#1.offset, main_#t~nondet243#1, main_#t~switch244#1, main_#t~nondet245#1, main_#t~switch246#1, main_#t~ret247#1, main_#t~nondet248#1, main_#t~switch249#1, main_#t~ret250#1, main_#t~ret251#1, main_#t~ret252#1, main_#t~ret253#1, main_#t~ret254#1, main_#t~ret255#1, main_#t~ret256#1, main_#t~ret257#1, main_#t~ret258#1, main_#t~ret259#1, main_#t~ret260#1, main_#t~ret261#1, main_#t~ret262#1, main_#t~ret263#1, main_#t~ret264#1, main_#t~ret265#1, main_#t~ret266#1, main_#t~ret267#1, main_#t~ret268#1, main_#t~ret269#1, main_#t~ret270#1, main_#t~nondet271#1, main_#t~switch272#1, main_#t~ret273#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~19#1.base, main_~tmp~19#1.offset, main_~ldvarg1~0#1, main_~tmp___0~9#1, main_~ldvarg4~0#1, main_~tmp___1~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~tmp___6~1#1, main_~tmp___7~1#1, main_~tmp___8~0#1, main_~tmp___9~0#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~19#1.base, main_~tmp~19#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___0~9#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___1~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~tmp___6~1#1;havoc main_~tmp___7~1#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {28397#true} is VALID [2022-02-20 21:56:16,688 INFO L272 TraceCheckUtils]: 2: Hoare triple {28397#true} call main_#t~ret236#1.base, main_#t~ret236#1.offset := ldv_zalloc(40); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,688 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28397#true} {28397#true} #1583#return; {28397#true} is VALID [2022-02-20 21:56:16,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {28397#true} main_~tmp~19#1.base, main_~tmp~19#1.offset := main_#t~ret236#1.base, main_#t~ret236#1.offset;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~19#1.base, main_~tmp~19#1.offset;main_~tmp___0~9#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg1~0#1 := main_~tmp___0~9#1;main_~tmp___1~3#1 := main_#t~nondet238#1;havoc main_#t~nondet238#1;main_~ldvarg4~0#1 := main_~tmp___1~3#1; {28397#true} is VALID [2022-02-20 21:56:16,689 INFO L272 TraceCheckUtils]: 8: Hoare triple {28397#true} call main_#t~ret239#1.base, main_#t~ret239#1.offset := ldv_zalloc(232); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,690 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {28397#true} {28397#true} #1585#return; {28397#true} is VALID [2022-02-20 21:56:16,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {28397#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret239#1.base, main_#t~ret239#1.offset;havoc main_#t~ret239#1.base, main_#t~ret239#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,691 INFO L272 TraceCheckUtils]: 14: Hoare triple {28397#true} call main_#t~ret240#1.base, main_#t~ret240#1.offset := ldv_zalloc(3264); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,691 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28397#true} {28397#true} #1587#return; {28397#true} is VALID [2022-02-20 21:56:16,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {28397#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret240#1.base, main_#t~ret240#1.offset;havoc main_#t~ret240#1.base, main_#t~ret240#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,693 INFO L272 TraceCheckUtils]: 20: Hoare triple {28397#true} call main_#t~ret241#1.base, main_#t~ret241#1.offset := ldv_zalloc(1); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,696 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {28397#true} {28397#true} #1589#return; {28397#true} is VALID [2022-02-20 21:56:16,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {28397#true} main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset := main_#t~ret241#1.base, main_#t~ret241#1.offset;havoc main_#t~ret241#1.base, main_#t~ret241#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,699 INFO L272 TraceCheckUtils]: 26: Hoare triple {28397#true} call main_#t~ret242#1.base, main_#t~ret242#1.offset := ldv_zalloc(1); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,700 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {28397#true} {28397#true} #1591#return; {28397#true} is VALID [2022-02-20 21:56:16,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {28397#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret242#1.base, main_#t~ret242#1.offset;havoc main_#t~ret242#1.base, main_#t~ret242#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {28397#true} is VALID [2022-02-20 21:56:16,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {28397#true} assume { :end_inline_ldv_set_init } true; {28397#true} is VALID [2022-02-20 21:56:16,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {28397#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {28419#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:56:16,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {28419#(= ~ldv_state_variable_3~0 0)} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {28419#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:56:16,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {28419#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {28419#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:56:16,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {28419#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 2 == main_~tmp___6~1#1; {28419#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:56:16,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {28419#(= ~ldv_state_variable_3~0 0)} assume main_#t~switch244#1; {28419#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:56:16,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {28419#(= ~ldv_state_variable_3~0 0)} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet248#1 && main_#t~nondet248#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet248#1;havoc main_#t~nondet248#1;main_#t~switch249#1 := 0 == main_~tmp___8~0#1; {28398#false} is VALID [2022-02-20 21:56:16,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {28398#false} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 1 == main_~tmp___8~0#1; {28398#false} is VALID [2022-02-20 21:56:16,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {28398#false} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 2 == main_~tmp___8~0#1; {28398#false} is VALID [2022-02-20 21:56:16,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {28398#false} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 3 == main_~tmp___8~0#1; {28398#false} is VALID [2022-02-20 21:56:16,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {28398#false} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 4 == main_~tmp___8~0#1; {28398#false} is VALID [2022-02-20 21:56:16,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {28398#false} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 5 == main_~tmp___8~0#1; {28398#false} is VALID [2022-02-20 21:56:16,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {28398#false} assume main_#t~switch249#1; {28398#false} is VALID [2022-02-20 21:56:16,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {28398#false} assume 4 == ~ldv_state_variable_3~0;assume { :begin_inline_ppp_close } true;ppp_close_#in~dev#1.base, ppp_close_#in~dev#1.offset := ~proto_group1~0.base, ~proto_group1~0.offset;havoc ppp_close_~dev#1.base, ppp_close_~dev#1.offset;ppp_close_~dev#1.base, ppp_close_~dev#1.offset := ppp_close_#in~dev#1.base, ppp_close_#in~dev#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,705 INFO L272 TraceCheckUtils]: 46: Hoare triple {28398#false} call ppp_tx_flush(); {28457#(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:56:16,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {28457#(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~0#1.base, ~skb~0#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {28397#true} assume { :begin_inline_ldv_skb_dequeue_12 } true;ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset, ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset, ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset;ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset := ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,706 INFO L272 TraceCheckUtils]: 49: Hoare triple {28397#true} call ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset := ldv_skb_alloc(); {28457#(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:56:16,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {28457#(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~2#1.base, ~skb~2#1.offset;havoc ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,706 INFO L272 TraceCheckUtils]: 51: Hoare triple {28397#true} call #t~ret284#1.base, #t~ret284#1.offset := ldv_zalloc(248); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,707 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28397#true} {28397#true} #1519#return; {28397#true} is VALID [2022-02-20 21:56:16,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {28397#true} ~tmp___7~3#1.base, ~tmp___7~3#1.offset := #t~ret284#1.base, #t~ret284#1.offset;havoc #t~ret284#1.base, #t~ret284#1.offset;~skb~2#1.base, ~skb~2#1.offset := ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {28397#true} assume !(~skb~2#1.base == 0 && ~skb~2#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~2#1.base, ~skb~2#1.offset;havoc ldv_set_add_#t~mem279#1.base, ldv_set_add_#t~mem279#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~1#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~1#1;ldv_set_add_~i~1#1 := 0; {28397#true} is VALID [2022-02-20 21:56:16,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {28397#true} assume !false; {28397#true} is VALID [2022-02-20 21:56:16,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {28397#true} assume !(ldv_set_add_~i~1#1 < ~last_index~0); {28397#true} is VALID [2022-02-20 21:56:16,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {28397#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; {28397#true} is VALID [2022-02-20 21:56:16,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {28397#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~2#1.base, ~skb~2#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,708 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28397#true} {28397#true} #1565#return; {28397#true} is VALID [2022-02-20 21:56:16,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {28397#true} ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset := ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset := ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {28397#true} #t~ret77#1.base, #t~ret77#1.offset := ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret77#1.base, #t~ret77#1.offset;havoc #t~ret77#1.base, #t~ret77#1.offset; {28397#true} is VALID [2022-02-20 21:56:16,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {28397#true} assume !(0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616); {28397#true} is VALID [2022-02-20 21:56:16,709 INFO L290 TraceCheckUtils]: 67: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,709 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {28397#true} {28398#false} #1661#return; {28398#false} is VALID [2022-02-20 21:56:16,709 INFO L290 TraceCheckUtils]: 69: Hoare triple {28398#false} assume { :end_inline_ppp_close } true;~ldv_state_variable_3~0 := 2; {28398#false} is VALID [2022-02-20 21:56:16,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {28398#false} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {28398#false} is VALID [2022-02-20 21:56:16,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {28398#false} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {28398#false} is VALID [2022-02-20 21:56:16,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {28398#false} assume main_#t~switch244#1; {28398#false} is VALID [2022-02-20 21:56:16,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {28398#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {28398#false} is VALID [2022-02-20 21:56:16,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {28398#false} assume !main_#t~switch246#1;main_#t~switch246#1 := main_#t~switch246#1 || 1 == main_~tmp___7~1#1; {28398#false} is VALID [2022-02-20 21:56:16,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {28398#false} assume main_#t~switch246#1; {28398#false} is VALID [2022-02-20 21:56:16,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {28398#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;assume { :begin_inline_skb_queue_head_init } true;skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset, skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset;skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset := skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset;call skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset := #Ultimate.allocOnStack(8); {28398#false} is VALID [2022-02-20 21:56:16,711 INFO L272 TraceCheckUtils]: 77: Hoare triple {28398#false} call skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset := spinlock_check(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset); {28397#true} is VALID [2022-02-20 21:56:16,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {28397#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {28397#true} is VALID [2022-02-20 21:56:16,711 INFO L290 TraceCheckUtils]: 79: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,711 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28397#true} {28398#false} #1613#return; {28398#false} is VALID [2022-02-20 21:56:16,711 INFO L290 TraceCheckUtils]: 81: Hoare triple {28398#false} havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,712 INFO L272 TraceCheckUtils]: 82: Hoare triple {28398#false} call __raw_spin_lock_init(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset, 3, 0, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset); {28397#true} is VALID [2022-02-20 21:56:16,712 INFO L290 TraceCheckUtils]: 83: Hoare triple {28397#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {28397#true} is VALID [2022-02-20 21:56:16,712 INFO L290 TraceCheckUtils]: 84: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,712 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {28397#true} {28398#false} #1615#return; {28398#false} is VALID [2022-02-20 21:56:16,712 INFO L290 TraceCheckUtils]: 86: Hoare triple {28398#false} assume { :begin_inline___skb_queue_head_init } true;__skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset := skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset;havoc __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset := __skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset;havoc __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset := __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset;call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, 8);call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, 8 + __skb_queue_head_init_~list#1.offset, 8);call write~int(0, __skb_queue_head_init_~list#1.base, 16 + __skb_queue_head_init_~list#1.offset, 4); {28398#false} is VALID [2022-02-20 21:56:16,712 INFO L290 TraceCheckUtils]: 87: Hoare triple {28398#false} assume { :end_inline___skb_queue_head_init } true;call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,713 INFO L290 TraceCheckUtils]: 88: Hoare triple {28398#false} assume { :end_inline_skb_queue_head_init } true;assume { :begin_inline_register_hdlc_protocol } true;register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset;register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset := register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,713 INFO L290 TraceCheckUtils]: 89: Hoare triple {28398#false} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {28398#false} is VALID [2022-02-20 21:56:16,713 INFO L290 TraceCheckUtils]: 90: Hoare triple {28398#false} main_#t~ret247#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret247#1 && main_#t~ret247#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret247#1;havoc main_#t~ret247#1; {28398#false} is VALID [2022-02-20 21:56:16,713 INFO L290 TraceCheckUtils]: 91: Hoare triple {28398#false} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_3 } true;havoc ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset, ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset, ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset;havoc ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,714 INFO L272 TraceCheckUtils]: 92: Hoare triple {28398#false} call ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset := ldv_zalloc(3264); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,714 INFO L290 TraceCheckUtils]: 94: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,714 INFO L290 TraceCheckUtils]: 95: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,714 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {28397#true} {28398#false} #1617#return; {28398#false} is VALID [2022-02-20 21:56:16,714 INFO L290 TraceCheckUtils]: 97: Hoare triple {28398#false} ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset := ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset;havoc ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,715 INFO L272 TraceCheckUtils]: 98: Hoare triple {28398#false} call ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset := ldv_zalloc(232); {28456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,715 INFO L290 TraceCheckUtils]: 99: Hoare triple {28456#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {28397#true} is VALID [2022-02-20 21:56:16,715 INFO L290 TraceCheckUtils]: 100: Hoare triple {28397#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {28397#true} is VALID [2022-02-20 21:56:16,715 INFO L290 TraceCheckUtils]: 101: Hoare triple {28397#true} assume true; {28397#true} is VALID [2022-02-20 21:56:16,715 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {28397#true} {28398#false} #1619#return; {28398#false} is VALID [2022-02-20 21:56:16,715 INFO L290 TraceCheckUtils]: 103: Hoare triple {28398#false} ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset;havoc ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,715 INFO L290 TraceCheckUtils]: 104: Hoare triple {28398#false} assume { :end_inline_ldv_initialize_hdlc_proto_3 } true; {28398#false} is VALID [2022-02-20 21:56:16,716 INFO L290 TraceCheckUtils]: 105: Hoare triple {28398#false} assume !(0 != ~ldv_retval_0~0); {28398#false} is VALID [2022-02-20 21:56:16,716 INFO L290 TraceCheckUtils]: 106: Hoare triple {28398#false} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {28398#false} is VALID [2022-02-20 21:56:16,716 INFO L290 TraceCheckUtils]: 107: Hoare triple {28398#false} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {28398#false} is VALID [2022-02-20 21:56:16,716 INFO L290 TraceCheckUtils]: 108: Hoare triple {28398#false} assume main_#t~switch244#1; {28398#false} is VALID [2022-02-20 21:56:16,716 INFO L290 TraceCheckUtils]: 109: Hoare triple {28398#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {28398#false} is VALID [2022-02-20 21:56:16,716 INFO L290 TraceCheckUtils]: 110: Hoare triple {28398#false} assume main_#t~switch246#1; {28398#false} is VALID [2022-02-20 21:56:16,717 INFO L290 TraceCheckUtils]: 111: Hoare triple {28398#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_mod_exit } true;assume { :begin_inline_unregister_hdlc_protocol } true;unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset;unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset := unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset; {28398#false} is VALID [2022-02-20 21:56:16,717 INFO L290 TraceCheckUtils]: 112: Hoare triple {28398#false} assume { :end_inline_unregister_hdlc_protocol } true; {28398#false} is VALID [2022-02-20 21:56:16,717 INFO L290 TraceCheckUtils]: 113: Hoare triple {28398#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {28398#false} is VALID [2022-02-20 21:56:16,717 INFO L290 TraceCheckUtils]: 114: Hoare triple {28398#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret288#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {28398#false} is VALID [2022-02-20 21:56:16,717 INFO L290 TraceCheckUtils]: 115: Hoare triple {28398#false} ldv_check_final_state_#t~ret288#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret288#1 && ldv_check_final_state_#t~ret288#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret288#1;havoc ldv_check_final_state_#t~ret288#1; {28398#false} is VALID [2022-02-20 21:56:16,717 INFO L290 TraceCheckUtils]: 116: Hoare triple {28398#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {28398#false} is VALID [2022-02-20 21:56:16,718 INFO L272 TraceCheckUtils]: 117: Hoare triple {28398#false} call ldv_error(); {28398#false} is VALID [2022-02-20 21:56:16,718 INFO L290 TraceCheckUtils]: 118: Hoare triple {28398#false} assume !false; {28398#false} is VALID [2022-02-20 21:56:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-02-20 21:56:16,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:16,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971733426] [2022-02-20 21:56:16,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971733426] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:16,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:16,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:56:16,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683256027] [2022-02-20 21:56:16,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-02-20 21:56:16,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:16,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:16,819 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:56:16,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:56:16,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:56:16,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:56:16,822 INFO L87 Difference]: Start difference. First operand 2370 states and 3545 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:22,906 INFO L93 Difference]: Finished difference Result 4998 states and 7343 transitions. [2022-02-20 21:56:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:56:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-02-20 21:56:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2275 transitions. [2022-02-20 21:56:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2275 transitions. [2022-02-20 21:56:22,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 2275 transitions. [2022-02-20 21:56:24,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2275 edges. 2275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:25,031 INFO L225 Difference]: With dead ends: 4998 [2022-02-20 21:56:25,032 INFO L226 Difference]: Without dead ends: 2642 [2022-02-20 21:56:25,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:56:25,042 INFO L933 BasicCegarLoop]: 922 mSDtfsCounter, 689 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:25,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 2415 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 21:56:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2022-02-20 21:56:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2411. [2022-02-20 21:56:25,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:25,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2642 states. Second operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) [2022-02-20 21:56:25,139 INFO L74 IsIncluded]: Start isIncluded. First operand 2642 states. Second operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) [2022-02-20 21:56:25,143 INFO L87 Difference]: Start difference. First operand 2642 states. Second operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) [2022-02-20 21:56:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:25,379 INFO L93 Difference]: Finished difference Result 2642 states and 3813 transitions. [2022-02-20 21:56:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3813 transitions. [2022-02-20 21:56:25,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:25,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:25,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) Second operand 2642 states. [2022-02-20 21:56:25,397 INFO L87 Difference]: Start difference. First operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) Second operand 2642 states. [2022-02-20 21:56:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:25,699 INFO L93 Difference]: Finished difference Result 2642 states and 3813 transitions. [2022-02-20 21:56:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3813 transitions. [2022-02-20 21:56:25,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:25,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:25,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:25,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) [2022-02-20 21:56:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3441 transitions. [2022-02-20 21:56:26,071 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3441 transitions. Word has length 119 [2022-02-20 21:56:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:26,071 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 3441 transitions. [2022-02-20 21:56:26,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3441 transitions. [2022-02-20 21:56:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-20 21:56:26,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:26,080 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:26,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:56:26,080 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1893256586, now seen corresponding path program 2 times [2022-02-20 21:56:26,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:26,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534850478] [2022-02-20 21:56:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43816#true} #1583#return; {43816#true} is VALID [2022-02-20 21:56:26,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:56:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43816#true} #1585#return; {43816#true} is VALID [2022-02-20 21:56:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:56:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43816#true} #1587#return; {43816#true} is VALID [2022-02-20 21:56:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:56:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43816#true} #1589#return; {43816#true} is VALID [2022-02-20 21:56:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:56:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43816#true} #1591#return; {43816#true} is VALID [2022-02-20 21:56:26,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:56:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {43816#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {43816#true} is VALID [2022-02-20 21:56:26,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43816#true} {43816#true} #1613#return; {43816#true} is VALID [2022-02-20 21:56:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {43816#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {43816#true} is VALID [2022-02-20 21:56:26,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43816#true} {43816#true} #1615#return; {43816#true} is VALID [2022-02-20 21:56:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:56:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43844#(= ~ldv_state_variable_3~0 1)} #1617#return; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:56:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43844#(= ~ldv_state_variable_3~0 1)} #1619#return; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-20 21:56:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:26,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43816#true} {43816#true} #1519#return; {43816#true} is VALID [2022-02-20 21:56:26,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {43876#(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~2#1.base, ~skb~2#1.offset;havoc ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,314 INFO L272 TraceCheckUtils]: 1: Hoare triple {43816#true} call #t~ret284#1.base, #t~ret284#1.offset := ldv_zalloc(248); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,314 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {43816#true} {43816#true} #1519#return; {43816#true} is VALID [2022-02-20 21:56:26,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {43816#true} ~tmp___7~3#1.base, ~tmp___7~3#1.offset := #t~ret284#1.base, #t~ret284#1.offset;havoc #t~ret284#1.base, #t~ret284#1.offset;~skb~2#1.base, ~skb~2#1.offset := ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {43816#true} assume !(~skb~2#1.base == 0 && ~skb~2#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~2#1.base, ~skb~2#1.offset;havoc ldv_set_add_#t~mem279#1.base, ldv_set_add_#t~mem279#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~1#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~1#1;ldv_set_add_~i~1#1 := 0; {43816#true} is VALID [2022-02-20 21:56:26,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {43816#true} assume !false; {43816#true} is VALID [2022-02-20 21:56:26,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {43816#true} assume !(ldv_set_add_~i~1#1 < ~last_index~0); {43816#true} is VALID [2022-02-20 21:56:26,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {43816#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; {43816#true} is VALID [2022-02-20 21:56:26,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {43816#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~2#1.base, ~skb~2#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,316 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {43816#true} {43816#true} #1565#return; {43816#true} is VALID [2022-02-20 21:56:26,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {43876#(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~0#1.base, ~skb~0#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume { :begin_inline_ldv_skb_dequeue_12 } true;ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset, ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset, ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset;ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset := ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,317 INFO L272 TraceCheckUtils]: 2: Hoare triple {43816#true} call ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset := ldv_skb_alloc(); {43876#(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:56:26,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {43876#(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~2#1.base, ~skb~2#1.offset;havoc ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {43816#true} call #t~ret284#1.base, #t~ret284#1.offset := ldv_zalloc(248); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,318 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {43816#true} {43816#true} #1519#return; {43816#true} is VALID [2022-02-20 21:56:26,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {43816#true} ~tmp___7~3#1.base, ~tmp___7~3#1.offset := #t~ret284#1.base, #t~ret284#1.offset;havoc #t~ret284#1.base, #t~ret284#1.offset;~skb~2#1.base, ~skb~2#1.offset := ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {43816#true} assume !(~skb~2#1.base == 0 && ~skb~2#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~2#1.base, ~skb~2#1.offset;havoc ldv_set_add_#t~mem279#1.base, ldv_set_add_#t~mem279#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~1#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~1#1;ldv_set_add_~i~1#1 := 0; {43816#true} is VALID [2022-02-20 21:56:26,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {43816#true} assume !false; {43816#true} is VALID [2022-02-20 21:56:26,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {43816#true} assume !(ldv_set_add_~i~1#1 < ~last_index~0); {43816#true} is VALID [2022-02-20 21:56:26,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {43816#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; {43816#true} is VALID [2022-02-20 21:56:26,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {43816#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~2#1.base, ~skb~2#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,319 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43816#true} {43816#true} #1565#return; {43816#true} is VALID [2022-02-20 21:56:26,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {43816#true} ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset := ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset := ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {43816#true} #t~ret77#1.base, #t~ret77#1.offset := ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret77#1.base, #t~ret77#1.offset;havoc #t~ret77#1.base, #t~ret77#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {43816#true} assume !(0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616); {43816#true} is VALID [2022-02-20 21:56:26,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,320 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43816#true} {43817#false} #1661#return; {43817#false} is VALID [2022-02-20 21:56:26,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {43816#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(103, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(4, 4);call write~init~int(76, 4, 0, 1);call write~init~int(67, 4, 1, 1);call write~init~int(80, 4, 2, 1);call write~init~int(0, 4, 3, 1);call #Ultimate.allocInit(5, 5);call write~init~int(73, 5, 0, 1);call write~init~int(80, 5, 1, 1);call write~init~int(67, 5, 2, 1);call write~init~int(80, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(7, 6);call write~init~int(73, 6, 0, 1);call write~init~int(80, 6, 1, 1);call write~init~int(86, 6, 2, 1);call write~init~int(54, 6, 3, 1);call write~init~int(67, 6, 4, 1);call write~init~int(80, 6, 5, 1);call write~init~int(0, 6, 6, 1);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(7, 8);call write~init~int(37, 8, 0, 1);call write~init~int(115, 8, 1, 1);call write~init~int(32, 8, 2, 1);call write~init~int(117, 8, 3, 1);call write~init~int(112, 8, 4, 1);call write~init~int(10, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(21, 11);~LDV_IN_INTERRUPT~0 := 1;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#tx_queue~0.base, ~#tx_queue~0.offset := 12, 0;call #Ultimate.allocInit(88, 12);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 8 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 16 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 20 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 24 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 28 + ~#tx_queue~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 32 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 40 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 48 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 56 + ~#tx_queue~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tx_queue~0.base, 64 + ~#tx_queue~0.offset, 8);call write~init~int(0, ~#tx_queue~0.base, 72 + ~#tx_queue~0.offset, 4);call write~init~int(0, ~#tx_queue~0.base, 76 + ~#tx_queue~0.offset, 8);~#cp_table~0.base, ~#cp_table~0.offset := 13, 0;call #Ultimate.allocInit(364, 13);call write~init~int(163, ~#cp_table~0.base, ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 4 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 8 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 12 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 16 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 20 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 24 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 28 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 32 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 36 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 40 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 44 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 48 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 52 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 56 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 60 + ~#cp_table~0.offset, 4);call write~init~int(1026, ~#cp_table~0.base, 64 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 68 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 72 + ~#cp_table~0.offset, 4);call write~init~int(133, ~#cp_table~0.base, 76 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 80 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 84 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 88 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 92 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 96 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 100 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 104 + ~#cp_table~0.offset, 4);call write~init~int(16, ~#cp_table~0.base, 108 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 112 + ~#cp_table~0.offset, 4);call write~init~int(421, ~#cp_table~0.base, 116 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 120 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 124 + ~#cp_table~0.offset, 4);call write~init~int(262, ~#cp_table~0.base, 128 + ~#cp_table~0.offset, 4);call write~init~int(261, ~#cp_table~0.base, 132 + ~#cp_table~0.offset, 4);call write~init~int(389, ~#cp_table~0.base, 136 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 140 + ~#cp_table~0.offset, 4);call write~init~int(675, ~#cp_table~0.base, 144 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 148 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 152 + ~#cp_table~0.offset, 4);call write~init~int(516, ~#cp_table~0.base, 156 + ~#cp_table~0.offset, 4);call write~init~int(515, ~#cp_table~0.base, 160 + ~#cp_table~0.offset, 4);call write~init~int(643, ~#cp_table~0.base, 164 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 168 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 172 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 176 + ~#cp_table~0.offset, 4);call write~init~int(36, ~#cp_table~0.base, 180 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 184 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 188 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 192 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 196 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 200 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 204 + ~#cp_table~0.offset, 4);call write~init~int(163, ~#cp_table~0.base, 208 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 212 + ~#cp_table~0.offset, 4);call write~init~int(165, ~#cp_table~0.base, 216 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 220 + ~#cp_table~0.offset, 4);call write~init~int(2048, ~#cp_table~0.base, 224 + ~#cp_table~0.offset, 4);call write~init~int(2049, ~#cp_table~0.base, 228 + ~#cp_table~0.offset, 4);call write~init~int(2050, ~#cp_table~0.base, 232 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 236 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 240 + ~#cp_table~0.offset, 4);call write~init~int(2051, ~#cp_table~0.base, 244 + ~#cp_table~0.offset, 4);call write~init~int(2114, ~#cp_table~0.base, 248 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 252 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 256 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 260 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 264 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 268 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 272 + ~#cp_table~0.offset, 4);call write~init~int(131, ~#cp_table~0.base, 276 + ~#cp_table~0.offset, 4);call write~init~int(4096, ~#cp_table~0.base, 280 + ~#cp_table~0.offset, 4);call write~init~int(4097, ~#cp_table~0.base, 284 + ~#cp_table~0.offset, 4);call write~init~int(4098, ~#cp_table~0.base, 288 + ~#cp_table~0.offset, 4);call write~init~int(4099, ~#cp_table~0.base, 292 + ~#cp_table~0.offset, 4);call write~init~int(4100, ~#cp_table~0.base, 296 + ~#cp_table~0.offset, 4);call write~init~int(4101, ~#cp_table~0.base, 300 + ~#cp_table~0.offset, 4);call write~init~int(4102, ~#cp_table~0.base, 304 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 308 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 312 + ~#cp_table~0.offset, 4);call write~init~int(2, ~#cp_table~0.base, 316 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 320 + ~#cp_table~0.offset, 4);call write~init~int(3, ~#cp_table~0.base, 324 + ~#cp_table~0.offset, 4);call write~init~int(5, ~#cp_table~0.base, 328 + ~#cp_table~0.offset, 4);call write~init~int(6, ~#cp_table~0.base, 332 + ~#cp_table~0.offset, 4);call write~init~int(0, ~#cp_table~0.base, 336 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 340 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 344 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 348 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 352 + ~#cp_table~0.offset, 4);call write~init~int(1, ~#cp_table~0.base, 356 + ~#cp_table~0.offset, 4);call write~init~int(1058, ~#cp_table~0.base, 360 + ~#cp_table~0.offset, 4);~#proto~0.base, ~#proto~0.offset := 14, 0;call #Ultimate.allocInit(88, 14);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_close.base, #funAddr~ppp_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_start.base, #funAddr~ppp_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_stop.base, #funAddr~ppp_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_ioctl.base, #funAddr~ppp_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_type_trans.base, #funAddr~ppp_type_trans.offset, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_rx.base, #funAddr~ppp_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset := 15, 0;call #Ultimate.allocInit(40, 15);call write~init~$Pointer$(#funAddr~ppp_hard_header.base, #funAddr~ppp_hard_header.offset, ~#ppp_header_ops~0.base, ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 8 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 16 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 24 + ~#ppp_header_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_header_ops~0.base, 32 + ~#ppp_header_ops~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {43816#true} is VALID [2022-02-20 21:56:26,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {43816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset, main_#t~nondet237#1, main_#t~nondet238#1, main_#t~ret239#1.base, main_#t~ret239#1.offset, main_#t~ret240#1.base, main_#t~ret240#1.offset, main_#t~ret241#1.base, main_#t~ret241#1.offset, main_#t~ret242#1.base, main_#t~ret242#1.offset, main_#t~nondet243#1, main_#t~switch244#1, main_#t~nondet245#1, main_#t~switch246#1, main_#t~ret247#1, main_#t~nondet248#1, main_#t~switch249#1, main_#t~ret250#1, main_#t~ret251#1, main_#t~ret252#1, main_#t~ret253#1, main_#t~ret254#1, main_#t~ret255#1, main_#t~ret256#1, main_#t~ret257#1, main_#t~ret258#1, main_#t~ret259#1, main_#t~ret260#1, main_#t~ret261#1, main_#t~ret262#1, main_#t~ret263#1, main_#t~ret264#1, main_#t~ret265#1, main_#t~ret266#1, main_#t~ret267#1, main_#t~ret268#1, main_#t~ret269#1, main_#t~ret270#1, main_#t~nondet271#1, main_#t~switch272#1, main_#t~ret273#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~19#1.base, main_~tmp~19#1.offset, main_~ldvarg1~0#1, main_~tmp___0~9#1, main_~ldvarg4~0#1, main_~tmp___1~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~tmp___6~1#1, main_~tmp___7~1#1, main_~tmp___8~0#1, main_~tmp___9~0#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~19#1.base, main_~tmp~19#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___0~9#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___1~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~tmp___6~1#1;havoc main_~tmp___7~1#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {43816#true} is VALID [2022-02-20 21:56:26,321 INFO L272 TraceCheckUtils]: 2: Hoare triple {43816#true} call main_#t~ret236#1.base, main_#t~ret236#1.offset := ldv_zalloc(40); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,322 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {43816#true} {43816#true} #1583#return; {43816#true} is VALID [2022-02-20 21:56:26,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {43816#true} main_~tmp~19#1.base, main_~tmp~19#1.offset := main_#t~ret236#1.base, main_#t~ret236#1.offset;havoc main_#t~ret236#1.base, main_#t~ret236#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~19#1.base, main_~tmp~19#1.offset;main_~tmp___0~9#1 := main_#t~nondet237#1;havoc main_#t~nondet237#1;main_~ldvarg1~0#1 := main_~tmp___0~9#1;main_~tmp___1~3#1 := main_#t~nondet238#1;havoc main_#t~nondet238#1;main_~ldvarg4~0#1 := main_~tmp___1~3#1; {43816#true} is VALID [2022-02-20 21:56:26,323 INFO L272 TraceCheckUtils]: 8: Hoare triple {43816#true} call main_#t~ret239#1.base, main_#t~ret239#1.offset := ldv_zalloc(232); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,323 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {43816#true} {43816#true} #1585#return; {43816#true} is VALID [2022-02-20 21:56:26,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {43816#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret239#1.base, main_#t~ret239#1.offset;havoc main_#t~ret239#1.base, main_#t~ret239#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,325 INFO L272 TraceCheckUtils]: 14: Hoare triple {43816#true} call main_#t~ret240#1.base, main_#t~ret240#1.offset := ldv_zalloc(3264); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,326 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {43816#true} {43816#true} #1587#return; {43816#true} is VALID [2022-02-20 21:56:26,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {43816#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret240#1.base, main_#t~ret240#1.offset;havoc main_#t~ret240#1.base, main_#t~ret240#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,326 INFO L272 TraceCheckUtils]: 20: Hoare triple {43816#true} call main_#t~ret241#1.base, main_#t~ret241#1.offset := ldv_zalloc(1); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,327 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {43816#true} {43816#true} #1589#return; {43816#true} is VALID [2022-02-20 21:56:26,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {43816#true} main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset := main_#t~ret241#1.base, main_#t~ret241#1.offset;havoc main_#t~ret241#1.base, main_#t~ret241#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___4~3#1.base, main_~tmp___4~3#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,327 INFO L272 TraceCheckUtils]: 26: Hoare triple {43816#true} call main_#t~ret242#1.base, main_#t~ret242#1.offset := ldv_zalloc(1); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,328 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43816#true} {43816#true} #1591#return; {43816#true} is VALID [2022-02-20 21:56:26,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {43816#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret242#1.base, main_#t~ret242#1.offset;havoc main_#t~ret242#1.base, main_#t~ret242#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {43816#true} is VALID [2022-02-20 21:56:26,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {43816#true} assume { :end_inline_ldv_set_init } true; {43816#true} is VALID [2022-02-20 21:56:26,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {43816#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {43816#true} is VALID [2022-02-20 21:56:26,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {43816#true} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {43816#true} is VALID [2022-02-20 21:56:26,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {43816#true} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {43816#true} is VALID [2022-02-20 21:56:26,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {43816#true} assume main_#t~switch244#1; {43816#true} is VALID [2022-02-20 21:56:26,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {43816#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {43816#true} is VALID [2022-02-20 21:56:26,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {43816#true} assume !main_#t~switch246#1;main_#t~switch246#1 := main_#t~switch246#1 || 1 == main_~tmp___7~1#1; {43816#true} is VALID [2022-02-20 21:56:26,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {43816#true} assume main_#t~switch246#1; {43816#true} is VALID [2022-02-20 21:56:26,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {43816#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;assume { :begin_inline_skb_queue_head_init } true;skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset, skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset;skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset := skb_queue_head_init_#in~list#1.base, skb_queue_head_init_#in~list#1.offset;call skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset := #Ultimate.allocOnStack(8); {43816#true} is VALID [2022-02-20 21:56:26,330 INFO L272 TraceCheckUtils]: 41: Hoare triple {43816#true} call skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset := spinlock_check(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset); {43816#true} is VALID [2022-02-20 21:56:26,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {43816#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;#res.base, #res.offset := ~lock.base, ~lock.offset; {43816#true} is VALID [2022-02-20 21:56:26,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,330 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {43816#true} {43816#true} #1613#return; {43816#true} is VALID [2022-02-20 21:56:26,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {43816#true} havoc skb_queue_head_init_#t~ret22#1.base, skb_queue_head_init_#t~ret22#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,330 INFO L272 TraceCheckUtils]: 46: Hoare triple {43816#true} call __raw_spin_lock_init(skb_queue_head_init_~list#1.base, 20 + skb_queue_head_init_~list#1.offset, 3, 0, skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset); {43816#true} is VALID [2022-02-20 21:56:26,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {43816#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {43816#true} is VALID [2022-02-20 21:56:26,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,331 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {43816#true} {43816#true} #1615#return; {43816#true} is VALID [2022-02-20 21:56:26,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {43816#true} assume { :begin_inline___skb_queue_head_init } true;__skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset := skb_queue_head_init_~list#1.base, skb_queue_head_init_~list#1.offset;havoc __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset := __skb_queue_head_init_#in~list#1.base, __skb_queue_head_init_#in~list#1.offset;havoc __skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset;__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset := __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset;call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, __skb_queue_head_init_~list#1.offset, 8);call write~$Pointer$(__skb_queue_head_init_~tmp~0#1.base, __skb_queue_head_init_~tmp~0#1.offset, __skb_queue_head_init_~list#1.base, 8 + __skb_queue_head_init_~list#1.offset, 8);call write~int(0, __skb_queue_head_init_~list#1.base, 16 + __skb_queue_head_init_~list#1.offset, 4); {43816#true} is VALID [2022-02-20 21:56:26,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {43816#true} assume { :end_inline___skb_queue_head_init } true;call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {43816#true} assume { :end_inline_skb_queue_head_init } true;assume { :begin_inline_register_hdlc_protocol } true;register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset;register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset := register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {43816#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {43816#true} is VALID [2022-02-20 21:56:26,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {43816#true} main_#t~ret247#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret247#1 && main_#t~ret247#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret247#1;havoc main_#t~ret247#1; {43816#true} is VALID [2022-02-20 21:56:26,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {43816#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_3 } true;havoc ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset, ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset, ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset;havoc ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,332 INFO L272 TraceCheckUtils]: 56: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} call ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset := ldv_zalloc(3264); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,333 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {43816#true} {43844#(= ~ldv_state_variable_3~0 1)} #1617#return; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset := ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset;havoc ldv_initialize_hdlc_proto_3_#t~ret230#1.base, ldv_initialize_hdlc_proto_3_#t~ret230#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_3_~tmp~18#1.base, ldv_initialize_hdlc_proto_3_~tmp~18#1.offset; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,334 INFO L272 TraceCheckUtils]: 62: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} call ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset := ldv_zalloc(232); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,335 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {43816#true} {43844#(= ~ldv_state_variable_3~0 1)} #1619#return; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset;havoc ldv_initialize_hdlc_proto_3_#t~ret231#1.base, ldv_initialize_hdlc_proto_3_#t~ret231#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_3_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_3_~tmp___0~8#1.offset; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume { :end_inline_ldv_initialize_hdlc_proto_3 } true; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !(0 != ~ldv_retval_0~0); {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 2 == main_~tmp___6~1#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume main_#t~switch244#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,338 INFO L290 TraceCheckUtils]: 74: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet248#1 && main_#t~nondet248#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet248#1;havoc main_#t~nondet248#1;main_#t~switch249#1 := 0 == main_~tmp___8~0#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,338 INFO L290 TraceCheckUtils]: 75: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 1 == main_~tmp___8~0#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,339 INFO L290 TraceCheckUtils]: 76: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 2 == main_~tmp___8~0#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 3 == main_~tmp___8~0#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,339 INFO L290 TraceCheckUtils]: 78: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 4 == main_~tmp___8~0#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,340 INFO L290 TraceCheckUtils]: 79: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch249#1;main_#t~switch249#1 := main_#t~switch249#1 || 5 == main_~tmp___8~0#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,340 INFO L290 TraceCheckUtils]: 80: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume main_#t~switch249#1; {43844#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:56:26,340 INFO L290 TraceCheckUtils]: 81: Hoare triple {43844#(= ~ldv_state_variable_3~0 1)} assume 4 == ~ldv_state_variable_3~0;assume { :begin_inline_ppp_close } true;ppp_close_#in~dev#1.base, ppp_close_#in~dev#1.offset := ~proto_group1~0.base, ~proto_group1~0.offset;havoc ppp_close_~dev#1.base, ppp_close_~dev#1.offset;ppp_close_~dev#1.base, ppp_close_~dev#1.offset := ppp_close_#in~dev#1.base, ppp_close_#in~dev#1.offset; {43817#false} is VALID [2022-02-20 21:56:26,341 INFO L272 TraceCheckUtils]: 82: Hoare triple {43817#false} call ppp_tx_flush(); {43876#(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:56:26,341 INFO L290 TraceCheckUtils]: 83: Hoare triple {43876#(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~0#1.base, ~skb~0#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {43816#true} assume { :begin_inline_ldv_skb_dequeue_12 } true;ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset := ~#tx_queue~0.base, ~#tx_queue~0.offset;havoc ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset, ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset, ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset;ldv_skb_dequeue_12_~ldv_func_arg1#1.base, ldv_skb_dequeue_12_~ldv_func_arg1#1.offset := ldv_skb_dequeue_12_#in~ldv_func_arg1#1.base, ldv_skb_dequeue_12_#in~ldv_func_arg1#1.offset;havoc ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,341 INFO L272 TraceCheckUtils]: 85: Hoare triple {43816#true} call ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset := ldv_skb_alloc(); {43876#(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:56:26,342 INFO L290 TraceCheckUtils]: 86: Hoare triple {43876#(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~2#1.base, ~skb~2#1.offset;havoc ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,342 INFO L272 TraceCheckUtils]: 87: Hoare triple {43816#true} call #t~ret284#1.base, #t~ret284#1.offset := ldv_zalloc(248); {43875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:26,342 INFO L290 TraceCheckUtils]: 88: Hoare triple {43875#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet38#1 && #t~nondet38#1 <= 2147483647;~tmp___0~1#1 := #t~nondet38#1;havoc #t~nondet38#1; {43816#true} is VALID [2022-02-20 21:56:26,342 INFO L290 TraceCheckUtils]: 89: Hoare triple {43816#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {43816#true} is VALID [2022-02-20 21:56:26,343 INFO L290 TraceCheckUtils]: 90: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,343 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {43816#true} {43816#true} #1519#return; {43816#true} is VALID [2022-02-20 21:56:26,347 INFO L290 TraceCheckUtils]: 92: Hoare triple {43816#true} ~tmp___7~3#1.base, ~tmp___7~3#1.offset := #t~ret284#1.base, #t~ret284#1.offset;havoc #t~ret284#1.base, #t~ret284#1.offset;~skb~2#1.base, ~skb~2#1.offset := ~tmp___7~3#1.base, ~tmp___7~3#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,347 INFO L290 TraceCheckUtils]: 93: Hoare triple {43816#true} assume !(~skb~2#1.base == 0 && ~skb~2#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~2#1.base, ~skb~2#1.offset;havoc ldv_set_add_#t~mem279#1.base, ldv_set_add_#t~mem279#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~1#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~1#1;ldv_set_add_~i~1#1 := 0; {43816#true} is VALID [2022-02-20 21:56:26,347 INFO L290 TraceCheckUtils]: 94: Hoare triple {43816#true} assume !false; {43816#true} is VALID [2022-02-20 21:56:26,347 INFO L290 TraceCheckUtils]: 95: Hoare triple {43816#true} assume !(ldv_set_add_~i~1#1 < ~last_index~0); {43816#true} is VALID [2022-02-20 21:56:26,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {43816#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; {43816#true} is VALID [2022-02-20 21:56:26,348 INFO L290 TraceCheckUtils]: 97: Hoare triple {43816#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~2#1.base, ~skb~2#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,348 INFO L290 TraceCheckUtils]: 98: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,348 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {43816#true} {43816#true} #1565#return; {43816#true} is VALID [2022-02-20 21:56:26,348 INFO L290 TraceCheckUtils]: 100: Hoare triple {43816#true} ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset := ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;havoc ldv_skb_dequeue_12_#t~ret274#1.base, ldv_skb_dequeue_12_#t~ret274#1.offset;ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset := ldv_skb_dequeue_12_~tmp~20#1.base, ldv_skb_dequeue_12_~tmp~20#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,348 INFO L290 TraceCheckUtils]: 101: Hoare triple {43816#true} #t~ret77#1.base, #t~ret77#1.offset := ldv_skb_dequeue_12_#res#1.base, ldv_skb_dequeue_12_#res#1.offset;assume { :end_inline_ldv_skb_dequeue_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret77#1.base, #t~ret77#1.offset;havoc #t~ret77#1.base, #t~ret77#1.offset; {43816#true} is VALID [2022-02-20 21:56:26,348 INFO L290 TraceCheckUtils]: 102: Hoare triple {43816#true} assume !(0 != (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616); {43816#true} is VALID [2022-02-20 21:56:26,349 INFO L290 TraceCheckUtils]: 103: Hoare triple {43816#true} assume true; {43816#true} is VALID [2022-02-20 21:56:26,349 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {43816#true} {43817#false} #1661#return; {43817#false} is VALID [2022-02-20 21:56:26,349 INFO L290 TraceCheckUtils]: 105: Hoare triple {43817#false} assume { :end_inline_ppp_close } true;~ldv_state_variable_3~0 := 2; {43817#false} is VALID [2022-02-20 21:56:26,349 INFO L290 TraceCheckUtils]: 106: Hoare triple {43817#false} assume -2147483648 <= main_#t~nondet243#1 && main_#t~nondet243#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet243#1;havoc main_#t~nondet243#1;main_#t~switch244#1 := 0 == main_~tmp___6~1#1; {43817#false} is VALID [2022-02-20 21:56:26,349 INFO L290 TraceCheckUtils]: 107: Hoare triple {43817#false} assume !main_#t~switch244#1;main_#t~switch244#1 := main_#t~switch244#1 || 1 == main_~tmp___6~1#1; {43817#false} is VALID [2022-02-20 21:56:26,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {43817#false} assume main_#t~switch244#1; {43817#false} is VALID [2022-02-20 21:56:26,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {43817#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet245#1 && main_#t~nondet245#1 <= 2147483647;main_~tmp___7~1#1 := main_#t~nondet245#1;havoc main_#t~nondet245#1;main_#t~switch246#1 := 0 == main_~tmp___7~1#1; {43817#false} is VALID [2022-02-20 21:56:26,350 INFO L290 TraceCheckUtils]: 110: Hoare triple {43817#false} assume main_#t~switch246#1; {43817#false} is VALID [2022-02-20 21:56:26,350 INFO L290 TraceCheckUtils]: 111: Hoare triple {43817#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_mod_exit } true;assume { :begin_inline_unregister_hdlc_protocol } true;unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset;unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset := unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset; {43817#false} is VALID [2022-02-20 21:56:26,350 INFO L290 TraceCheckUtils]: 112: Hoare triple {43817#false} assume { :end_inline_unregister_hdlc_protocol } true; {43817#false} is VALID [2022-02-20 21:56:26,350 INFO L290 TraceCheckUtils]: 113: Hoare triple {43817#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {43817#false} is VALID [2022-02-20 21:56:26,350 INFO L290 TraceCheckUtils]: 114: Hoare triple {43817#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret288#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {43817#false} is VALID [2022-02-20 21:56:26,350 INFO L290 TraceCheckUtils]: 115: Hoare triple {43817#false} ldv_check_final_state_#t~ret288#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret288#1 && ldv_check_final_state_#t~ret288#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret288#1;havoc ldv_check_final_state_#t~ret288#1; {43817#false} is VALID [2022-02-20 21:56:26,350 INFO L290 TraceCheckUtils]: 116: Hoare triple {43817#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {43817#false} is VALID [2022-02-20 21:56:26,351 INFO L272 TraceCheckUtils]: 117: Hoare triple {43817#false} call ldv_error(); {43817#false} is VALID [2022-02-20 21:56:26,351 INFO L290 TraceCheckUtils]: 118: Hoare triple {43817#false} assume !false; {43817#false} is VALID [2022-02-20 21:56:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 21:56:26,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:26,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534850478] [2022-02-20 21:56:26,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534850478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:26,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:26,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:56:26,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612379346] [2022-02-20 21:56:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2022-02-20 21:56:26,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:26,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 21:56:26,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:26,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:56:26,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:56:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:56:26,427 INFO L87 Difference]: Start difference. First operand 2411 states and 3441 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 21:56:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:32,872 INFO L93 Difference]: Finished difference Result 5630 states and 8219 transitions. [2022-02-20 21:56:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:56:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2022-02-20 21:56:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 21:56:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2716 transitions. [2022-02-20 21:56:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 21:56:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2716 transitions. [2022-02-20 21:56:32,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 2716 transitions. [2022-02-20 21:56:35,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2716 edges. 2716 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:35,651 INFO L225 Difference]: With dead ends: 5630 [2022-02-20 21:56:35,651 INFO L226 Difference]: Without dead ends: 3820 [2022-02-20 21:56:35,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:56:35,659 INFO L933 BasicCegarLoop]: 1241 mSDtfsCounter, 1272 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:35,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 2480 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 21:56:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2022-02-20 21:56:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3462. [2022-02-20 21:56:35,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:35,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3820 states. Second operand has 3462 states, 2581 states have (on average 1.3684618364974817) internal successors, (3532), 2681 states have internal predecessors, (3532), 640 states have call successors, (640), 223 states have call predecessors, (640), 240 states have return successors, (793), 617 states have call predecessors, (793), 639 states have call successors, (793) [2022-02-20 21:56:35,797 INFO L74 IsIncluded]: Start isIncluded. First operand 3820 states. Second operand has 3462 states, 2581 states have (on average 1.3684618364974817) internal successors, (3532), 2681 states have internal predecessors, (3532), 640 states have call successors, (640), 223 states have call predecessors, (640), 240 states have return successors, (793), 617 states have call predecessors, (793), 639 states have call successors, (793) [2022-02-20 21:56:35,802 INFO L87 Difference]: Start difference. First operand 3820 states. Second operand has 3462 states, 2581 states have (on average 1.3684618364974817) internal successors, (3532), 2681 states have internal predecessors, (3532), 640 states have call successors, (640), 223 states have call predecessors, (640), 240 states have return successors, (793), 617 states have call predecessors, (793), 639 states have call successors, (793) [2022-02-20 21:56:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:36,314 INFO L93 Difference]: Finished difference Result 3820 states and 5551 transitions. [2022-02-20 21:56:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 5551 transitions. [2022-02-20 21:56:36,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:36,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:36,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 3462 states, 2581 states have (on average 1.3684618364974817) internal successors, (3532), 2681 states have internal predecessors, (3532), 640 states have call successors, (640), 223 states have call predecessors, (640), 240 states have return successors, (793), 617 states have call predecessors, (793), 639 states have call successors, (793) Second operand 3820 states. [2022-02-20 21:56:36,343 INFO L87 Difference]: Start difference. First operand has 3462 states, 2581 states have (on average 1.3684618364974817) internal successors, (3532), 2681 states have internal predecessors, (3532), 640 states have call successors, (640), 223 states have call predecessors, (640), 240 states have return successors, (793), 617 states have call predecessors, (793), 639 states have call successors, (793) Second operand 3820 states.