./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_x25.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_x25.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 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:55:40,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:55:40,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:55:40,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:55:40,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:55:40,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:55:40,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:55:40,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:55:40,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:55:40,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:55:40,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:55:40,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:55:40,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:55:40,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:55:40,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:55:40,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:55:40,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:55:40,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:55:40,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:55:40,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:55:40,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:55:40,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:55:40,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:55:40,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:55:40,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:55:40,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:55:40,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:55:40,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:55:40,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:55:40,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:55:40,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:55:40,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:55:40,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:55:40,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:55:40,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:55:40,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:55:40,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:55:40,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:55:40,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:55:40,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:55:40,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:55:40,991 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,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:55:41,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:55:41,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:55:41,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:55:41,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:55:41,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:55:41,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:55:41,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:55:41,013 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:55:41,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:55:41,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:55:41,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:55:41,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:55:41,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:55:41,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:55:41,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:55:41,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:55:41,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:55:41,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:55:41,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:55:41,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:55:41,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:41,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:55:41,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:55:41,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:55:41,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:55:41,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:55:41,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:55:41,016 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:55:41,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:55:41,017 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 -> 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c [2022-02-20 21:55:41,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:55:41,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:55:41,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:55:41,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:55:41,241 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:55:41,242 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_x25.ko-entry_point.cil.out.i [2022-02-20 21:55:41,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f2dd25b/e9b8f043d44b435dabce2488bbf785c3/FLAG8fc5ffdb6 [2022-02-20 21:55:41,719 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:55:41,719 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_x25.ko-entry_point.cil.out.i [2022-02-20 21:55:41,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f2dd25b/e9b8f043d44b435dabce2488bbf785c3/FLAG8fc5ffdb6 [2022-02-20 21:55:42,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f2dd25b/e9b8f043d44b435dabce2488bbf785c3 [2022-02-20 21:55:42,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:55:42,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:55:42,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:42,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:55:42,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:55:42,028 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,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d25cb0 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,029 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,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:55:42,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:55:42,474 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_x25.ko-entry_point.cil.out.i[152690,152703] [2022-02-20 21:55:42,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:42,684 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:55:42,795 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_x25.ko-entry_point.cil.out.i[152690,152703] [2022-02-20 21:55:42,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:42,871 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:55:42,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:42 WrapperNode [2022-02-20 21:55:42,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:42,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:42,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:55:42,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:55:42,879 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:42" (1/1) ... [2022-02-20 21:55:42,909 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:42" (1/1) ... [2022-02-20 21:55:42,952 INFO L137 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2022-02-20 21:55:42,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:42,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:55:42,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:55:42,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:55:42,973 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:42" (1/1) ... [2022-02-20 21:55:42,973 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:42" (1/1) ... [2022-02-20 21:55:42,977 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:42" (1/1) ... [2022-02-20 21:55:42,978 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:42" (1/1) ... [2022-02-20 21:55:43,009 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:42" (1/1) ... [2022-02-20 21:55:43,013 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:42" (1/1) ... [2022-02-20 21:55:43,033 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:42" (1/1) ... [2022-02-20 21:55:43,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:55:43,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:55:43,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:55:43,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:55:43,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:42" (1/1) ... [2022-02-20 21:55:43,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:43,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:55:43,090 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:43,120 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:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:55:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:55:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:55:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 21:55:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 21:55:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-02-20 21:55:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-02-20 21:55:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:55:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:55:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:55:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:55:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:55:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:55:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:55:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:55:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:55:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-02-20 21:55:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-02-20 21:55:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-02-20 21:55:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-02-20 21:55:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:55:43,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:55:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-02-20 21:55:43,143 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-02-20 21:55:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:55:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-02-20 21:55:43,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-02-20 21:55:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:55:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-02-20 21:55:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-02-20 21:55:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-02-20 21:55:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-02-20 21:55:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:55:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:55:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:55:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:55:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:55:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:55:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:55:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-02-20 21:55:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-02-20 21:55:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-02-20 21:55:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-02-20 21:55:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:55:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:55:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:55:43,396 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:55:43,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:55:43,677 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:55:44,005 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:55:44,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:55:44,016 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:55:44,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:44 BoogieIcfgContainer [2022-02-20 21:55:44,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:55:44,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:55:44,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:55:44,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:55:44,023 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:44,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786d44e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:44, skipping insertion in model container [2022-02-20 21:55:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:42" (2/3) ... [2022-02-20 21:55:44,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786d44e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:44, skipping insertion in model container [2022-02-20 21:55:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:44" (3/3) ... [2022-02-20 21:55:44,026 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2022-02-20 21:55:44,030 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:55:44,030 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:55:44,070 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:55:44,077 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:44,077 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:55:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 21:55:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 21:55:44,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:44,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:44,100 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:44,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2022-02-20 21:55:44,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:44,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655857557] [2022-02-20 21:55:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:44,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {240#true} is VALID [2022-02-20 21:55:44,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #597#return; {240#true} is VALID [2022-02-20 21:55:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:44,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-02-20 21:55:44,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume !(0 == ~cond); {240#true} is VALID [2022-02-20 21:55:44,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #599#return; {240#true} is VALID [2022-02-20 21:55:44,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {240#true} is VALID [2022-02-20 21:55:44,416 INFO L272 TraceCheckUtils]: 1: Hoare triple {240#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {265#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:44,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {240#true} is VALID [2022-02-20 21:55:44,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,416 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {240#true} {240#true} #597#return; {240#true} is VALID [2022-02-20 21:55:44,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {240#true} is VALID [2022-02-20 21:55:44,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {240#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {240#true} is VALID [2022-02-20 21:55:44,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-02-20 21:55:44,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} assume !(0 == ~cond); {240#true} is VALID [2022-02-20 21:55:44,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {240#true} {240#true} #599#return; {240#true} is VALID [2022-02-20 21:55:44,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {240#true} is VALID [2022-02-20 21:55:44,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,418 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {240#true} {240#true} #623#return; {240#true} is VALID [2022-02-20 21:55:44,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {240#true} is VALID [2022-02-20 21:55:44,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {240#true} is VALID [2022-02-20 21:55:44,424 INFO L272 TraceCheckUtils]: 2: Hoare triple {240#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {257#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:44,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {257#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {240#true} is VALID [2022-02-20 21:55:44,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {265#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:44,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {265#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {240#true} is VALID [2022-02-20 21:55:44,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,427 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {240#true} {240#true} #597#return; {240#true} is VALID [2022-02-20 21:55:44,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {240#true} is VALID [2022-02-20 21:55:44,427 INFO L272 TraceCheckUtils]: 9: Hoare triple {240#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {240#true} is VALID [2022-02-20 21:55:44,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-02-20 21:55:44,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} assume !(0 == ~cond); {240#true} is VALID [2022-02-20 21:55:44,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,429 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {240#true} {240#true} #599#return; {240#true} is VALID [2022-02-20 21:55:44,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {240#true} is VALID [2022-02-20 21:55:44,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:55:44,430 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {240#true} {240#true} #623#return; {240#true} is VALID [2022-02-20 21:55:44,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {240#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {240#true} is VALID [2022-02-20 21:55:44,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {240#true} assume { :end_inline_ldv_set_init } true; {240#true} is VALID [2022-02-20 21:55:44,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {240#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {256#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:44,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {256#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {256#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:44,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {256#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {256#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:44,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {256#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch119#1; {256#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:44,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {256#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {256#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:44,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {256#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch130#1; {256#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:44,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {256#(= ~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; {241#false} is VALID [2022-02-20 21:55:44,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {241#false} assume { :end_inline_unregister_hdlc_protocol } true; {241#false} is VALID [2022-02-20 21:55:44,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {241#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {241#false} is VALID [2022-02-20 21:55:44,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {241#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {241#false} is VALID [2022-02-20 21:55:44,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {241#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {241#false} is VALID [2022-02-20 21:55:44,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {241#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {241#false} is VALID [2022-02-20 21:55:44,439 INFO L272 TraceCheckUtils]: 31: Hoare triple {241#false} call ldv_error(); {241#false} is VALID [2022-02-20 21:55:44,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-02-20 21:55:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:55:44,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:44,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655857557] [2022-02-20 21:55:44,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655857557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:44,441 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:44,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:55:44,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76609698] [2022-02-20 21:55:44,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:44,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 21:55:44,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:44,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:44,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:44,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:55:44,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:55:44,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:55:44,512 INFO L87 Difference]: Start difference. First operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:46,315 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2022-02-20 21:55:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:55:46,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 21:55:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1141 transitions. [2022-02-20 21:55:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1141 transitions. [2022-02-20 21:55:46,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1141 transitions. [2022-02-20 21:55:47,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1141 edges. 1141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:47,297 INFO L225 Difference]: With dead ends: 786 [2022-02-20 21:55:47,297 INFO L226 Difference]: Without dead ends: 540 [2022-02-20 21:55:47,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:55:47,311 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 752 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:47,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 699 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 21:55:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-02-20 21:55:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2022-02-20 21:55:47,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:47,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:47,378 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:47,379 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:47,409 INFO L93 Difference]: Finished difference Result 540 states and 730 transitions. [2022-02-20 21:55:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 730 transitions. [2022-02-20 21:55:47,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:47,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:47,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand 540 states. [2022-02-20 21:55:47,421 INFO L87 Difference]: Start difference. First operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand 540 states. [2022-02-20 21:55:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:47,441 INFO L93 Difference]: Finished difference Result 540 states and 730 transitions. [2022-02-20 21:55:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 730 transitions. [2022-02-20 21:55:47,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:47,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:47,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:47,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2022-02-20 21:55:47,465 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2022-02-20 21:55:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:47,466 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2022-02-20 21:55:47,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-02-20 21:55:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 21:55:47,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:47,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:47,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:55:47,469 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:47,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2022-02-20 21:55:47,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:47,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825980345] [2022-02-20 21:55:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:47,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:47,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {3079#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3053#true} is VALID [2022-02-20 21:55:47,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3053#true} {3053#true} #597#return; {3053#true} is VALID [2022-02-20 21:55:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:47,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {3053#true} ~cond := #in~cond; {3053#true} is VALID [2022-02-20 21:55:47,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {3053#true} assume !(0 == ~cond); {3053#true} is VALID [2022-02-20 21:55:47,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3053#true} {3053#true} #599#return; {3053#true} is VALID [2022-02-20 21:55:47,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {3071#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {3053#true} is VALID [2022-02-20 21:55:47,576 INFO L272 TraceCheckUtils]: 1: Hoare triple {3053#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {3079#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:47,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {3079#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3053#true} is VALID [2022-02-20 21:55:47,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,577 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3053#true} {3053#true} #597#return; {3053#true} is VALID [2022-02-20 21:55:47,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {3053#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {3053#true} is VALID [2022-02-20 21:55:47,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {3053#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {3053#true} is VALID [2022-02-20 21:55:47,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {3053#true} ~cond := #in~cond; {3053#true} is VALID [2022-02-20 21:55:47,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {3053#true} assume !(0 == ~cond); {3053#true} is VALID [2022-02-20 21:55:47,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3053#true} {3053#true} #599#return; {3053#true} is VALID [2022-02-20 21:55:47,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {3053#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3053#true} is VALID [2022-02-20 21:55:47,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,578 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3053#true} {3053#true} #623#return; {3053#true} is VALID [2022-02-20 21:55:47,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {3053#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {3053#true} is VALID [2022-02-20 21:55:47,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {3053#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {3053#true} is VALID [2022-02-20 21:55:47,579 INFO L272 TraceCheckUtils]: 2: Hoare triple {3053#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {3071#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:47,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {3071#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {3053#true} is VALID [2022-02-20 21:55:47,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {3053#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {3079#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:47,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {3079#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3053#true} is VALID [2022-02-20 21:55:47,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,581 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3053#true} {3053#true} #597#return; {3053#true} is VALID [2022-02-20 21:55:47,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {3053#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {3053#true} is VALID [2022-02-20 21:55:47,581 INFO L272 TraceCheckUtils]: 9: Hoare triple {3053#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {3053#true} is VALID [2022-02-20 21:55:47,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {3053#true} ~cond := #in~cond; {3053#true} is VALID [2022-02-20 21:55:47,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {3053#true} assume !(0 == ~cond); {3053#true} is VALID [2022-02-20 21:55:47,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,582 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3053#true} {3053#true} #599#return; {3053#true} is VALID [2022-02-20 21:55:47,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {3053#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3053#true} is VALID [2022-02-20 21:55:47,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-02-20 21:55:47,582 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3053#true} {3053#true} #623#return; {3053#true} is VALID [2022-02-20 21:55:47,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {3053#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {3053#true} is VALID [2022-02-20 21:55:47,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {3053#true} assume { :end_inline_ldv_set_init } true; {3053#true} is VALID [2022-02-20 21:55:47,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {3053#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {3053#true} is VALID [2022-02-20 21:55:47,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {3053#true} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {3053#true} is VALID [2022-02-20 21:55:47,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {3053#true} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {3053#true} is VALID [2022-02-20 21:55:47,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {3053#true} assume main_#t~switch119#1; {3053#true} is VALID [2022-02-20 21:55:47,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {3053#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {3053#true} is VALID [2022-02-20 21:55:47,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {3053#true} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1 == main_~tmp___2~1#1; {3053#true} is VALID [2022-02-20 21:55:47,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {3053#true} assume main_#t~switch130#1; {3053#true} is VALID [2022-02-20 21:55:47,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {3053#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;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; {3053#true} is VALID [2022-02-20 21:55:47,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {3053#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {3069#(= |ULTIMATE.start_mod_init_#res#1| 0)} is VALID [2022-02-20 21:55:47,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {3069#(= |ULTIMATE.start_mod_init_#res#1| 0)} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret131#1 && main_#t~ret131#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {3070#(= ~ldv_retval_1~0 0)} is VALID [2022-02-20 21:55:47,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {3070#(= ~ldv_retval_1~0 0)} assume !(0 == ~ldv_retval_1~0); {3054#false} is VALID [2022-02-20 21:55:47,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {3054#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {3054#false} is VALID [2022-02-20 21:55:47,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {3054#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {3054#false} is VALID [2022-02-20 21:55:47,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {3054#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {3054#false} is VALID [2022-02-20 21:55:47,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {3054#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {3054#false} is VALID [2022-02-20 21:55:47,586 INFO L272 TraceCheckUtils]: 34: Hoare triple {3054#false} call ldv_error(); {3054#false} is VALID [2022-02-20 21:55:47,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {3054#false} assume !false; {3054#false} is VALID [2022-02-20 21:55:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:55:47,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:47,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825980345] [2022-02-20 21:55:47,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825980345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:47,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:47,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:55:47,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097522166] [2022-02-20 21:55:47,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:47,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 21:55:47,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:47,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:47,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:47,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:55:47,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:55:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:55:47,611 INFO L87 Difference]: Start difference. First operand 432 states and 572 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:49,083 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2022-02-20 21:55:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:55:49,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 21:55:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2022-02-20 21:55:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2022-02-20 21:55:49,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 754 transitions. [2022-02-20 21:55:49,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 754 edges. 754 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:49,678 INFO L225 Difference]: With dead ends: 965 [2022-02-20 21:55:49,678 INFO L226 Difference]: Without dead ends: 539 [2022-02-20 21:55:49,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:55:49,680 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 505 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:49,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 910 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:55:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-02-20 21:55:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-02-20 21:55:49,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:49,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 539 states. Second operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:49,699 INFO L74 IsIncluded]: Start isIncluded. First operand 539 states. Second operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:49,700 INFO L87 Difference]: Start difference. First operand 539 states. Second operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:49,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:49,715 INFO L93 Difference]: Finished difference Result 539 states and 726 transitions. [2022-02-20 21:55:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 726 transitions. [2022-02-20 21:55:49,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:49,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:49,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand 539 states. [2022-02-20 21:55:49,718 INFO L87 Difference]: Start difference. First operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand 539 states. [2022-02-20 21:55:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:49,733 INFO L93 Difference]: Finished difference Result 539 states and 726 transitions. [2022-02-20 21:55:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 726 transitions. [2022-02-20 21:55:49,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:49,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:49,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:49,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:55:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2022-02-20 21:55:49,757 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2022-02-20 21:55:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:49,757 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2022-02-20 21:55:49,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2022-02-20 21:55:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 21:55:49,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:49,760 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:49,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:55:49,760 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2022-02-20 21:55:49,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:49,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146206840] [2022-02-20 21:55:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:49,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {6106#true} is VALID [2022-02-20 21:55:49,881 INFO L272 TraceCheckUtils]: 1: Hoare triple {6106#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:49,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,881 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {6106#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {6106#true} is VALID [2022-02-20 21:55:49,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {6106#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6106#true} is VALID [2022-02-20 21:55:49,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {6106#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6106#true} is VALID [2022-02-20 21:55:49,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,883 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6106#true} {6106#true} #623#return; {6106#true} is VALID [2022-02-20 21:55:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:55:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {6106#true} is VALID [2022-02-20 21:55:49,910 INFO L272 TraceCheckUtils]: 1: Hoare triple {6106#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:49,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,911 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {6106#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {6106#true} is VALID [2022-02-20 21:55:49,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {6106#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6106#true} is VALID [2022-02-20 21:55:49,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {6106#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6106#true} is VALID [2022-02-20 21:55:49,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,913 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6106#true} {6122#(= ~last_index~0 0)} #639#return; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:55:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:49,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {6106#true} is VALID [2022-02-20 21:55:49,933 INFO L272 TraceCheckUtils]: 1: Hoare triple {6106#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:49,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,934 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {6106#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {6106#true} is VALID [2022-02-20 21:55:49,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {6106#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6106#true} is VALID [2022-02-20 21:55:49,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {6106#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6106#true} is VALID [2022-02-20 21:55:49,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,936 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6106#true} {6122#(= ~last_index~0 0)} #641#return; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {6106#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {6106#true} is VALID [2022-02-20 21:55:49,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {6106#true} is VALID [2022-02-20 21:55:49,937 INFO L272 TraceCheckUtils]: 2: Hoare triple {6106#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:49,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {6106#true} is VALID [2022-02-20 21:55:49,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {6106#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:49,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,938 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {6106#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {6106#true} is VALID [2022-02-20 21:55:49,938 INFO L272 TraceCheckUtils]: 9: Hoare triple {6106#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6106#true} is VALID [2022-02-20 21:55:49,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,939 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {6106#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6106#true} is VALID [2022-02-20 21:55:49,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,939 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6106#true} {6106#true} #623#return; {6106#true} is VALID [2022-02-20 21:55:49,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {6106#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {6122#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {6122#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {6122#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {6122#(= ~last_index~0 0)} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {6122#(= ~last_index~0 0)} assume main_#t~switch119#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {6122#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {6122#(= ~last_index~0 0)} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1 == main_~tmp___2~1#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {6122#(= ~last_index~0 0)} assume main_#t~switch130#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {6122#(= ~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_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; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {6122#(= ~last_index~0 0)} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {6122#(= ~last_index~0 0)} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret131#1 && main_#t~ret131#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {6122#(= ~last_index~0 0)} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_1 } true;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset, ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset, ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,945 INFO L272 TraceCheckUtils]: 30: Hoare triple {6122#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset := ldv_successful_zalloc(3264); {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:49,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {6106#true} is VALID [2022-02-20 21:55:49,946 INFO L272 TraceCheckUtils]: 32: Hoare triple {6106#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:49,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,946 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {6106#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {6106#true} is VALID [2022-02-20 21:55:49,947 INFO L272 TraceCheckUtils]: 37: Hoare triple {6106#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6106#true} is VALID [2022-02-20 21:55:49,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,947 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {6106#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6106#true} is VALID [2022-02-20 21:55:49,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,948 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6106#true} {6122#(= ~last_index~0 0)} #639#return; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {6122#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset := ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,949 INFO L272 TraceCheckUtils]: 46: Hoare triple {6122#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset := ldv_successful_zalloc(232); {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:49,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {6153#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {6106#true} is VALID [2022-02-20 21:55:49,950 INFO L272 TraceCheckUtils]: 48: Hoare triple {6106#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:49,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6106#true} is VALID [2022-02-20 21:55:49,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,950 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6106#true} {6106#true} #597#return; {6106#true} is VALID [2022-02-20 21:55:49,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {6106#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {6106#true} is VALID [2022-02-20 21:55:49,950 INFO L272 TraceCheckUtils]: 53: Hoare triple {6106#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6106#true} is VALID [2022-02-20 21:55:49,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {6106#true} ~cond := #in~cond; {6106#true} is VALID [2022-02-20 21:55:49,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {6106#true} assume !(0 == ~cond); {6106#true} is VALID [2022-02-20 21:55:49,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,951 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6106#true} {6106#true} #599#return; {6106#true} is VALID [2022-02-20 21:55:49,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {6106#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6106#true} is VALID [2022-02-20 21:55:49,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {6106#true} assume true; {6106#true} is VALID [2022-02-20 21:55:49,952 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6106#true} {6122#(= ~last_index~0 0)} #641#return; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {6122#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {6122#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_hdlc_proto_1 } true; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {6122#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_1~0); {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {6122#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {6122#(= ~last_index~0 0)} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {6122#(= ~last_index~0 0)} assume main_#t~switch119#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {6122#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {6122#(= ~last_index~0 0)} assume main_#t~switch130#1; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,955 INFO L290 TraceCheckUtils]: 69: Hoare triple {6122#(= ~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; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,955 INFO L290 TraceCheckUtils]: 70: Hoare triple {6122#(= ~last_index~0 0)} assume { :end_inline_unregister_hdlc_protocol } true; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,955 INFO L290 TraceCheckUtils]: 71: Hoare triple {6122#(= ~last_index~0 0)} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {6122#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:49,956 INFO L290 TraceCheckUtils]: 72: Hoare triple {6122#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {6151#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} is VALID [2022-02-20 21:55:49,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {6151#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {6152#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~5#1| 0))} is VALID [2022-02-20 21:55:49,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {6152#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~5#1| 0))} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {6107#false} is VALID [2022-02-20 21:55:49,958 INFO L272 TraceCheckUtils]: 75: Hoare triple {6107#false} call ldv_error(); {6107#false} is VALID [2022-02-20 21:55:49,958 INFO L290 TraceCheckUtils]: 76: Hoare triple {6107#false} assume !false; {6107#false} is VALID [2022-02-20 21:55:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:55:49,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:49,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146206840] [2022-02-20 21:55:49,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146206840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:49,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:49,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:55:49,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845112448] [2022-02-20 21:55:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2022-02-20 21:55:49,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:49,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:55:49,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:49,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:55:49,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:49,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:55:49,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:55:49,991 INFO L87 Difference]: Start difference. First operand 431 states and 568 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:55:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:52,283 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2022-02-20 21:55:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:55:52,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2022-02-20 21:55:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:55:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1052 transitions. [2022-02-20 21:55:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:55:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1052 transitions. [2022-02-20 21:55:52,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 1052 transitions. [2022-02-20 21:55:53,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1052 edges. 1052 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:53,097 INFO L225 Difference]: With dead ends: 1462 [2022-02-20 21:55:53,098 INFO L226 Difference]: Without dead ends: 1032 [2022-02-20 21:55:53,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:55:53,100 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 504 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:53,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1317 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 21:55:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-02-20 21:55:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2022-02-20 21:55:53,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:53,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1032 states. Second operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) [2022-02-20 21:55:53,133 INFO L74 IsIncluded]: Start isIncluded. First operand 1032 states. Second operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) [2022-02-20 21:55:53,134 INFO L87 Difference]: Start difference. First operand 1032 states. Second operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) [2022-02-20 21:55:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:53,176 INFO L93 Difference]: Finished difference Result 1032 states and 1457 transitions. [2022-02-20 21:55:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1457 transitions. [2022-02-20 21:55:53,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:53,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:53,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) Second operand 1032 states. [2022-02-20 21:55:53,182 INFO L87 Difference]: Start difference. First operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) Second operand 1032 states. [2022-02-20 21:55:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:53,224 INFO L93 Difference]: Finished difference Result 1032 states and 1457 transitions. [2022-02-20 21:55:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1457 transitions. [2022-02-20 21:55:53,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:53,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:53,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:53,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) [2022-02-20 21:55:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2022-02-20 21:55:53,267 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2022-02-20 21:55:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:53,268 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2022-02-20 21:55:53,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:55:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2022-02-20 21:55:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-20 21:55:53,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:53,274 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:53,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:55:53,274 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2022-02-20 21:55:53,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:53,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360089646] [2022-02-20 21:55:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {11445#true} is VALID [2022-02-20 21:55:53,403 INFO L272 TraceCheckUtils]: 1: Hoare triple {11445#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {11532#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:53,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,403 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {11445#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {11445#true} is VALID [2022-02-20 21:55:53,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {11445#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,404 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {11445#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {11445#true} is VALID [2022-02-20 21:55:53,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,404 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11445#true} {11445#true} #623#return; {11445#true} is VALID [2022-02-20 21:55:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:55:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {11445#true} is VALID [2022-02-20 21:55:53,430 INFO L272 TraceCheckUtils]: 1: Hoare triple {11445#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {11532#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:53,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,430 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {11445#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {11445#true} is VALID [2022-02-20 21:55:53,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {11445#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {11445#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {11445#true} is VALID [2022-02-20 21:55:53,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,432 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11445#true} {11461#(= ~ldv_state_variable_1~0 1)} #639#return; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:55:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {11445#true} is VALID [2022-02-20 21:55:53,459 INFO L272 TraceCheckUtils]: 1: Hoare triple {11445#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {11532#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:53,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,460 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {11445#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {11445#true} is VALID [2022-02-20 21:55:53,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {11445#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {11445#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {11445#true} is VALID [2022-02-20 21:55:53,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,461 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11445#true} {11461#(= ~ldv_state_variable_1~0 1)} #641#return; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-02-20 21:55:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11445#true} {11445#true} #583#return; {11445#true} is VALID [2022-02-20 21:55:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:55:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11445#true} {11445#true} #585#return; {11445#true} is VALID [2022-02-20 21:55:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 21:55:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:53,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {11445#true} is VALID [2022-02-20 21:55:53,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {11445#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {11445#true} is VALID [2022-02-20 21:55:53,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {11445#true} ~last_index~0 := ~last_index~0 - 1; {11445#true} is VALID [2022-02-20 21:55:53,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,534 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11445#true} {11445#true} #613#return; {11445#true} is VALID [2022-02-20 21:55:53,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {11445#true} is VALID [2022-02-20 21:55:53,539 INFO L272 TraceCheckUtils]: 1: Hoare triple {11445#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:53,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {11445#true} is VALID [2022-02-20 21:55:53,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {11445#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {11445#true} is VALID [2022-02-20 21:55:53,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {11445#true} ~last_index~0 := ~last_index~0 - 1; {11445#true} is VALID [2022-02-20 21:55:53,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11445#true} {11445#true} #613#return; {11445#true} is VALID [2022-02-20 21:55:53,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,541 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11445#true} {11445#true} #595#return; {11445#true} is VALID [2022-02-20 21:55:53,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {11547#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {11445#true} is VALID [2022-02-20 21:55:53,541 INFO L272 TraceCheckUtils]: 1: Hoare triple {11445#true} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,542 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11445#true} {11445#true} #583#return; {11445#true} is VALID [2022-02-20 21:55:53,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {11445#true} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {11445#true} is VALID [2022-02-20 21:55:53,542 INFO L272 TraceCheckUtils]: 7: Hoare triple {11445#true} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,543 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {11445#true} {11445#true} #585#return; {11445#true} is VALID [2022-02-20 21:55:53,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {11445#true} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {11445#true} is VALID [2022-02-20 21:55:53,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {11445#true} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 1 == #t~mem86#1 % 256; {11445#true} is VALID [2022-02-20 21:55:53,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {11445#true} assume #t~switch87#1;assume { :begin_inline_lapb_connect_request } true;lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset := ~dev#1.base, ~dev#1.offset;havoc lapb_connect_request_#res#1;havoc lapb_connect_request_#t~nondet147#1, lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset;lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset := lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset;assume -2147483648 <= lapb_connect_request_#t~nondet147#1 && lapb_connect_request_#t~nondet147#1 <= 2147483647;lapb_connect_request_#res#1 := lapb_connect_request_#t~nondet147#1;havoc lapb_connect_request_#t~nondet147#1; {11445#true} is VALID [2022-02-20 21:55:53,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {11445#true} #t~ret90#1 := lapb_connect_request_#res#1;assume { :end_inline_lapb_connect_request } true;assume -2147483648 <= #t~ret90#1 && #t~ret90#1 <= 2147483647;~result~0#1 := #t~ret90#1;havoc #t~ret90#1; {11445#true} is VALID [2022-02-20 21:55:53,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {11445#true} assume !(0 != ~result~0#1); {11445#true} is VALID [2022-02-20 21:55:53,545 INFO L272 TraceCheckUtils]: 17: Hoare triple {11445#true} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:53,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {11445#true} is VALID [2022-02-20 21:55:53,546 INFO L272 TraceCheckUtils]: 19: Hoare triple {11445#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {11445#true} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {11445#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {11445#true} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {11445#true} ~last_index~0 := ~last_index~0 - 1; {11445#true} is VALID [2022-02-20 21:55:53,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,548 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11445#true} {11445#true} #613#return; {11445#true} is VALID [2022-02-20 21:55:53,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,549 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {11445#true} {11445#true} #595#return; {11445#true} is VALID [2022-02-20 21:55:53,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {11445#true} #res#1 := 0; {11445#true} is VALID [2022-02-20 21:55:53,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,550 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11445#true} {11446#false} #627#return; {11446#false} is VALID [2022-02-20 21:55:53,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {11445#true} is VALID [2022-02-20 21:55:53,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {11445#true} is VALID [2022-02-20 21:55:53,551 INFO L272 TraceCheckUtils]: 2: Hoare triple {11445#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:53,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {11445#true} is VALID [2022-02-20 21:55:53,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {11445#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {11532#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:53,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,552 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {11445#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {11445#true} is VALID [2022-02-20 21:55:53,552 INFO L272 TraceCheckUtils]: 9: Hoare triple {11445#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {11445#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11445#true} {11445#true} #623#return; {11445#true} is VALID [2022-02-20 21:55:53,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {11445#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {11445#true} assume { :end_inline_ldv_set_init } true; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {11445#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {11445#true} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {11445#true} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {11445#true} assume main_#t~switch119#1; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {11445#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {11445#true} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1 == main_~tmp___2~1#1; {11445#true} is VALID [2022-02-20 21:55:53,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {11445#true} assume main_#t~switch130#1; {11445#true} is VALID [2022-02-20 21:55:53,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {11445#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;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; {11445#true} is VALID [2022-02-20 21:55:53,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {11445#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {11445#true} is VALID [2022-02-20 21:55:53,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {11445#true} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret131#1 && main_#t~ret131#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {11445#true} is VALID [2022-02-20 21:55:53,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {11445#true} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_1 } true;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset, ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset, ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,556 INFO L272 TraceCheckUtils]: 30: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} call ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset := ldv_successful_zalloc(3264); {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:53,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {11445#true} is VALID [2022-02-20 21:55:53,557 INFO L272 TraceCheckUtils]: 32: Hoare triple {11445#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {11532#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:53,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,557 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {11445#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {11445#true} is VALID [2022-02-20 21:55:53,557 INFO L272 TraceCheckUtils]: 37: Hoare triple {11445#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,558 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {11445#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {11445#true} is VALID [2022-02-20 21:55:53,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,558 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11445#true} {11461#(= ~ldv_state_variable_1~0 1)} #639#return; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset := ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,559 INFO L272 TraceCheckUtils]: 46: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} call ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset := ldv_successful_zalloc(232); {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:53,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {11524#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {11445#true} is VALID [2022-02-20 21:55:53,560 INFO L272 TraceCheckUtils]: 48: Hoare triple {11445#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {11532#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:53,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {11532#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11445#true} is VALID [2022-02-20 21:55:53,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,560 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11445#true} {11445#true} #597#return; {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {11445#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L272 TraceCheckUtils]: 53: Hoare triple {11445#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11445#true} {11445#true} #599#return; {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {11445#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {11445#true} is VALID [2022-02-20 21:55:53,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,562 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11445#true} {11461#(= ~ldv_state_variable_1~0 1)} #641#return; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} assume { :end_inline_ldv_initialize_hdlc_proto_1 } true; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} assume !(0 != ~ldv_retval_1~0); {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} assume main_#t~switch119#1; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet120#1 && main_#t~nondet120#1 <= 2147483647;main_~tmp___1~4#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1;main_#t~switch121#1 := 0 == main_~tmp___1~4#1; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} assume main_#t~switch121#1; {11461#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:53,564 INFO L290 TraceCheckUtils]: 68: Hoare triple {11461#(= ~ldv_state_variable_1~0 1)} assume !(1 == ~ldv_state_variable_1~0); {11446#false} is VALID [2022-02-20 21:55:53,564 INFO L290 TraceCheckUtils]: 69: Hoare triple {11446#false} assume 2 == ~ldv_state_variable_1~0; {11446#false} is VALID [2022-02-20 21:55:53,564 INFO L272 TraceCheckUtils]: 70: Hoare triple {11446#false} call main_#t~ret123#1 := x25_xmit(~proto_group0~0.base, ~proto_group0~0.offset, ~proto_group1~0.base, ~proto_group1~0.offset); {11547#(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:55:53,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {11547#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {11445#true} is VALID [2022-02-20 21:55:53,565 INFO L272 TraceCheckUtils]: 72: Hoare triple {11445#true} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,565 INFO L290 TraceCheckUtils]: 73: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,565 INFO L290 TraceCheckUtils]: 74: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,565 INFO L290 TraceCheckUtils]: 75: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,565 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11445#true} {11445#true} #583#return; {11445#true} is VALID [2022-02-20 21:55:53,565 INFO L290 TraceCheckUtils]: 77: Hoare triple {11445#true} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {11445#true} is VALID [2022-02-20 21:55:53,565 INFO L272 TraceCheckUtils]: 78: Hoare triple {11445#true} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {11445#true} is VALID [2022-02-20 21:55:53,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {11445#true} ~cond := #in~cond; {11445#true} is VALID [2022-02-20 21:55:53,566 INFO L290 TraceCheckUtils]: 80: Hoare triple {11445#true} assume !(0 == ~cond); {11445#true} is VALID [2022-02-20 21:55:53,566 INFO L290 TraceCheckUtils]: 81: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,566 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11445#true} {11445#true} #585#return; {11445#true} is VALID [2022-02-20 21:55:53,566 INFO L290 TraceCheckUtils]: 83: Hoare triple {11445#true} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {11445#true} is VALID [2022-02-20 21:55:53,566 INFO L290 TraceCheckUtils]: 84: Hoare triple {11445#true} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 1 == #t~mem86#1 % 256; {11445#true} is VALID [2022-02-20 21:55:53,566 INFO L290 TraceCheckUtils]: 85: Hoare triple {11445#true} assume #t~switch87#1;assume { :begin_inline_lapb_connect_request } true;lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset := ~dev#1.base, ~dev#1.offset;havoc lapb_connect_request_#res#1;havoc lapb_connect_request_#t~nondet147#1, lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset;lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset := lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset;assume -2147483648 <= lapb_connect_request_#t~nondet147#1 && lapb_connect_request_#t~nondet147#1 <= 2147483647;lapb_connect_request_#res#1 := lapb_connect_request_#t~nondet147#1;havoc lapb_connect_request_#t~nondet147#1; {11445#true} is VALID [2022-02-20 21:55:53,567 INFO L290 TraceCheckUtils]: 86: Hoare triple {11445#true} #t~ret90#1 := lapb_connect_request_#res#1;assume { :end_inline_lapb_connect_request } true;assume -2147483648 <= #t~ret90#1 && #t~ret90#1 <= 2147483647;~result~0#1 := #t~ret90#1;havoc #t~ret90#1; {11445#true} is VALID [2022-02-20 21:55:53,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {11445#true} assume !(0 != ~result~0#1); {11445#true} is VALID [2022-02-20 21:55:53,567 INFO L272 TraceCheckUtils]: 88: Hoare triple {11445#true} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:53,567 INFO L290 TraceCheckUtils]: 89: Hoare triple {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {11445#true} is VALID [2022-02-20 21:55:53,568 INFO L272 TraceCheckUtils]: 90: Hoare triple {11445#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:53,568 INFO L290 TraceCheckUtils]: 91: Hoare triple {11569#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {11445#true} is VALID [2022-02-20 21:55:53,568 INFO L290 TraceCheckUtils]: 92: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L290 TraceCheckUtils]: 93: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L290 TraceCheckUtils]: 94: Hoare triple {11445#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L290 TraceCheckUtils]: 95: Hoare triple {11445#true} assume !false; {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L290 TraceCheckUtils]: 96: Hoare triple {11445#true} assume !(~i~1 < ~last_index~0); {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L290 TraceCheckUtils]: 97: Hoare triple {11445#true} ~last_index~0 := ~last_index~0 - 1; {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L290 TraceCheckUtils]: 98: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {11445#true} {11445#true} #613#return; {11445#true} is VALID [2022-02-20 21:55:53,569 INFO L290 TraceCheckUtils]: 100: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,570 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11445#true} {11445#true} #595#return; {11445#true} is VALID [2022-02-20 21:55:53,570 INFO L290 TraceCheckUtils]: 102: Hoare triple {11445#true} #res#1 := 0; {11445#true} is VALID [2022-02-20 21:55:53,570 INFO L290 TraceCheckUtils]: 103: Hoare triple {11445#true} assume true; {11445#true} is VALID [2022-02-20 21:55:53,570 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {11445#true} {11446#false} #627#return; {11446#false} is VALID [2022-02-20 21:55:53,570 INFO L290 TraceCheckUtils]: 105: Hoare triple {11446#false} assume -2147483648 <= main_#t~ret123#1 && main_#t~ret123#1 <= 2147483647;havoc main_#t~ret123#1;~ldv_state_variable_1~0 := 2; {11446#false} is VALID [2022-02-20 21:55:53,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {11446#false} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {11446#false} is VALID [2022-02-20 21:55:53,570 INFO L290 TraceCheckUtils]: 107: Hoare triple {11446#false} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {11446#false} is VALID [2022-02-20 21:55:53,570 INFO L290 TraceCheckUtils]: 108: Hoare triple {11446#false} assume main_#t~switch119#1; {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 109: Hoare triple {11446#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 110: Hoare triple {11446#false} assume main_#t~switch130#1; {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 111: Hoare triple {11446#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; {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 112: Hoare triple {11446#false} assume { :end_inline_unregister_hdlc_protocol } true; {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 113: Hoare triple {11446#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 114: Hoare triple {11446#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 115: Hoare triple {11446#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 116: Hoare triple {11446#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L272 TraceCheckUtils]: 117: Hoare triple {11446#false} call ldv_error(); {11446#false} is VALID [2022-02-20 21:55:53,571 INFO L290 TraceCheckUtils]: 118: Hoare triple {11446#false} assume !false; {11446#false} is VALID [2022-02-20 21:55:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-02-20 21:55:53,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:53,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360089646] [2022-02-20 21:55:53,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360089646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:53,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:53,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:55:53,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437328008] [2022-02-20 21:55:53,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:53,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 119 [2022-02-20 21:55:53,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:53,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:55:53,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:53,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:55:53,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:55:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:55:53,627 INFO L87 Difference]: Start difference. First operand 840 states and 1137 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:55:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:56,202 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2022-02-20 21:55:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 21:55:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 119 [2022-02-20 21:55:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:55:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1086 transitions. [2022-02-20 21:55:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:55:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1086 transitions. [2022-02-20 21:55:56,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1086 transitions. [2022-02-20 21:55:57,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1086 edges. 1086 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:57,272 INFO L225 Difference]: With dead ends: 2912 [2022-02-20 21:55:57,272 INFO L226 Difference]: Without dead ends: 2078 [2022-02-20 21:55:57,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:55:57,276 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 813 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:57,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 867 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 21:55:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-02-20 21:55:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2022-02-20 21:55:57,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:57,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2078 states. Second operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:55:57,353 INFO L74 IsIncluded]: Start isIncluded. First operand 2078 states. Second operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:55:57,356 INFO L87 Difference]: Start difference. First operand 2078 states. Second operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:55:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:57,487 INFO L93 Difference]: Finished difference Result 2078 states and 2831 transitions. [2022-02-20 21:55:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2831 transitions. [2022-02-20 21:55:57,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:57,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:57,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) Second operand 2078 states. [2022-02-20 21:55:57,498 INFO L87 Difference]: Start difference. First operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) Second operand 2078 states. [2022-02-20 21:55:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:57,635 INFO L93 Difference]: Finished difference Result 2078 states and 2831 transitions. [2022-02-20 21:55:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2831 transitions. [2022-02-20 21:55:57,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:57,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:57,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:57,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:55:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2022-02-20 21:55:57,781 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2022-02-20 21:55:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:57,781 INFO L470 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2022-02-20 21:55:57,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:55:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2022-02-20 21:55:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-20 21:55:57,788 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:57,788 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:57,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:55:57,788 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:57,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1712450421, now seen corresponding path program 1 times [2022-02-20 21:55:57,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:57,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575624002] [2022-02-20 21:55:57,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:57,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:57,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {22025#true} is VALID [2022-02-20 21:55:57,886 INFO L272 TraceCheckUtils]: 1: Hoare triple {22025#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {22117#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:57,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:57,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,890 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {22025#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {22025#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {22025#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22025#true} is VALID [2022-02-20 21:55:57,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,892 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22025#true} {22025#true} #623#return; {22025#true} is VALID [2022-02-20 21:55:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:55:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:57,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:57,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {22025#true} is VALID [2022-02-20 21:55:57,912 INFO L272 TraceCheckUtils]: 1: Hoare triple {22025#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {22117#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:57,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:57,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,912 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:57,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {22025#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {22025#true} is VALID [2022-02-20 21:55:57,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {22025#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:57,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:57,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {22025#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22025#true} is VALID [2022-02-20 21:55:57,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,913 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22025#true} {22025#true} #639#return; {22025#true} is VALID [2022-02-20 21:55:57,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:55:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:57,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:55:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:57,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {22025#true} is VALID [2022-02-20 21:55:57,943 INFO L272 TraceCheckUtils]: 1: Hoare triple {22025#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {22117#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:57,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:57,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,943 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:57,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {22025#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {22025#true} is VALID [2022-02-20 21:55:57,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {22025#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:57,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:57,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {22025#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22025#true} is VALID [2022-02-20 21:55:57,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,944 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22025#true} {22025#true} #641#return; {22025#true} is VALID [2022-02-20 21:55:57,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:55:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22025#true} {22025#true} #583#return; {22025#true} is VALID [2022-02-20 21:55:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:55:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:57,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:57,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22025#true} {22025#true} #585#return; {22025#true} is VALID [2022-02-20 21:55:57,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:57,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {22158#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~4;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp___0~4 := #t~nondet41;havoc #t~nondet41; {22025#true} is VALID [2022-02-20 21:55:57,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume 0 != ~tmp___0~4;#res.base, #res.offset := 0, 0; {22025#true} is VALID [2022-02-20 21:55:57,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:57,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22025#true} {22025#true} #587#return; {22025#true} is VALID [2022-02-20 21:55:57,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:55:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:58,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:58,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {22026#false} is VALID [2022-02-20 21:55:58,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {22026#false} assume !false; {22026#false} is VALID [2022-02-20 21:55:58,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {22026#false} assume !(~i~1 < ~last_index~0); {22026#false} is VALID [2022-02-20 21:55:58,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {22026#false} ~last_index~0 := ~last_index~0 - 1; {22026#false} is VALID [2022-02-20 21:55:58,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,027 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22026#false} {22025#true} #613#return; {22026#false} is VALID [2022-02-20 21:55:58,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {22025#true} is VALID [2022-02-20 21:55:58,028 INFO L272 TraceCheckUtils]: 1: Hoare triple {22025#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:58,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {22026#false} is VALID [2022-02-20 21:55:58,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {22026#false} assume !false; {22026#false} is VALID [2022-02-20 21:55:58,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {22026#false} assume !(~i~1 < ~last_index~0); {22026#false} is VALID [2022-02-20 21:55:58,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {22026#false} ~last_index~0 := ~last_index~0 - 1; {22026#false} is VALID [2022-02-20 21:55:58,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22026#false} {22025#true} #613#return; {22026#false} is VALID [2022-02-20 21:55:58,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,031 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22026#false} {22025#true} #589#return; {22026#false} is VALID [2022-02-20 21:55:58,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {22132#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {22025#true} is VALID [2022-02-20 21:55:58,031 INFO L272 TraceCheckUtils]: 1: Hoare triple {22025#true} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:58,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:58,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:58,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,048 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22025#true} {22025#true} #583#return; {22025#true} is VALID [2022-02-20 21:55:58,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {22025#true} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {22025#true} is VALID [2022-02-20 21:55:58,048 INFO L272 TraceCheckUtils]: 7: Hoare triple {22025#true} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:58,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:58,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:58,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,049 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {22025#true} {22025#true} #585#return; {22025#true} is VALID [2022-02-20 21:55:58,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {22025#true} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {22025#true} is VALID [2022-02-20 21:55:58,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {22025#true} assume #t~switch87#1;assume { :begin_inline_skb_pull } true;skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset, skb_pull_#in~arg1#1 := ~skb#1.base, ~skb#1.offset, 1;havoc skb_pull_#res#1.base, skb_pull_#res#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset, skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset, skb_pull_~arg1#1;skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset := skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset;skb_pull_~arg1#1 := skb_pull_#in~arg1#1; {22025#true} is VALID [2022-02-20 21:55:58,050 INFO L272 TraceCheckUtils]: 14: Hoare triple {22025#true} call skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset := ldv_malloc(1); {22158#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {22158#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~4;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp___0~4 := #t~nondet41;havoc #t~nondet41; {22025#true} is VALID [2022-02-20 21:55:58,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {22025#true} assume 0 != ~tmp___0~4;#res.base, #res.offset := 0, 0; {22025#true} is VALID [2022-02-20 21:55:58,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,050 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22025#true} {22025#true} #587#return; {22025#true} is VALID [2022-02-20 21:55:58,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {22025#true} skb_pull_#res#1.base, skb_pull_#res#1.offset := skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset; {22025#true} is VALID [2022-02-20 21:55:58,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {22025#true} #t~ret88#1.base, #t~ret88#1.offset := skb_pull_#res#1.base, skb_pull_#res#1.offset;assume { :end_inline_skb_pull } true;havoc #t~ret88#1.base, #t~ret88#1.offset;assume { :begin_inline_lapb_data_request } true;lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset, lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset := ~dev#1.base, ~dev#1.offset, ~skb#1.base, ~skb#1.offset;havoc lapb_data_request_#res#1;havoc lapb_data_request_#t~nondet149#1, lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset, lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset;lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset := lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset;lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset := lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset;assume -2147483648 <= lapb_data_request_#t~nondet149#1 && lapb_data_request_#t~nondet149#1 <= 2147483647;lapb_data_request_#res#1 := lapb_data_request_#t~nondet149#1;havoc lapb_data_request_#t~nondet149#1; {22025#true} is VALID [2022-02-20 21:55:58,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {22025#true} #t~ret89#1 := lapb_data_request_#res#1;assume { :end_inline_lapb_data_request } true;assume -2147483648 <= #t~ret89#1 && #t~ret89#1 <= 2147483647;~result~0#1 := #t~ret89#1;havoc #t~ret89#1; {22025#true} is VALID [2022-02-20 21:55:58,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {22025#true} assume 0 != ~result~0#1; {22025#true} is VALID [2022-02-20 21:55:58,051 INFO L272 TraceCheckUtils]: 23: Hoare triple {22025#true} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:58,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {22025#true} is VALID [2022-02-20 21:55:58,052 INFO L272 TraceCheckUtils]: 25: Hoare triple {22025#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:58,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {22026#false} is VALID [2022-02-20 21:55:58,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {22026#false} assume !false; {22026#false} is VALID [2022-02-20 21:55:58,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {22026#false} assume !(~i~1 < ~last_index~0); {22026#false} is VALID [2022-02-20 21:55:58,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {22026#false} ~last_index~0 := ~last_index~0 - 1; {22026#false} is VALID [2022-02-20 21:55:58,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,054 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22026#false} {22025#true} #613#return; {22026#false} is VALID [2022-02-20 21:55:58,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,054 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22026#false} {22025#true} #589#return; {22026#false} is VALID [2022-02-20 21:55:58,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {22026#false} #res#1 := 0; {22026#false} is VALID [2022-02-20 21:55:58,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,055 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22026#false} {22025#true} #625#return; {22026#false} is VALID [2022-02-20 21:55:58,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {22025#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {22025#true} is VALID [2022-02-20 21:55:58,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {22025#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {22025#true} is VALID [2022-02-20 21:55:58,056 INFO L272 TraceCheckUtils]: 2: Hoare triple {22025#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {22025#true} is VALID [2022-02-20 21:55:58,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {22025#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {22117#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:58,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:58,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,057 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:58,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {22025#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {22025#true} is VALID [2022-02-20 21:55:58,057 INFO L272 TraceCheckUtils]: 9: Hoare triple {22025#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {22025#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22025#true} {22025#true} #623#return; {22025#true} is VALID [2022-02-20 21:55:58,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {22025#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {22025#true} is VALID [2022-02-20 21:55:58,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {22025#true} assume { :end_inline_ldv_set_init } true; {22025#true} is VALID [2022-02-20 21:55:58,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {22025#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {22025#true} is VALID [2022-02-20 21:55:58,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {22025#true} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {22025#true} is VALID [2022-02-20 21:55:58,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {22025#true} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {22025#true} is VALID [2022-02-20 21:55:58,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {22025#true} assume main_#t~switch119#1; {22025#true} is VALID [2022-02-20 21:55:58,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {22025#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {22025#true} is VALID [2022-02-20 21:55:58,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {22025#true} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1 == main_~tmp___2~1#1; {22025#true} is VALID [2022-02-20 21:55:58,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {22025#true} assume main_#t~switch130#1; {22025#true} is VALID [2022-02-20 21:55:58,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {22025#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;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; {22025#true} is VALID [2022-02-20 21:55:58,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {22025#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {22025#true} is VALID [2022-02-20 21:55:58,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {22025#true} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret131#1 && main_#t~ret131#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {22025#true} is VALID [2022-02-20 21:55:58,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {22025#true} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_1 } true;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset, ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset, ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {22025#true} is VALID [2022-02-20 21:55:58,061 INFO L272 TraceCheckUtils]: 30: Hoare triple {22025#true} call ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset := ldv_successful_zalloc(3264); {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {22025#true} is VALID [2022-02-20 21:55:58,061 INFO L272 TraceCheckUtils]: 32: Hoare triple {22025#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {22117#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:58,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:58,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,061 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {22025#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L272 TraceCheckUtils]: 37: Hoare triple {22025#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {22025#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {22025#true} {22025#true} #639#return; {22025#true} is VALID [2022-02-20 21:55:58,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {22025#true} ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset := ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset; {22025#true} is VALID [2022-02-20 21:55:58,063 INFO L272 TraceCheckUtils]: 46: Hoare triple {22025#true} call ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset := ldv_successful_zalloc(232); {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {22109#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {22025#true} is VALID [2022-02-20 21:55:58,063 INFO L272 TraceCheckUtils]: 48: Hoare triple {22025#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {22117#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:55:58,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {22117#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22025#true} is VALID [2022-02-20 21:55:58,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,064 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22025#true} {22025#true} #597#return; {22025#true} is VALID [2022-02-20 21:55:58,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {22025#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {22025#true} is VALID [2022-02-20 21:55:58,064 INFO L272 TraceCheckUtils]: 53: Hoare triple {22025#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:58,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:58,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:58,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,065 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {22025#true} {22025#true} #599#return; {22025#true} is VALID [2022-02-20 21:55:58,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {22025#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22025#true} is VALID [2022-02-20 21:55:58,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,065 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22025#true} {22025#true} #641#return; {22025#true} is VALID [2022-02-20 21:55:58,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {22025#true} ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {22025#true} is VALID [2022-02-20 21:55:58,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {22025#true} assume { :end_inline_ldv_initialize_hdlc_proto_1 } true; {22025#true} is VALID [2022-02-20 21:55:58,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {22025#true} assume !(0 != ~ldv_retval_1~0); {22025#true} is VALID [2022-02-20 21:55:58,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {22025#true} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {22025#true} is VALID [2022-02-20 21:55:58,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {22025#true} assume main_#t~switch119#1; {22025#true} is VALID [2022-02-20 21:55:58,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {22025#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet120#1 && main_#t~nondet120#1 <= 2147483647;main_~tmp___1~4#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1;main_#t~switch121#1 := 0 == main_~tmp___1~4#1; {22025#true} is VALID [2022-02-20 21:55:58,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {22025#true} assume main_#t~switch121#1; {22025#true} is VALID [2022-02-20 21:55:58,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {22025#true} assume 1 == ~ldv_state_variable_1~0; {22025#true} is VALID [2022-02-20 21:55:58,068 INFO L272 TraceCheckUtils]: 69: Hoare triple {22025#true} call main_#t~ret122#1 := x25_xmit(~proto_group0~0.base, ~proto_group0~0.offset, ~proto_group1~0.base, ~proto_group1~0.offset); {22132#(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:55:58,068 INFO L290 TraceCheckUtils]: 70: Hoare triple {22132#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {22025#true} is VALID [2022-02-20 21:55:58,068 INFO L272 TraceCheckUtils]: 71: Hoare triple {22025#true} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:58,069 INFO L290 TraceCheckUtils]: 72: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:58,069 INFO L290 TraceCheckUtils]: 73: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:58,069 INFO L290 TraceCheckUtils]: 74: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,069 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {22025#true} {22025#true} #583#return; {22025#true} is VALID [2022-02-20 21:55:58,069 INFO L290 TraceCheckUtils]: 76: Hoare triple {22025#true} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {22025#true} is VALID [2022-02-20 21:55:58,069 INFO L272 TraceCheckUtils]: 77: Hoare triple {22025#true} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {22025#true} is VALID [2022-02-20 21:55:58,070 INFO L290 TraceCheckUtils]: 78: Hoare triple {22025#true} ~cond := #in~cond; {22025#true} is VALID [2022-02-20 21:55:58,070 INFO L290 TraceCheckUtils]: 79: Hoare triple {22025#true} assume !(0 == ~cond); {22025#true} is VALID [2022-02-20 21:55:58,070 INFO L290 TraceCheckUtils]: 80: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,076 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22025#true} {22025#true} #585#return; {22025#true} is VALID [2022-02-20 21:55:58,077 INFO L290 TraceCheckUtils]: 82: Hoare triple {22025#true} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {22025#true} is VALID [2022-02-20 21:55:58,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {22025#true} assume #t~switch87#1;assume { :begin_inline_skb_pull } true;skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset, skb_pull_#in~arg1#1 := ~skb#1.base, ~skb#1.offset, 1;havoc skb_pull_#res#1.base, skb_pull_#res#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset, skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset, skb_pull_~arg1#1;skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset := skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset;skb_pull_~arg1#1 := skb_pull_#in~arg1#1; {22025#true} is VALID [2022-02-20 21:55:58,077 INFO L272 TraceCheckUtils]: 84: Hoare triple {22025#true} call skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset := ldv_malloc(1); {22158#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {22158#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~4;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp___0~4 := #t~nondet41;havoc #t~nondet41; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {22025#true} assume 0 != ~tmp___0~4;#res.base, #res.offset := 0, 0; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {22025#true} assume true; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {22025#true} {22025#true} #587#return; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L290 TraceCheckUtils]: 89: Hoare triple {22025#true} skb_pull_#res#1.base, skb_pull_#res#1.offset := skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L290 TraceCheckUtils]: 90: Hoare triple {22025#true} #t~ret88#1.base, #t~ret88#1.offset := skb_pull_#res#1.base, skb_pull_#res#1.offset;assume { :end_inline_skb_pull } true;havoc #t~ret88#1.base, #t~ret88#1.offset;assume { :begin_inline_lapb_data_request } true;lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset, lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset := ~dev#1.base, ~dev#1.offset, ~skb#1.base, ~skb#1.offset;havoc lapb_data_request_#res#1;havoc lapb_data_request_#t~nondet149#1, lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset, lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset;lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset := lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset;lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset := lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset;assume -2147483648 <= lapb_data_request_#t~nondet149#1 && lapb_data_request_#t~nondet149#1 <= 2147483647;lapb_data_request_#res#1 := lapb_data_request_#t~nondet149#1;havoc lapb_data_request_#t~nondet149#1; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {22025#true} #t~ret89#1 := lapb_data_request_#res#1;assume { :end_inline_lapb_data_request } true;assume -2147483648 <= #t~ret89#1 && #t~ret89#1 <= 2147483647;~result~0#1 := #t~ret89#1;havoc #t~ret89#1; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L290 TraceCheckUtils]: 92: Hoare triple {22025#true} assume 0 != ~result~0#1; {22025#true} is VALID [2022-02-20 21:55:58,078 INFO L272 TraceCheckUtils]: 93: Hoare triple {22025#true} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:58,079 INFO L290 TraceCheckUtils]: 94: Hoare triple {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {22025#true} is VALID [2022-02-20 21:55:58,079 INFO L272 TraceCheckUtils]: 95: Hoare triple {22025#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:58,080 INFO L290 TraceCheckUtils]: 96: Hoare triple {22159#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,080 INFO L290 TraceCheckUtils]: 97: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:58,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {22169#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 100: Hoare triple {22026#false} assume !false; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 101: Hoare triple {22026#false} assume !(~i~1 < ~last_index~0); {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 102: Hoare triple {22026#false} ~last_index~0 := ~last_index~0 - 1; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 103: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {22026#false} {22025#true} #613#return; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {22026#false} {22025#true} #589#return; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 107: Hoare triple {22026#false} #res#1 := 0; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 108: Hoare triple {22026#false} assume true; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {22026#false} {22025#true} #625#return; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 110: Hoare triple {22026#false} assume -2147483648 <= main_#t~ret122#1 && main_#t~ret122#1 <= 2147483647;havoc main_#t~ret122#1;~ldv_state_variable_1~0 := 1; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 111: Hoare triple {22026#false} assume !(2 == ~ldv_state_variable_1~0); {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 112: Hoare triple {22026#false} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 113: Hoare triple {22026#false} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {22026#false} is VALID [2022-02-20 21:55:58,081 INFO L290 TraceCheckUtils]: 114: Hoare triple {22026#false} assume main_#t~switch119#1; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 115: Hoare triple {22026#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 116: Hoare triple {22026#false} assume main_#t~switch130#1; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 117: Hoare triple {22026#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; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 118: Hoare triple {22026#false} assume { :end_inline_unregister_hdlc_protocol } true; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 119: Hoare triple {22026#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 120: Hoare triple {22026#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 121: Hoare triple {22026#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 122: Hoare triple {22026#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L272 TraceCheckUtils]: 123: Hoare triple {22026#false} call ldv_error(); {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L290 TraceCheckUtils]: 124: Hoare triple {22026#false} assume !false; {22026#false} is VALID [2022-02-20 21:55:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-02-20 21:55:58,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:58,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575624002] [2022-02-20 21:55:58,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575624002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:58,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:58,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:55:58,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163361614] [2022-02-20 21:55:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 125 [2022-02-20 21:55:58,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:58,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:55:58,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:58,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:55:58,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:58,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:55:58,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:55:58,136 INFO L87 Difference]: Start difference. First operand 1662 states and 2208 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:55:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:59,987 INFO L93 Difference]: Finished difference Result 3034 states and 4201 transitions. [2022-02-20 21:55:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:55:59,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 125 [2022-02-20 21:55:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:55:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 757 transitions. [2022-02-20 21:55:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:56:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 757 transitions. [2022-02-20 21:56:00,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 757 transitions. [2022-02-20 21:56:00,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 757 edges. 757 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:00,756 INFO L225 Difference]: With dead ends: 3034 [2022-02-20 21:56:00,757 INFO L226 Difference]: Without dead ends: 2150 [2022-02-20 21:56:00,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:56:00,759 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 333 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:00,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 808 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 21:56:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-02-20 21:56:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1670. [2022-02-20 21:56:00,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:00,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2150 states. Second operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:56:00,813 INFO L74 IsIncluded]: Start isIncluded. First operand 2150 states. Second operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:56:00,815 INFO L87 Difference]: Start difference. First operand 2150 states. Second operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:56:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:00,970 INFO L93 Difference]: Finished difference Result 2150 states and 2920 transitions. [2022-02-20 21:56:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2920 transitions. [2022-02-20 21:56:00,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:00,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:00,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) Second operand 2150 states. [2022-02-20 21:56:00,980 INFO L87 Difference]: Start difference. First operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) Second operand 2150 states. [2022-02-20 21:56:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:01,129 INFO L93 Difference]: Finished difference Result 2150 states and 2920 transitions. [2022-02-20 21:56:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2920 transitions. [2022-02-20 21:56:01,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:01,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:01,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:01,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-02-20 21:56:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2022-02-20 21:56:01,278 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 125 [2022-02-20 21:56:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:01,278 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2022-02-20 21:56:01,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:56:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2022-02-20 21:56:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-02-20 21:56:01,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:01,283 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:01,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:56:01,283 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:01,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2022-02-20 21:56:01,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:01,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246623055] [2022-02-20 21:56:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {32899#true} is VALID [2022-02-20 21:56:01,366 INFO L272 TraceCheckUtils]: 1: Hoare triple {32899#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {32994#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:01,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,366 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {32899#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {32899#true} is VALID [2022-02-20 21:56:01,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {32899#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {32899#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {32899#true} is VALID [2022-02-20 21:56:01,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,367 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {32899#true} {32899#true} #623#return; {32899#true} is VALID [2022-02-20 21:56:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:56:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {32899#true} is VALID [2022-02-20 21:56:01,389 INFO L272 TraceCheckUtils]: 1: Hoare triple {32899#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {32994#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:01,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,389 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {32899#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {32899#true} is VALID [2022-02-20 21:56:01,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {32899#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {32899#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {32899#true} is VALID [2022-02-20 21:56:01,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,397 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {32899#true} {32915#(= ~last_index~0 0)} #639#return; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {32899#true} is VALID [2022-02-20 21:56:01,416 INFO L272 TraceCheckUtils]: 1: Hoare triple {32899#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {32994#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:01,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,416 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {32899#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {32899#true} is VALID [2022-02-20 21:56:01,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {32899#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {32899#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {32899#true} is VALID [2022-02-20 21:56:01,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,418 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {32899#true} {32915#(= ~last_index~0 0)} #641#return; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:56:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #583#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:56:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #585#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:56:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {33039#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~4;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp___0~4 := #t~nondet41;havoc #t~nondet41; {32899#true} is VALID [2022-02-20 21:56:01,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume 0 != ~tmp___0~4;#res.base, #res.offset := 0, 0; {32899#true} is VALID [2022-02-20 21:56:01,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #587#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:56:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:01,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {33052#(<= 1 |old(~last_index~0)|)} assume true; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33052#(<= 1 |old(~last_index~0)|)} {33010#(= |old(~last_index~0)| ~last_index~0)} #613#return; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,549 INFO L272 TraceCheckUtils]: 1: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {33052#(<= 1 |old(~last_index~0)|)} assume true; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,554 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33052#(<= 1 |old(~last_index~0)|)} {33010#(= |old(~last_index~0)| ~last_index~0)} #613#return; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {33052#(<= 1 |old(~last_index~0)|)} assume true; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,554 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {33052#(<= 1 |old(~last_index~0)|)} {33010#(= |old(~last_index~0)| ~last_index~0)} #589#return; {33038#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:01,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {33009#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,555 INFO L272 TraceCheckUtils]: 1: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,555 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #583#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,556 INFO L272 TraceCheckUtils]: 7: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,556 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #585#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} assume #t~switch87#1;assume { :begin_inline_skb_pull } true;skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset, skb_pull_#in~arg1#1 := ~skb#1.base, ~skb#1.offset, 1;havoc skb_pull_#res#1.base, skb_pull_#res#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset, skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset, skb_pull_~arg1#1;skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset := skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset;skb_pull_~arg1#1 := skb_pull_#in~arg1#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,557 INFO L272 TraceCheckUtils]: 14: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset := ldv_malloc(1); {33039#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:01,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {33039#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~4;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp___0~4 := #t~nondet41;havoc #t~nondet41; {32899#true} is VALID [2022-02-20 21:56:01,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {32899#true} assume 0 != ~tmp___0~4;#res.base, #res.offset := 0, 0; {32899#true} is VALID [2022-02-20 21:56:01,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,558 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #587#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} skb_pull_#res#1.base, skb_pull_#res#1.offset := skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} #t~ret88#1.base, #t~ret88#1.offset := skb_pull_#res#1.base, skb_pull_#res#1.offset;assume { :end_inline_skb_pull } true;havoc #t~ret88#1.base, #t~ret88#1.offset;assume { :begin_inline_lapb_data_request } true;lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset, lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset := ~dev#1.base, ~dev#1.offset, ~skb#1.base, ~skb#1.offset;havoc lapb_data_request_#res#1;havoc lapb_data_request_#t~nondet149#1, lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset, lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset;lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset := lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset;lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset := lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset;assume -2147483648 <= lapb_data_request_#t~nondet149#1 && lapb_data_request_#t~nondet149#1 <= 2147483647;lapb_data_request_#res#1 := lapb_data_request_#t~nondet149#1;havoc lapb_data_request_#t~nondet149#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} #t~ret89#1 := lapb_data_request_#res#1;assume { :end_inline_lapb_data_request } true;assume -2147483648 <= #t~ret89#1 && #t~ret89#1 <= 2147483647;~result~0#1 := #t~ret89#1;havoc #t~ret89#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} assume 0 != ~result~0#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,560 INFO L272 TraceCheckUtils]: 23: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,561 INFO L272 TraceCheckUtils]: 25: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {33052#(<= 1 |old(~last_index~0)|)} assume true; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,565 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33052#(<= 1 |old(~last_index~0)|)} {33010#(= |old(~last_index~0)| ~last_index~0)} #613#return; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {33052#(<= 1 |old(~last_index~0)|)} assume true; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,566 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {33052#(<= 1 |old(~last_index~0)|)} {33010#(= |old(~last_index~0)| ~last_index~0)} #589#return; {33038#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:01,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {33038#(not (= |old(~last_index~0)| 0))} #res#1 := 0; {33038#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:01,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {33038#(not (= |old(~last_index~0)| 0))} assume true; {33038#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:01,567 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {33038#(not (= |old(~last_index~0)| 0))} {32915#(= ~last_index~0 0)} #625#return; {32900#false} is VALID [2022-02-20 21:56:01,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {32899#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {32899#true} is VALID [2022-02-20 21:56:01,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {32899#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {32899#true} is VALID [2022-02-20 21:56:01,568 INFO L272 TraceCheckUtils]: 2: Hoare triple {32899#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:01,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {32899#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {32994#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:01,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {32899#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L272 TraceCheckUtils]: 9: Hoare triple {32899#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,569 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {32899#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {32899#true} is VALID [2022-02-20 21:56:01,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,570 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {32899#true} {32899#true} #623#return; {32899#true} is VALID [2022-02-20 21:56:01,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {32899#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {32915#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {32915#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {32915#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {32915#(= ~last_index~0 0)} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {32915#(= ~last_index~0 0)} assume main_#t~switch119#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {32915#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {32915#(= ~last_index~0 0)} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1 == main_~tmp___2~1#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {32915#(= ~last_index~0 0)} assume main_#t~switch130#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {32915#(= ~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_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; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {32915#(= ~last_index~0 0)} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {32915#(= ~last_index~0 0)} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret131#1 && main_#t~ret131#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {32915#(= ~last_index~0 0)} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_1 } true;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset, ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset, ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,573 INFO L272 TraceCheckUtils]: 30: Hoare triple {32915#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset := ldv_successful_zalloc(3264); {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:01,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {32899#true} is VALID [2022-02-20 21:56:01,574 INFO L272 TraceCheckUtils]: 32: Hoare triple {32899#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {32994#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:01,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,574 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {32899#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {32899#true} is VALID [2022-02-20 21:56:01,574 INFO L272 TraceCheckUtils]: 37: Hoare triple {32899#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,575 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {32899#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {32899#true} is VALID [2022-02-20 21:56:01,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,575 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {32899#true} {32915#(= ~last_index~0 0)} #639#return; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {32915#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset := ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,580 INFO L272 TraceCheckUtils]: 46: Hoare triple {32915#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset := ldv_successful_zalloc(232); {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:01,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {32986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {32899#true} is VALID [2022-02-20 21:56:01,581 INFO L272 TraceCheckUtils]: 48: Hoare triple {32899#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {32994#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:01,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {32994#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {32899#true} is VALID [2022-02-20 21:56:01,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,581 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32899#true} {32899#true} #597#return; {32899#true} is VALID [2022-02-20 21:56:01,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {32899#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {32899#true} is VALID [2022-02-20 21:56:01,581 INFO L272 TraceCheckUtils]: 53: Hoare triple {32899#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,582 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {32899#true} {32899#true} #599#return; {32899#true} is VALID [2022-02-20 21:56:01,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {32899#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {32899#true} is VALID [2022-02-20 21:56:01,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,583 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {32899#true} {32915#(= ~last_index~0 0)} #641#return; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {32915#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {32915#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_hdlc_proto_1 } true; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {32915#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_1~0); {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {32915#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {32915#(= ~last_index~0 0)} assume main_#t~switch119#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,586 INFO L290 TraceCheckUtils]: 66: Hoare triple {32915#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet120#1 && main_#t~nondet120#1 <= 2147483647;main_~tmp___1~4#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1;main_#t~switch121#1 := 0 == main_~tmp___1~4#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,586 INFO L290 TraceCheckUtils]: 67: Hoare triple {32915#(= ~last_index~0 0)} assume main_#t~switch121#1; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {32915#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_1~0; {32915#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:01,588 INFO L272 TraceCheckUtils]: 69: Hoare triple {32915#(= ~last_index~0 0)} call main_#t~ret122#1 := x25_xmit(~proto_group0~0.base, ~proto_group0~0.offset, ~proto_group1~0.base, ~proto_group1~0.offset); {33009#(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:01,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {33009#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,588 INFO L272 TraceCheckUtils]: 71: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,589 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #583#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,590 INFO L272 TraceCheckUtils]: 77: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {32899#true} is VALID [2022-02-20 21:56:01,590 INFO L290 TraceCheckUtils]: 78: Hoare triple {32899#true} ~cond := #in~cond; {32899#true} is VALID [2022-02-20 21:56:01,590 INFO L290 TraceCheckUtils]: 79: Hoare triple {32899#true} assume !(0 == ~cond); {32899#true} is VALID [2022-02-20 21:56:01,590 INFO L290 TraceCheckUtils]: 80: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,591 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #585#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,591 INFO L290 TraceCheckUtils]: 82: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,591 INFO L290 TraceCheckUtils]: 83: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} assume #t~switch87#1;assume { :begin_inline_skb_pull } true;skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset, skb_pull_#in~arg1#1 := ~skb#1.base, ~skb#1.offset, 1;havoc skb_pull_#res#1.base, skb_pull_#res#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset, skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset, skb_pull_~arg1#1;skb_pull_~arg0#1.base, skb_pull_~arg0#1.offset := skb_pull_#in~arg0#1.base, skb_pull_#in~arg0#1.offset;skb_pull_~arg1#1 := skb_pull_#in~arg1#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,592 INFO L272 TraceCheckUtils]: 84: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset := ldv_malloc(1); {33039#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:01,592 INFO L290 TraceCheckUtils]: 85: Hoare triple {33039#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~4;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp___0~4 := #t~nondet41;havoc #t~nondet41; {32899#true} is VALID [2022-02-20 21:56:01,592 INFO L290 TraceCheckUtils]: 86: Hoare triple {32899#true} assume 0 != ~tmp___0~4;#res.base, #res.offset := 0, 0; {32899#true} is VALID [2022-02-20 21:56:01,592 INFO L290 TraceCheckUtils]: 87: Hoare triple {32899#true} assume true; {32899#true} is VALID [2022-02-20 21:56:01,593 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {32899#true} {33010#(= |old(~last_index~0)| ~last_index~0)} #587#return; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} skb_pull_#res#1.base, skb_pull_#res#1.offset := skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset;havoc skb_pull_#t~ret156#1.base, skb_pull_#t~ret156#1.offset; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,593 INFO L290 TraceCheckUtils]: 90: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} #t~ret88#1.base, #t~ret88#1.offset := skb_pull_#res#1.base, skb_pull_#res#1.offset;assume { :end_inline_skb_pull } true;havoc #t~ret88#1.base, #t~ret88#1.offset;assume { :begin_inline_lapb_data_request } true;lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset, lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset := ~dev#1.base, ~dev#1.offset, ~skb#1.base, ~skb#1.offset;havoc lapb_data_request_#res#1;havoc lapb_data_request_#t~nondet149#1, lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset, lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset;lapb_data_request_~arg0#1.base, lapb_data_request_~arg0#1.offset := lapb_data_request_#in~arg0#1.base, lapb_data_request_#in~arg0#1.offset;lapb_data_request_~arg1#1.base, lapb_data_request_~arg1#1.offset := lapb_data_request_#in~arg1#1.base, lapb_data_request_#in~arg1#1.offset;assume -2147483648 <= lapb_data_request_#t~nondet149#1 && lapb_data_request_#t~nondet149#1 <= 2147483647;lapb_data_request_#res#1 := lapb_data_request_#t~nondet149#1;havoc lapb_data_request_#t~nondet149#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,594 INFO L290 TraceCheckUtils]: 91: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} #t~ret89#1 := lapb_data_request_#res#1;assume { :end_inline_lapb_data_request } true;assume -2147483648 <= #t~ret89#1 && #t~ret89#1 <= 2147483647;~result~0#1 := #t~ret89#1;havoc #t~ret89#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,594 INFO L290 TraceCheckUtils]: 92: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} assume 0 != ~result~0#1; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,595 INFO L272 TraceCheckUtils]: 93: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,595 INFO L290 TraceCheckUtils]: 94: Hoare triple {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {33010#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:01,596 INFO L272 TraceCheckUtils]: 95: Hoare triple {33010#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,596 INFO L290 TraceCheckUtils]: 96: Hoare triple {33040#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,597 INFO L290 TraceCheckUtils]: 97: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,597 INFO L290 TraceCheckUtils]: 98: Hoare triple {33053#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,597 INFO L290 TraceCheckUtils]: 99: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,598 INFO L290 TraceCheckUtils]: 100: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,598 INFO L290 TraceCheckUtils]: 101: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,599 INFO L290 TraceCheckUtils]: 102: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,599 INFO L290 TraceCheckUtils]: 103: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:01,600 INFO L290 TraceCheckUtils]: 104: Hoare triple {33054#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,600 INFO L290 TraceCheckUtils]: 105: Hoare triple {33052#(<= 1 |old(~last_index~0)|)} assume true; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,601 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {33052#(<= 1 |old(~last_index~0)|)} {33010#(= |old(~last_index~0)| ~last_index~0)} #613#return; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,601 INFO L290 TraceCheckUtils]: 107: Hoare triple {33052#(<= 1 |old(~last_index~0)|)} assume true; {33052#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:56:01,601 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {33052#(<= 1 |old(~last_index~0)|)} {33010#(= |old(~last_index~0)| ~last_index~0)} #589#return; {33038#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:01,602 INFO L290 TraceCheckUtils]: 109: Hoare triple {33038#(not (= |old(~last_index~0)| 0))} #res#1 := 0; {33038#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:01,602 INFO L290 TraceCheckUtils]: 110: Hoare triple {33038#(not (= |old(~last_index~0)| 0))} assume true; {33038#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:01,603 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {33038#(not (= |old(~last_index~0)| 0))} {32915#(= ~last_index~0 0)} #625#return; {32900#false} is VALID [2022-02-20 21:56:01,603 INFO L290 TraceCheckUtils]: 112: Hoare triple {32900#false} assume -2147483648 <= main_#t~ret122#1 && main_#t~ret122#1 <= 2147483647;havoc main_#t~ret122#1;~ldv_state_variable_1~0 := 1; {32900#false} is VALID [2022-02-20 21:56:01,603 INFO L290 TraceCheckUtils]: 113: Hoare triple {32900#false} assume !(2 == ~ldv_state_variable_1~0); {32900#false} is VALID [2022-02-20 21:56:01,603 INFO L290 TraceCheckUtils]: 114: Hoare triple {32900#false} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {32900#false} is VALID [2022-02-20 21:56:01,603 INFO L290 TraceCheckUtils]: 115: Hoare triple {32900#false} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 116: Hoare triple {32900#false} assume main_#t~switch119#1; {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 117: Hoare triple {32900#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 118: Hoare triple {32900#false} assume main_#t~switch130#1; {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 119: Hoare triple {32900#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; {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 120: Hoare triple {32900#false} assume { :end_inline_unregister_hdlc_protocol } true; {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 121: Hoare triple {32900#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 122: Hoare triple {32900#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {32900#false} is VALID [2022-02-20 21:56:01,604 INFO L290 TraceCheckUtils]: 123: Hoare triple {32900#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {32900#false} is VALID [2022-02-20 21:56:01,605 INFO L290 TraceCheckUtils]: 124: Hoare triple {32900#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {32900#false} is VALID [2022-02-20 21:56:01,605 INFO L272 TraceCheckUtils]: 125: Hoare triple {32900#false} call ldv_error(); {32900#false} is VALID [2022-02-20 21:56:01,605 INFO L290 TraceCheckUtils]: 126: Hoare triple {32900#false} assume !false; {32900#false} is VALID [2022-02-20 21:56:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-02-20 21:56:01,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:01,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246623055] [2022-02-20 21:56:01,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246623055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:01,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:01,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 21:56:01,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29469122] [2022-02-20 21:56:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 127 [2022-02-20 21:56:01,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:01,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:01,677 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:01,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 21:56:01,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:01,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 21:56:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:56:01,678 INFO L87 Difference]: Start difference. First operand 1670 states and 2216 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:08,386 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2022-02-20 21:56:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 21:56:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 127 [2022-02-20 21:56:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1252 transitions. [2022-02-20 21:56:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1252 transitions. [2022-02-20 21:56:08,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 1252 transitions. [2022-02-20 21:56:09,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1252 edges. 1252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:09,684 INFO L225 Difference]: With dead ends: 4250 [2022-02-20 21:56:09,684 INFO L226 Difference]: Without dead ends: 2586 [2022-02-20 21:56:09,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-02-20 21:56:09,688 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 1409 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:09,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 1782 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 21:56:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-02-20 21:56:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2022-02-20 21:56:09,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:09,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2586 states. Second operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) [2022-02-20 21:56:09,804 INFO L74 IsIncluded]: Start isIncluded. First operand 2586 states. Second operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) [2022-02-20 21:56:09,805 INFO L87 Difference]: Start difference. First operand 2586 states. Second operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) [2022-02-20 21:56:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:09,988 INFO L93 Difference]: Finished difference Result 2586 states and 3400 transitions. [2022-02-20 21:56:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3400 transitions. [2022-02-20 21:56:09,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:09,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:09,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) Second operand 2586 states. [2022-02-20 21:56:09,996 INFO L87 Difference]: Start difference. First operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) Second operand 2586 states. [2022-02-20 21:56:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:10,198 INFO L93 Difference]: Finished difference Result 2586 states and 3400 transitions. [2022-02-20 21:56:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3400 transitions. [2022-02-20 21:56:10,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:10,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:10,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:10,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) [2022-02-20 21:56:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2022-02-20 21:56:10,335 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2022-02-20 21:56:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:10,336 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2022-02-20 21:56:10,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2022-02-20 21:56:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-02-20 21:56:10,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:10,339 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:10,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:56:10,340 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash -239915446, now seen corresponding path program 1 times [2022-02-20 21:56:10,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:10,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070137378] [2022-02-20 21:56:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,443 INFO L272 TraceCheckUtils]: 1: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,443 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,443 INFO L272 TraceCheckUtils]: 6: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {46450#true} {46450#true} #623#return; {46450#true} is VALID [2022-02-20 21:56:10,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:56:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,459 INFO L272 TraceCheckUtils]: 1: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,459 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,461 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {46450#true} {46466#(= ~last_index~0 0)} #639#return; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,477 INFO L272 TraceCheckUtils]: 1: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,477 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,477 INFO L272 TraceCheckUtils]: 6: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,478 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {46450#true} {46466#(= ~last_index~0 0)} #641#return; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:56:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #583#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:56:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #585#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 21:56:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,624 INFO L272 TraceCheckUtils]: 1: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,624 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,626 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #581#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {46584#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,627 INFO L272 TraceCheckUtils]: 1: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:10,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,627 INFO L272 TraceCheckUtils]: 3: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L272 TraceCheckUtils]: 8: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,629 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #581#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !false; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume true; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,632 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #615#return; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {46584#(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))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~reason#1 := #in~reason#1;~code#1 := #in~code#1;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~ptr~0#1.base, ~ptr~0#1.offset;assume { :begin_inline_ldv_dev_alloc_skb_12 } true;ldv_dev_alloc_skb_12_#in~length#1 := 1;havoc ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset, ldv_dev_alloc_skb_12_~length#1, ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset;ldv_dev_alloc_skb_12_~length#1 := ldv_dev_alloc_skb_12_#in~length#1;havoc ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,634 INFO L272 TraceCheckUtils]: 1: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset := ldv_skb_alloc(); {46584#(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:10,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {46584#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,634 INFO L272 TraceCheckUtils]: 3: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:10,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,635 INFO L272 TraceCheckUtils]: 5: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L272 TraceCheckUtils]: 10: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,637 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #581#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !false; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume true; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,640 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #615#return; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset := ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset := ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} #t~ret68#1.base, #t~ret68#1.offset := ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;assume { :end_inline_ldv_dev_alloc_skb_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret68#1.base, #t~ret68#1.offset;havoc #t~ret68#1.base, #t~ret68#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume 0 == (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616;havoc #t~nondet69#1; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume true; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,641 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #593#return; {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} is VALID [2022-02-20 21:56:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:56:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:10,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume !(-1 != ~deleted_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume true; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,684 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {46690#(<= |old(~last_index~0)| 0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #613#return; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,685 INFO L272 TraceCheckUtils]: 1: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume !(-1 != ~deleted_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume true; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,687 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {46690#(<= |old(~last_index~0)| 0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #613#return; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume true; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,688 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {46690#(<= |old(~last_index~0)| 0)} {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} #595#return; {46636#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:10,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {46584#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,689 INFO L272 TraceCheckUtils]: 1: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,689 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #583#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,690 INFO L272 TraceCheckUtils]: 7: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,691 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #585#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 1 == #t~mem86#1 % 256; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 2 == #t~mem86#1 % 256; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume #t~switch87#1;assume { :begin_inline_lapb_disconnect_request } true;lapb_disconnect_request_#in~arg0#1.base, lapb_disconnect_request_#in~arg0#1.offset := ~dev#1.base, ~dev#1.offset;havoc lapb_disconnect_request_#res#1;havoc lapb_disconnect_request_#t~nondet150#1, lapb_disconnect_request_~arg0#1.base, lapb_disconnect_request_~arg0#1.offset;lapb_disconnect_request_~arg0#1.base, lapb_disconnect_request_~arg0#1.offset := lapb_disconnect_request_#in~arg0#1.base, lapb_disconnect_request_#in~arg0#1.offset;assume -2147483648 <= lapb_disconnect_request_#t~nondet150#1 && lapb_disconnect_request_#t~nondet150#1 <= 2147483647;lapb_disconnect_request_#res#1 := lapb_disconnect_request_#t~nondet150#1;havoc lapb_disconnect_request_#t~nondet150#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} #t~ret92#1 := lapb_disconnect_request_#res#1;assume { :end_inline_lapb_disconnect_request } true;assume -2147483648 <= #t~ret92#1 && #t~ret92#1 <= 2147483647;~result~0#1 := #t~ret92#1;havoc #t~ret92#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume 0 != ~result~0#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume 4 == ~result~0#1;assume { :begin_inline_x25_disconnected } true;x25_disconnected_#in~dev#1.base, x25_disconnected_#in~dev#1.offset, x25_disconnected_#in~reason#1 := ~dev#1.base, ~dev#1.offset, 0;havoc x25_disconnected_~dev#1.base, x25_disconnected_~dev#1.offset, x25_disconnected_~reason#1;x25_disconnected_~dev#1.base, x25_disconnected_~dev#1.offset := x25_disconnected_#in~dev#1.base, x25_disconnected_#in~dev#1.offset;x25_disconnected_~reason#1 := x25_disconnected_#in~reason#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call x25_connect_disconnect(x25_disconnected_~dev#1.base, x25_disconnected_~dev#1.offset, x25_disconnected_~reason#1, 2); {46584#(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:10,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {46584#(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))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~reason#1 := #in~reason#1;~code#1 := #in~code#1;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~ptr~0#1.base, ~ptr~0#1.offset;assume { :begin_inline_ldv_dev_alloc_skb_12 } true;ldv_dev_alloc_skb_12_#in~length#1 := 1;havoc ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset, ldv_dev_alloc_skb_12_~length#1, ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset;ldv_dev_alloc_skb_12_~length#1 := ldv_dev_alloc_skb_12_#in~length#1;havoc ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,694 INFO L272 TraceCheckUtils]: 21: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset := ldv_skb_alloc(); {46584#(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:10,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {46584#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,695 INFO L272 TraceCheckUtils]: 23: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:10,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L272 TraceCheckUtils]: 25: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L272 TraceCheckUtils]: 30: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,697 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,697 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #581#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !false; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume true; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,700 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #615#return; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset := ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset := ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} #t~ret68#1.base, #t~ret68#1.offset := ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;assume { :end_inline_ldv_dev_alloc_skb_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret68#1.base, #t~ret68#1.offset;havoc #t~ret68#1.base, #t~ret68#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume 0 == (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616;havoc #t~nondet69#1; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume true; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,702 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #593#return; {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} is VALID [2022-02-20 21:56:10,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} assume { :end_inline_x25_disconnected } true; {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} is VALID [2022-02-20 21:56:10,703 INFO L272 TraceCheckUtils]: 52: Hoare triple {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,704 INFO L272 TraceCheckUtils]: 54: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume !(-1 != ~deleted_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume true; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,706 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {46690#(<= |old(~last_index~0)| 0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #613#return; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume true; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,707 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {46690#(<= |old(~last_index~0)| 0)} {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} #595#return; {46636#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:10,707 INFO L290 TraceCheckUtils]: 63: Hoare triple {46636#(not (= |old(~last_index~0)| 0))} #res#1 := 0; {46636#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:10,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {46636#(not (= |old(~last_index~0)| 0))} assume true; {46636#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:10,708 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {46636#(not (= |old(~last_index~0)| 0))} {46466#(= ~last_index~0 0)} #625#return; {46451#false} is VALID [2022-02-20 21:56:10,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {46450#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {46450#true} is VALID [2022-02-20 21:56:10,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {46450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {46450#true} is VALID [2022-02-20 21:56:10,709 INFO L272 TraceCheckUtils]: 2: Hoare triple {46450#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:10,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,710 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,710 INFO L272 TraceCheckUtils]: 9: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {46450#true} {46450#true} #623#return; {46450#true} is VALID [2022-02-20 21:56:10,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {46450#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {46466#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {46466#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {46466#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {46466#(= ~last_index~0 0)} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {46466#(= ~last_index~0 0)} assume main_#t~switch119#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {46466#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {46466#(= ~last_index~0 0)} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1 == main_~tmp___2~1#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {46466#(= ~last_index~0 0)} assume main_#t~switch130#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {46466#(= ~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_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; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {46466#(= ~last_index~0 0)} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {46466#(= ~last_index~0 0)} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret131#1 && main_#t~ret131#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {46466#(= ~last_index~0 0)} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_1 } true;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset, ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset, ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,715 INFO L272 TraceCheckUtils]: 30: Hoare triple {46466#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset := ldv_successful_zalloc(3264); {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:10,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,716 INFO L272 TraceCheckUtils]: 32: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,716 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,716 INFO L272 TraceCheckUtils]: 37: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,717 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,718 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {46450#true} {46466#(= ~last_index~0 0)} #639#return; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {46466#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset := ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,718 INFO L272 TraceCheckUtils]: 46: Hoare triple {46466#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset := ldv_successful_zalloc(232); {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:10,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,719 INFO L272 TraceCheckUtils]: 48: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,719 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,720 INFO L272 TraceCheckUtils]: 53: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,720 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,721 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {46450#true} {46466#(= ~last_index~0 0)} #641#return; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {46466#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {46466#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_hdlc_proto_1 } true; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {46466#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_1~0); {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,722 INFO L290 TraceCheckUtils]: 64: Hoare triple {46466#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {46466#(= ~last_index~0 0)} assume main_#t~switch119#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {46466#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet120#1 && main_#t~nondet120#1 <= 2147483647;main_~tmp___1~4#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1;main_#t~switch121#1 := 0 == main_~tmp___1~4#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {46466#(= ~last_index~0 0)} assume main_#t~switch121#1; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,723 INFO L290 TraceCheckUtils]: 68: Hoare triple {46466#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_1~0; {46466#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:10,724 INFO L272 TraceCheckUtils]: 69: Hoare triple {46466#(= ~last_index~0 0)} call main_#t~ret122#1 := x25_xmit(~proto_group0~0.base, ~proto_group0~0.offset, ~proto_group1~0.base, ~proto_group1~0.offset); {46584#(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:10,724 INFO L290 TraceCheckUtils]: 70: Hoare triple {46584#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,724 INFO L272 TraceCheckUtils]: 71: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,724 INFO L290 TraceCheckUtils]: 72: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,724 INFO L290 TraceCheckUtils]: 73: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,725 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #583#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,725 INFO L272 TraceCheckUtils]: 77: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,725 INFO L290 TraceCheckUtils]: 78: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,725 INFO L290 TraceCheckUtils]: 79: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,725 INFO L290 TraceCheckUtils]: 80: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,726 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #585#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,726 INFO L290 TraceCheckUtils]: 82: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,726 INFO L290 TraceCheckUtils]: 83: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 1 == #t~mem86#1 % 256; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,727 INFO L290 TraceCheckUtils]: 84: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 2 == #t~mem86#1 % 256; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,727 INFO L290 TraceCheckUtils]: 85: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume #t~switch87#1;assume { :begin_inline_lapb_disconnect_request } true;lapb_disconnect_request_#in~arg0#1.base, lapb_disconnect_request_#in~arg0#1.offset := ~dev#1.base, ~dev#1.offset;havoc lapb_disconnect_request_#res#1;havoc lapb_disconnect_request_#t~nondet150#1, lapb_disconnect_request_~arg0#1.base, lapb_disconnect_request_~arg0#1.offset;lapb_disconnect_request_~arg0#1.base, lapb_disconnect_request_~arg0#1.offset := lapb_disconnect_request_#in~arg0#1.base, lapb_disconnect_request_#in~arg0#1.offset;assume -2147483648 <= lapb_disconnect_request_#t~nondet150#1 && lapb_disconnect_request_#t~nondet150#1 <= 2147483647;lapb_disconnect_request_#res#1 := lapb_disconnect_request_#t~nondet150#1;havoc lapb_disconnect_request_#t~nondet150#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,727 INFO L290 TraceCheckUtils]: 86: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} #t~ret92#1 := lapb_disconnect_request_#res#1;assume { :end_inline_lapb_disconnect_request } true;assume -2147483648 <= #t~ret92#1 && #t~ret92#1 <= 2147483647;~result~0#1 := #t~ret92#1;havoc #t~ret92#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume 0 != ~result~0#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,728 INFO L290 TraceCheckUtils]: 88: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume 4 == ~result~0#1;assume { :begin_inline_x25_disconnected } true;x25_disconnected_#in~dev#1.base, x25_disconnected_#in~dev#1.offset, x25_disconnected_#in~reason#1 := ~dev#1.base, ~dev#1.offset, 0;havoc x25_disconnected_~dev#1.base, x25_disconnected_~dev#1.offset, x25_disconnected_~reason#1;x25_disconnected_~dev#1.base, x25_disconnected_~dev#1.offset := x25_disconnected_#in~dev#1.base, x25_disconnected_#in~dev#1.offset;x25_disconnected_~reason#1 := x25_disconnected_#in~reason#1; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,728 INFO L272 TraceCheckUtils]: 89: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call x25_connect_disconnect(x25_disconnected_~dev#1.base, x25_disconnected_~dev#1.offset, x25_disconnected_~reason#1, 2); {46584#(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:10,729 INFO L290 TraceCheckUtils]: 90: Hoare triple {46584#(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))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~reason#1 := #in~reason#1;~code#1 := #in~code#1;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~ptr~0#1.base, ~ptr~0#1.offset;assume { :begin_inline_ldv_dev_alloc_skb_12 } true;ldv_dev_alloc_skb_12_#in~length#1 := 1;havoc ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset, ldv_dev_alloc_skb_12_~length#1, ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset;ldv_dev_alloc_skb_12_~length#1 := ldv_dev_alloc_skb_12_#in~length#1;havoc ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,729 INFO L272 TraceCheckUtils]: 91: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset := ldv_skb_alloc(); {46584#(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:10,729 INFO L290 TraceCheckUtils]: 92: Hoare triple {46584#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,730 INFO L272 TraceCheckUtils]: 93: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:10,730 INFO L290 TraceCheckUtils]: 94: Hoare triple {46561#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {46450#true} is VALID [2022-02-20 21:56:10,730 INFO L272 TraceCheckUtils]: 95: Hoare triple {46450#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {46569#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:10,731 INFO L290 TraceCheckUtils]: 96: Hoare triple {46569#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {46450#true} is VALID [2022-02-20 21:56:10,731 INFO L290 TraceCheckUtils]: 97: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,731 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {46450#true} {46450#true} #597#return; {46450#true} is VALID [2022-02-20 21:56:10,731 INFO L290 TraceCheckUtils]: 99: Hoare triple {46450#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {46450#true} is VALID [2022-02-20 21:56:10,731 INFO L272 TraceCheckUtils]: 100: Hoare triple {46450#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {46450#true} is VALID [2022-02-20 21:56:10,731 INFO L290 TraceCheckUtils]: 101: Hoare triple {46450#true} ~cond := #in~cond; {46450#true} is VALID [2022-02-20 21:56:10,731 INFO L290 TraceCheckUtils]: 102: Hoare triple {46450#true} assume !(0 == ~cond); {46450#true} is VALID [2022-02-20 21:56:10,731 INFO L290 TraceCheckUtils]: 103: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,732 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {46450#true} {46450#true} #599#return; {46450#true} is VALID [2022-02-20 21:56:10,732 INFO L290 TraceCheckUtils]: 105: Hoare triple {46450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {46450#true} is VALID [2022-02-20 21:56:10,732 INFO L290 TraceCheckUtils]: 106: Hoare triple {46450#true} assume true; {46450#true} is VALID [2022-02-20 21:56:10,732 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {46450#true} {46585#(= |old(~last_index~0)| ~last_index~0)} #581#return; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,732 INFO L290 TraceCheckUtils]: 108: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,733 INFO L290 TraceCheckUtils]: 110: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !false; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,733 INFO L290 TraceCheckUtils]: 111: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,734 INFO L290 TraceCheckUtils]: 112: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,734 INFO L290 TraceCheckUtils]: 113: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,734 INFO L290 TraceCheckUtils]: 114: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume true; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,735 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #615#return; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,735 INFO L290 TraceCheckUtils]: 116: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset := ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset := ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,735 INFO L290 TraceCheckUtils]: 117: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} #t~ret68#1.base, #t~ret68#1.offset := ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;assume { :end_inline_ldv_dev_alloc_skb_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret68#1.base, #t~ret68#1.offset;havoc #t~ret68#1.base, #t~ret68#1.offset; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,736 INFO L290 TraceCheckUtils]: 118: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume 0 == (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616;havoc #t~nondet69#1; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} assume true; {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} is VALID [2022-02-20 21:56:10,737 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {46661#(<= (+ |old(~last_index~0)| 1) ~last_index~0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #593#return; {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} is VALID [2022-02-20 21:56:10,737 INFO L290 TraceCheckUtils]: 121: Hoare triple {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} assume { :end_inline_x25_disconnected } true; {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} is VALID [2022-02-20 21:56:10,737 INFO L272 TraceCheckUtils]: 122: Hoare triple {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,738 INFO L290 TraceCheckUtils]: 123: Hoare triple {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {46585#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:56:10,738 INFO L272 TraceCheckUtils]: 124: Hoare triple {46585#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,739 INFO L290 TraceCheckUtils]: 125: Hoare triple {46683#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,739 INFO L290 TraceCheckUtils]: 126: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:10,739 INFO L290 TraceCheckUtils]: 127: Hoare triple {46691#(and (<= ldv_set_remove_~i~1 0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,740 INFO L290 TraceCheckUtils]: 128: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume !(-1 != ~deleted_index~0); {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,740 INFO L290 TraceCheckUtils]: 129: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume true; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,741 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {46690#(<= |old(~last_index~0)| 0)} {46585#(= |old(~last_index~0)| ~last_index~0)} #613#return; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,741 INFO L290 TraceCheckUtils]: 131: Hoare triple {46690#(<= |old(~last_index~0)| 0)} assume true; {46690#(<= |old(~last_index~0)| 0)} is VALID [2022-02-20 21:56:10,741 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {46690#(<= |old(~last_index~0)| 0)} {46625#(or (not (= |old(~last_index~0)| 0)) (<= 1 ~last_index~0))} #595#return; {46636#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:10,742 INFO L290 TraceCheckUtils]: 133: Hoare triple {46636#(not (= |old(~last_index~0)| 0))} #res#1 := 0; {46636#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:10,742 INFO L290 TraceCheckUtils]: 134: Hoare triple {46636#(not (= |old(~last_index~0)| 0))} assume true; {46636#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:56:10,742 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {46636#(not (= |old(~last_index~0)| 0))} {46466#(= ~last_index~0 0)} #625#return; {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 136: Hoare triple {46451#false} assume -2147483648 <= main_#t~ret122#1 && main_#t~ret122#1 <= 2147483647;havoc main_#t~ret122#1;~ldv_state_variable_1~0 := 1; {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 137: Hoare triple {46451#false} assume !(2 == ~ldv_state_variable_1~0); {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 138: Hoare triple {46451#false} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 139: Hoare triple {46451#false} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 140: Hoare triple {46451#false} assume main_#t~switch119#1; {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 141: Hoare triple {46451#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 142: Hoare triple {46451#false} assume main_#t~switch130#1; {46451#false} is VALID [2022-02-20 21:56:10,743 INFO L290 TraceCheckUtils]: 143: Hoare triple {46451#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; {46451#false} is VALID [2022-02-20 21:56:10,744 INFO L290 TraceCheckUtils]: 144: Hoare triple {46451#false} assume { :end_inline_unregister_hdlc_protocol } true; {46451#false} is VALID [2022-02-20 21:56:10,744 INFO L290 TraceCheckUtils]: 145: Hoare triple {46451#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {46451#false} is VALID [2022-02-20 21:56:10,744 INFO L290 TraceCheckUtils]: 146: Hoare triple {46451#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {46451#false} is VALID [2022-02-20 21:56:10,744 INFO L290 TraceCheckUtils]: 147: Hoare triple {46451#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {46451#false} is VALID [2022-02-20 21:56:10,744 INFO L290 TraceCheckUtils]: 148: Hoare triple {46451#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {46451#false} is VALID [2022-02-20 21:56:10,744 INFO L272 TraceCheckUtils]: 149: Hoare triple {46451#false} call ldv_error(); {46451#false} is VALID [2022-02-20 21:56:10,744 INFO L290 TraceCheckUtils]: 150: Hoare triple {46451#false} assume !false; {46451#false} is VALID [2022-02-20 21:56:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-02-20 21:56:10,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:10,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070137378] [2022-02-20 21:56:10,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070137378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:10,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:10,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 21:56:10,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040250093] [2022-02-20 21:56:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:10,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) Word has length 151 [2022-02-20 21:56:10,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:10,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 21:56:10,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:10,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 21:56:10,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 21:56:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:56:10,820 INFO L87 Difference]: Start difference. First operand 1698 states and 2192 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 21:56:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:19,843 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2022-02-20 21:56:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-20 21:56:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) Word has length 151 [2022-02-20 21:56:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 21:56:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1720 transitions. [2022-02-20 21:56:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 21:56:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1720 transitions. [2022-02-20 21:56:19,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 1720 transitions. [2022-02-20 21:56:21,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1720 edges. 1720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:21,863 INFO L225 Difference]: With dead ends: 4534 [2022-02-20 21:56:21,864 INFO L226 Difference]: Without dead ends: 3606 [2022-02-20 21:56:21,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 21:56:21,867 INFO L933 BasicCegarLoop]: 515 mSDtfsCounter, 1226 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:21,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1266 Valid, 2853 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 21:56:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-02-20 21:56:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2022-02-20 21:56:22,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:22,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3606 states. Second operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:22,242 INFO L74 IsIncluded]: Start isIncluded. First operand 3606 states. Second operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:22,244 INFO L87 Difference]: Start difference. First operand 3606 states. Second operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:22,607 INFO L93 Difference]: Finished difference Result 3606 states and 4964 transitions. [2022-02-20 21:56:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 4964 transitions. [2022-02-20 21:56:22,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:22,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:22,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) Second operand 3606 states. [2022-02-20 21:56:22,622 INFO L87 Difference]: Start difference. First operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) Second operand 3606 states. [2022-02-20 21:56:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:22,995 INFO L93 Difference]: Finished difference Result 3606 states and 4964 transitions. [2022-02-20 21:56:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 4964 transitions. [2022-02-20 21:56:23,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:23,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:23,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:23,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2022-02-20 21:56:23,222 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 151 [2022-02-20 21:56:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:23,223 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2022-02-20 21:56:23,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 21:56:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2022-02-20 21:56:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-02-20 21:56:23,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:23,226 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:23,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 21:56:23,227 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1665675225, now seen corresponding path program 1 times [2022-02-20 21:56:23,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:23,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756582022] [2022-02-20 21:56:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,297 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,297 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,304 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {63104#true} {63104#true} #623#return; {63104#true} is VALID [2022-02-20 21:56:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:56:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,325 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,325 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,326 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {63104#true} {63104#true} #639#return; {63104#true} is VALID [2022-02-20 21:56:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,338 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,340 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {63104#true} {63104#true} #641#return; {63104#true} is VALID [2022-02-20 21:56:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:56:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63104#true} {63104#true} #583#return; {63104#true} is VALID [2022-02-20 21:56:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:56:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63104#true} {63104#true} #585#return; {63104#true} is VALID [2022-02-20 21:56:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:56:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:56:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,408 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,410 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {63104#true} {63104#true} #581#return; {63104#true} is VALID [2022-02-20 21:56:23,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {63238#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,411 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:23,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,411 INFO L272 TraceCheckUtils]: 3: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L272 TraceCheckUtils]: 8: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,412 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {63104#true} {63104#true} #581#return; {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {63104#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {63104#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {63104#true} assume !false; {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {63104#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {63104#true} is VALID [2022-02-20 21:56:23,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {63104#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; {63104#true} is VALID [2022-02-20 21:56:23,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {63104#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,414 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {63104#true} {63104#true} #615#return; {63104#true} is VALID [2022-02-20 21:56:23,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {63238#(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))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~reason#1 := #in~reason#1;~code#1 := #in~code#1;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~ptr~0#1.base, ~ptr~0#1.offset;assume { :begin_inline_ldv_dev_alloc_skb_12 } true;ldv_dev_alloc_skb_12_#in~length#1 := 1;havoc ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset, ldv_dev_alloc_skb_12_~length#1, ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset;ldv_dev_alloc_skb_12_~length#1 := ldv_dev_alloc_skb_12_#in~length#1;havoc ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,415 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset := ldv_skb_alloc(); {63238#(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:23,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {63238#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,415 INFO L272 TraceCheckUtils]: 3: Hoare triple {63104#true} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:23,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,416 INFO L272 TraceCheckUtils]: 5: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,416 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L272 TraceCheckUtils]: 10: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {63104#true} {63104#true} #581#return; {63104#true} is VALID [2022-02-20 21:56:23,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {63104#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {63104#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {63104#true} is VALID [2022-02-20 21:56:23,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {63104#true} assume !false; {63104#true} is VALID [2022-02-20 21:56:23,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {63104#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {63104#true} is VALID [2022-02-20 21:56:23,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {63104#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; {63104#true} is VALID [2022-02-20 21:56:23,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {63104#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,419 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {63104#true} {63104#true} #615#return; {63104#true} is VALID [2022-02-20 21:56:23,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {63104#true} ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset := ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset := ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {63104#true} #t~ret68#1.base, #t~ret68#1.offset := ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;assume { :end_inline_ldv_dev_alloc_skb_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret68#1.base, #t~ret68#1.offset;havoc #t~ret68#1.base, #t~ret68#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {63104#true} assume 0 == (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616;havoc #t~nondet69#1; {63104#true} is VALID [2022-02-20 21:56:23,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,419 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {63104#true} {63104#true} #591#return; {63104#true} is VALID [2022-02-20 21:56:23,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 21:56:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:23,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume !false; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume ~i~1 < ~last_index~0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {63345#(<= 0 ldv_set_remove_~deleted_index~0)} is VALID [2022-02-20 21:56:23,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {63345#(<= 0 ldv_set_remove_~deleted_index~0)} assume !(-1 != ~deleted_index~0); {63105#false} is VALID [2022-02-20 21:56:23,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,453 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {63105#false} {63104#true} #613#return; {63105#false} is VALID [2022-02-20 21:56:23,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {63104#true} is VALID [2022-02-20 21:56:23,454 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:23,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume !false; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume ~i~1 < ~last_index~0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {63345#(<= 0 ldv_set_remove_~deleted_index~0)} is VALID [2022-02-20 21:56:23,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {63345#(<= 0 ldv_set_remove_~deleted_index~0)} assume !(-1 != ~deleted_index~0); {63105#false} is VALID [2022-02-20 21:56:23,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,456 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {63105#false} {63104#true} #613#return; {63105#false} is VALID [2022-02-20 21:56:23,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,456 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {63105#false} {63104#true} #595#return; {63105#false} is VALID [2022-02-20 21:56:23,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {63238#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {63104#true} is VALID [2022-02-20 21:56:23,457 INFO L272 TraceCheckUtils]: 1: Hoare triple {63104#true} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,457 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {63104#true} {63104#true} #583#return; {63104#true} is VALID [2022-02-20 21:56:23,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {63104#true} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {63104#true} is VALID [2022-02-20 21:56:23,457 INFO L272 TraceCheckUtils]: 7: Hoare triple {63104#true} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {63104#true} {63104#true} #585#return; {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {63104#true} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {63104#true} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 1 == #t~mem86#1 % 256; {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {63104#true} assume #t~switch87#1;assume { :begin_inline_lapb_connect_request } true;lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset := ~dev#1.base, ~dev#1.offset;havoc lapb_connect_request_#res#1;havoc lapb_connect_request_#t~nondet147#1, lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset;lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset := lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset;assume -2147483648 <= lapb_connect_request_#t~nondet147#1 && lapb_connect_request_#t~nondet147#1 <= 2147483647;lapb_connect_request_#res#1 := lapb_connect_request_#t~nondet147#1;havoc lapb_connect_request_#t~nondet147#1; {63104#true} is VALID [2022-02-20 21:56:23,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {63104#true} #t~ret90#1 := lapb_connect_request_#res#1;assume { :end_inline_lapb_connect_request } true;assume -2147483648 <= #t~ret90#1 && #t~ret90#1 <= 2147483647;~result~0#1 := #t~ret90#1;havoc #t~ret90#1; {63104#true} is VALID [2022-02-20 21:56:23,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {63104#true} assume 0 != ~result~0#1; {63104#true} is VALID [2022-02-20 21:56:23,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {63104#true} assume 3 == ~result~0#1;assume { :begin_inline_x25_connected } true;x25_connected_#in~dev#1.base, x25_connected_#in~dev#1.offset, x25_connected_#in~reason#1 := ~dev#1.base, ~dev#1.offset, 0;havoc x25_connected_~dev#1.base, x25_connected_~dev#1.offset, x25_connected_~reason#1;x25_connected_~dev#1.base, x25_connected_~dev#1.offset := x25_connected_#in~dev#1.base, x25_connected_#in~dev#1.offset;x25_connected_~reason#1 := x25_connected_#in~reason#1; {63104#true} is VALID [2022-02-20 21:56:23,463 INFO L272 TraceCheckUtils]: 18: Hoare triple {63104#true} call x25_connect_disconnect(x25_connected_~dev#1.base, x25_connected_~dev#1.offset, x25_connected_~reason#1, 1); {63238#(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:23,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {63238#(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))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~reason#1 := #in~reason#1;~code#1 := #in~code#1;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~ptr~0#1.base, ~ptr~0#1.offset;assume { :begin_inline_ldv_dev_alloc_skb_12 } true;ldv_dev_alloc_skb_12_#in~length#1 := 1;havoc ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset, ldv_dev_alloc_skb_12_~length#1, ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset;ldv_dev_alloc_skb_12_~length#1 := ldv_dev_alloc_skb_12_#in~length#1;havoc ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,464 INFO L272 TraceCheckUtils]: 20: Hoare triple {63104#true} call ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset := ldv_skb_alloc(); {63238#(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:23,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {63238#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,465 INFO L272 TraceCheckUtils]: 22: Hoare triple {63104#true} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:23,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,465 INFO L272 TraceCheckUtils]: 24: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,466 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,466 INFO L272 TraceCheckUtils]: 29: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {63104#true} {63104#true} #581#return; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {63104#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {63104#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {63104#true} assume !false; {63104#true} is VALID [2022-02-20 21:56:23,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {63104#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {63104#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; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {63104#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {63104#true} {63104#true} #615#return; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {63104#true} ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset := ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset := ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {63104#true} #t~ret68#1.base, #t~ret68#1.offset := ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;assume { :end_inline_ldv_dev_alloc_skb_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret68#1.base, #t~ret68#1.offset;havoc #t~ret68#1.base, #t~ret68#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {63104#true} assume 0 == (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616;havoc #t~nondet69#1; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,468 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {63104#true} {63104#true} #591#return; {63104#true} is VALID [2022-02-20 21:56:23,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {63104#true} assume { :end_inline_x25_connected } true; {63104#true} is VALID [2022-02-20 21:56:23,469 INFO L272 TraceCheckUtils]: 51: Hoare triple {63104#true} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:23,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {63104#true} is VALID [2022-02-20 21:56:23,470 INFO L272 TraceCheckUtils]: 53: Hoare triple {63104#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:23,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume !false; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume ~i~1 < ~last_index~0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {63345#(<= 0 ldv_set_remove_~deleted_index~0)} is VALID [2022-02-20 21:56:23,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {63345#(<= 0 ldv_set_remove_~deleted_index~0)} assume !(-1 != ~deleted_index~0); {63105#false} is VALID [2022-02-20 21:56:23,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,472 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {63105#false} {63104#true} #613#return; {63105#false} is VALID [2022-02-20 21:56:23,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,473 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {63105#false} {63104#true} #595#return; {63105#false} is VALID [2022-02-20 21:56:23,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {63105#false} #res#1 := 0; {63105#false} is VALID [2022-02-20 21:56:23,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,473 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {63105#false} {63104#true} #625#return; {63105#false} is VALID [2022-02-20 21:56:23,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {63104#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(23, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(46, 5);call #Ultimate.allocInit(49, 6);~LDV_IN_INTERRUPT~0 := 1;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~proto_group1~0.base, ~proto_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#proto~0.base, ~#proto~0.offset := 7, 0;call #Ultimate.allocInit(88, 7);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#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~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#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);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 8, 0;call #Ultimate.allocInit(120, 8);#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; {63104#true} is VALID [2022-02-20 21:56:23,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {63104#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {63104#true} is VALID [2022-02-20 21:56:23,474 INFO L272 TraceCheckUtils]: 2: Hoare triple {63104#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40); {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:23,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,475 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,475 INFO L272 TraceCheckUtils]: 9: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {63104#true} {63104#true} #623#return; {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {63104#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {63104#true} assume { :end_inline_ldv_set_init } true; {63104#true} is VALID [2022-02-20 21:56:23,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {63104#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {63104#true} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {63104#true} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {63104#true} assume main_#t~switch119#1; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {63104#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {63104#true} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1 == main_~tmp___2~1#1; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {63104#true} assume main_#t~switch130#1; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {63104#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;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; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {63104#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {63104#true} is VALID [2022-02-20 21:56:23,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {63104#true} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret131#1 && main_#t~ret131#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {63104#true} is VALID [2022-02-20 21:56:23,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {63104#true} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_1 } true;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset, ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset, ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset;havoc ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,478 INFO L272 TraceCheckUtils]: 30: Hoare triple {63104#true} call ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset := ldv_successful_zalloc(3264); {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:23,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,479 INFO L272 TraceCheckUtils]: 32: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,479 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,479 INFO L272 TraceCheckUtils]: 37: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {63104#true} {63104#true} #639#return; {63104#true} is VALID [2022-02-20 21:56:23,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {63104#true} ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset := ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret115#1.base, ldv_initialize_hdlc_proto_1_#t~ret115#1.offset;~proto_group1~0.base, ~proto_group1~0.offset := ldv_initialize_hdlc_proto_1_~tmp~15#1.base, ldv_initialize_hdlc_proto_1_~tmp~15#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,481 INFO L272 TraceCheckUtils]: 46: Hoare triple {63104#true} call ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset := ldv_successful_zalloc(232); {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:23,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L272 TraceCheckUtils]: 48: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L272 TraceCheckUtils]: 53: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {63104#true} {63104#true} #641#return; {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {63104#true} ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset := ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;havoc ldv_initialize_hdlc_proto_1_#t~ret116#1.base, ldv_initialize_hdlc_proto_1_#t~ret116#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_1_~tmp___0~8#1.base, ldv_initialize_hdlc_proto_1_~tmp___0~8#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {63104#true} assume { :end_inline_ldv_initialize_hdlc_proto_1 } true; {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {63104#true} assume !(0 != ~ldv_retval_1~0); {63104#true} is VALID [2022-02-20 21:56:23,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {63104#true} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {63104#true} is VALID [2022-02-20 21:56:23,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {63104#true} assume main_#t~switch119#1; {63104#true} is VALID [2022-02-20 21:56:23,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {63104#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet120#1 && main_#t~nondet120#1 <= 2147483647;main_~tmp___1~4#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1;main_#t~switch121#1 := 0 == main_~tmp___1~4#1; {63104#true} is VALID [2022-02-20 21:56:23,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {63104#true} assume main_#t~switch121#1; {63104#true} is VALID [2022-02-20 21:56:23,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {63104#true} assume 1 == ~ldv_state_variable_1~0; {63104#true} is VALID [2022-02-20 21:56:23,485 INFO L272 TraceCheckUtils]: 69: Hoare triple {63104#true} call main_#t~ret122#1 := x25_xmit(~proto_group0~0.base, ~proto_group0~0.offset, ~proto_group1~0.base, ~proto_group1~0.offset); {63238#(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:23,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {63238#(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))} ~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~result~0#1; {63104#true} is VALID [2022-02-20 21:56:23,485 INFO L272 TraceCheckUtils]: 71: Hoare triple {63104#true} call assume_abort_if_not((if ~skb#1.base != 0 || ~skb#1.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,485 INFO L290 TraceCheckUtils]: 73: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,485 INFO L290 TraceCheckUtils]: 74: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,485 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {63104#true} {63104#true} #583#return; {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L290 TraceCheckUtils]: 76: Hoare triple {63104#true} call #t~mem84#1.base, #t~mem84#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8); {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L272 TraceCheckUtils]: 77: Hoare triple {63104#true} call assume_abort_if_not((if #t~mem84#1.base != 0 || #t~mem84#1.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L290 TraceCheckUtils]: 78: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L290 TraceCheckUtils]: 79: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L290 TraceCheckUtils]: 80: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {63104#true} {63104#true} #585#return; {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L290 TraceCheckUtils]: 82: Hoare triple {63104#true} havoc #t~mem84#1.base, #t~mem84#1.offset;call #t~mem85#1.base, #t~mem85#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem86#1 := read~int(#t~mem85#1.base, #t~mem85#1.offset, 1);#t~switch87#1 := 0 == #t~mem86#1 % 256; {63104#true} is VALID [2022-02-20 21:56:23,486 INFO L290 TraceCheckUtils]: 83: Hoare triple {63104#true} assume !#t~switch87#1;#t~switch87#1 := #t~switch87#1 || 1 == #t~mem86#1 % 256; {63104#true} is VALID [2022-02-20 21:56:23,487 INFO L290 TraceCheckUtils]: 84: Hoare triple {63104#true} assume #t~switch87#1;assume { :begin_inline_lapb_connect_request } true;lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset := ~dev#1.base, ~dev#1.offset;havoc lapb_connect_request_#res#1;havoc lapb_connect_request_#t~nondet147#1, lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset;lapb_connect_request_~arg0#1.base, lapb_connect_request_~arg0#1.offset := lapb_connect_request_#in~arg0#1.base, lapb_connect_request_#in~arg0#1.offset;assume -2147483648 <= lapb_connect_request_#t~nondet147#1 && lapb_connect_request_#t~nondet147#1 <= 2147483647;lapb_connect_request_#res#1 := lapb_connect_request_#t~nondet147#1;havoc lapb_connect_request_#t~nondet147#1; {63104#true} is VALID [2022-02-20 21:56:23,487 INFO L290 TraceCheckUtils]: 85: Hoare triple {63104#true} #t~ret90#1 := lapb_connect_request_#res#1;assume { :end_inline_lapb_connect_request } true;assume -2147483648 <= #t~ret90#1 && #t~ret90#1 <= 2147483647;~result~0#1 := #t~ret90#1;havoc #t~ret90#1; {63104#true} is VALID [2022-02-20 21:56:23,487 INFO L290 TraceCheckUtils]: 86: Hoare triple {63104#true} assume 0 != ~result~0#1; {63104#true} is VALID [2022-02-20 21:56:23,487 INFO L290 TraceCheckUtils]: 87: Hoare triple {63104#true} assume 3 == ~result~0#1;assume { :begin_inline_x25_connected } true;x25_connected_#in~dev#1.base, x25_connected_#in~dev#1.offset, x25_connected_#in~reason#1 := ~dev#1.base, ~dev#1.offset, 0;havoc x25_connected_~dev#1.base, x25_connected_~dev#1.offset, x25_connected_~reason#1;x25_connected_~dev#1.base, x25_connected_~dev#1.offset := x25_connected_#in~dev#1.base, x25_connected_#in~dev#1.offset;x25_connected_~reason#1 := x25_connected_#in~reason#1; {63104#true} is VALID [2022-02-20 21:56:23,488 INFO L272 TraceCheckUtils]: 88: Hoare triple {63104#true} call x25_connect_disconnect(x25_connected_~dev#1.base, x25_connected_~dev#1.offset, x25_connected_~reason#1, 1); {63238#(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:23,488 INFO L290 TraceCheckUtils]: 89: Hoare triple {63238#(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))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~reason#1 := #in~reason#1;~code#1 := #in~code#1;havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~ptr~0#1.base, ~ptr~0#1.offset;assume { :begin_inline_ldv_dev_alloc_skb_12 } true;ldv_dev_alloc_skb_12_#in~length#1 := 1;havoc ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset, ldv_dev_alloc_skb_12_~length#1, ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset;ldv_dev_alloc_skb_12_~length#1 := ldv_dev_alloc_skb_12_#in~length#1;havoc ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,488 INFO L272 TraceCheckUtils]: 90: Hoare triple {63104#true} call ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset := ldv_skb_alloc(); {63238#(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:23,489 INFO L290 TraceCheckUtils]: 91: Hoare triple {63238#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,489 INFO L272 TraceCheckUtils]: 92: Hoare triple {63104#true} call #t~ret140#1.base, #t~ret140#1.offset := ldv_successful_zalloc(248); {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:23,489 INFO L290 TraceCheckUtils]: 93: Hoare triple {63215#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {63104#true} is VALID [2022-02-20 21:56:23,490 INFO L272 TraceCheckUtils]: 94: Hoare triple {63104#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~__size, ~__size); {63223#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:56:23,490 INFO L290 TraceCheckUtils]: 95: Hoare triple {63223#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {63104#true} is VALID [2022-02-20 21:56:23,490 INFO L290 TraceCheckUtils]: 96: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,490 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {63104#true} {63104#true} #597#return; {63104#true} is VALID [2022-02-20 21:56:23,490 INFO L290 TraceCheckUtils]: 98: Hoare triple {63104#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {63104#true} is VALID [2022-02-20 21:56:23,490 INFO L272 TraceCheckUtils]: 99: Hoare triple {63104#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {63104#true} is VALID [2022-02-20 21:56:23,490 INFO L290 TraceCheckUtils]: 100: Hoare triple {63104#true} ~cond := #in~cond; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L290 TraceCheckUtils]: 101: Hoare triple {63104#true} assume !(0 == ~cond); {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L290 TraceCheckUtils]: 102: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {63104#true} {63104#true} #599#return; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L290 TraceCheckUtils]: 104: Hoare triple {63104#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L290 TraceCheckUtils]: 105: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {63104#true} {63104#true} #581#return; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L290 TraceCheckUtils]: 107: Hoare triple {63104#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret140#1.base, #t~ret140#1.offset;havoc #t~ret140#1.base, #t~ret140#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L290 TraceCheckUtils]: 108: Hoare triple {63104#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem135#1.base, ldv_set_add_#t~mem135#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {63104#true} is VALID [2022-02-20 21:56:23,491 INFO L290 TraceCheckUtils]: 109: Hoare triple {63104#true} assume !false; {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L290 TraceCheckUtils]: 110: Hoare triple {63104#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L290 TraceCheckUtils]: 111: Hoare triple {63104#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; {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L290 TraceCheckUtils]: 112: Hoare triple {63104#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L290 TraceCheckUtils]: 113: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {63104#true} {63104#true} #615#return; {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L290 TraceCheckUtils]: 115: Hoare triple {63104#true} ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset := ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;havoc ldv_dev_alloc_skb_12_#t~ret132#1.base, ldv_dev_alloc_skb_12_#t~ret132#1.offset;ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset := ldv_dev_alloc_skb_12_~tmp~17#1.base, ldv_dev_alloc_skb_12_~tmp~17#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L290 TraceCheckUtils]: 116: Hoare triple {63104#true} #t~ret68#1.base, #t~ret68#1.offset := ldv_dev_alloc_skb_12_#res#1.base, ldv_dev_alloc_skb_12_#res#1.offset;assume { :end_inline_ldv_dev_alloc_skb_12 } true;~skb~0#1.base, ~skb~0#1.offset := #t~ret68#1.base, #t~ret68#1.offset;havoc #t~ret68#1.base, #t~ret68#1.offset; {63104#true} is VALID [2022-02-20 21:56:23,492 INFO L290 TraceCheckUtils]: 117: Hoare triple {63104#true} assume 0 == (~skb~0#1.base + ~skb~0#1.offset) % 18446744073709551616;havoc #t~nondet69#1; {63104#true} is VALID [2022-02-20 21:56:23,493 INFO L290 TraceCheckUtils]: 118: Hoare triple {63104#true} assume true; {63104#true} is VALID [2022-02-20 21:56:23,493 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {63104#true} {63104#true} #591#return; {63104#true} is VALID [2022-02-20 21:56:23,493 INFO L290 TraceCheckUtils]: 120: Hoare triple {63104#true} assume { :end_inline_x25_connected } true; {63104#true} is VALID [2022-02-20 21:56:23,493 INFO L272 TraceCheckUtils]: 121: Hoare triple {63104#true} call ldv_skb_free(~skb#1.base, ~skb#1.offset); {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:23,493 INFO L290 TraceCheckUtils]: 122: Hoare triple {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {63104#true} is VALID [2022-02-20 21:56:23,494 INFO L272 TraceCheckUtils]: 123: Hoare triple {63104#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:23,495 INFO L290 TraceCheckUtils]: 124: Hoare triple {63335#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,495 INFO L290 TraceCheckUtils]: 125: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume !false; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,495 INFO L290 TraceCheckUtils]: 126: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume ~i~1 < ~last_index~0; {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,496 INFO L290 TraceCheckUtils]: 127: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} call #t~mem136.base, #t~mem136.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {63344#(<= 0 ldv_set_remove_~i~1)} is VALID [2022-02-20 21:56:23,496 INFO L290 TraceCheckUtils]: 128: Hoare triple {63344#(<= 0 ldv_set_remove_~i~1)} assume (#t~mem136.base + #t~mem136.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem136.base, #t~mem136.offset;~deleted_index~0 := ~i~1; {63345#(<= 0 ldv_set_remove_~deleted_index~0)} is VALID [2022-02-20 21:56:23,496 INFO L290 TraceCheckUtils]: 129: Hoare triple {63345#(<= 0 ldv_set_remove_~deleted_index~0)} assume !(-1 != ~deleted_index~0); {63105#false} is VALID [2022-02-20 21:56:23,496 INFO L290 TraceCheckUtils]: 130: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,496 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {63105#false} {63104#true} #613#return; {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L290 TraceCheckUtils]: 132: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {63105#false} {63104#true} #595#return; {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L290 TraceCheckUtils]: 134: Hoare triple {63105#false} #res#1 := 0; {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L290 TraceCheckUtils]: 135: Hoare triple {63105#false} assume true; {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {63105#false} {63104#true} #625#return; {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L290 TraceCheckUtils]: 137: Hoare triple {63105#false} assume -2147483648 <= main_#t~ret122#1 && main_#t~ret122#1 <= 2147483647;havoc main_#t~ret122#1;~ldv_state_variable_1~0 := 1; {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L290 TraceCheckUtils]: 138: Hoare triple {63105#false} assume !(2 == ~ldv_state_variable_1~0); {63105#false} is VALID [2022-02-20 21:56:23,497 INFO L290 TraceCheckUtils]: 139: Hoare triple {63105#false} assume -2147483648 <= main_#t~nondet118#1 && main_#t~nondet118#1 <= 2147483647;main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0 == main_~tmp___0~9#1; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 140: Hoare triple {63105#false} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1 == main_~tmp___0~9#1; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 141: Hoare triple {63105#false} assume main_#t~switch119#1; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 142: Hoare triple {63105#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet129#1 && main_#t~nondet129#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0 == main_~tmp___2~1#1; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 143: Hoare triple {63105#false} assume main_#t~switch130#1; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 144: Hoare triple {63105#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; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 145: Hoare triple {63105#false} assume { :end_inline_unregister_hdlc_protocol } true; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 146: Hoare triple {63105#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 147: Hoare triple {63105#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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); {63105#false} is VALID [2022-02-20 21:56:23,498 INFO L290 TraceCheckUtils]: 148: Hoare triple {63105#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret144#1 && ldv_check_final_state_#t~ret144#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {63105#false} is VALID [2022-02-20 21:56:23,499 INFO L290 TraceCheckUtils]: 149: Hoare triple {63105#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {63105#false} is VALID [2022-02-20 21:56:23,499 INFO L272 TraceCheckUtils]: 150: Hoare triple {63105#false} call ldv_error(); {63105#false} is VALID [2022-02-20 21:56:23,499 INFO L290 TraceCheckUtils]: 151: Hoare triple {63105#false} assume !false; {63105#false} is VALID [2022-02-20 21:56:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-02-20 21:56:23,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:23,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756582022] [2022-02-20 21:56:23,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756582022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:23,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:23,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:56:23,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577889525] [2022-02-20 21:56:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:23,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 152 [2022-02-20 21:56:23,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:23,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-02-20 21:56:23,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:23,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:56:23,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:56:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:56:23,565 INFO L87 Difference]: Start difference. First operand 2234 states and 2872 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-02-20 21:56:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:26,151 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2022-02-20 21:56:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 21:56:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 152 [2022-02-20 21:56:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-02-20 21:56:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 736 transitions. [2022-02-20 21:56:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-02-20 21:56:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 736 transitions. [2022-02-20 21:56:26,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 736 transitions. [2022-02-20 21:56:26,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 736 edges. 736 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:26,998 INFO L225 Difference]: With dead ends: 4214 [2022-02-20 21:56:26,998 INFO L226 Difference]: Without dead ends: 2818 [2022-02-20 21:56:27,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:56:27,017 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 305 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:27,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 973 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 21:56:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2022-02-20 21:56:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2022-02-20 21:56:27,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:27,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2818 states. Second operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:27,336 INFO L74 IsIncluded]: Start isIncluded. First operand 2818 states. Second operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:27,346 INFO L87 Difference]: Start difference. First operand 2818 states. Second operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:27,552 INFO L93 Difference]: Finished difference Result 2818 states and 3656 transitions. [2022-02-20 21:56:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3656 transitions. [2022-02-20 21:56:27,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:27,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:27,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) Second operand 2818 states. [2022-02-20 21:56:27,563 INFO L87 Difference]: Start difference. First operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) Second operand 2818 states. [2022-02-20 21:56:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:27,776 INFO L93 Difference]: Finished difference Result 2818 states and 3656 transitions. [2022-02-20 21:56:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3656 transitions. [2022-02-20 21:56:27,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:27,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:27,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:27,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-02-20 21:56:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2022-02-20 21:56:28,005 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 152 [2022-02-20 21:56:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:28,007 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2022-02-20 21:56:28,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-02-20 21:56:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2022-02-20 21:56:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-02-20 21:56:28,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:28,011 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 21:56:28,012 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2022-02-20 21:56:28,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:28,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447774049] [2022-02-20 21:56:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:56:28,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 21:56:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:56:28,235 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 21:56:28,235 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 21:56:28,236 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:56:28,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 21:56:28,239 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:28,242 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:56:28,317 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret117 := ldv_successful_zalloc(40); [2022-02-20 21:56:28,318 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 21:56:28,324 INFO L158 Benchmark]: Toolchain (without parser) took 46301.98ms. Allocated memory was 98.6MB in the beginning and 415.2MB in the end (delta: 316.7MB). Free memory was 59.6MB in the beginning and 294.0MB in the end (delta: -234.4MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2022-02-20 21:56:28,324 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 77.6MB. Free memory was 35.8MB in the beginning and 35.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:56:28,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.26ms. Allocated memory is still 98.6MB. Free memory was 59.3MB in the beginning and 46.7MB in the end (delta: 12.6MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-02-20 21:56:28,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.96ms. Allocated memory is still 98.6MB. Free memory was 46.7MB in the beginning and 40.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:56:28,325 INFO L158 Benchmark]: Boogie Preprocessor took 96.40ms. Allocated memory is still 98.6MB. Free memory was 40.5MB in the beginning and 33.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:56:28,325 INFO L158 Benchmark]: RCFGBuilder took 967.60ms. Allocated memory was 98.6MB in the beginning and 161.5MB in the end (delta: 62.9MB). Free memory was 33.7MB in the beginning and 103.1MB in the end (delta: -69.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-02-20 21:56:28,325 INFO L158 Benchmark]: TraceAbstraction took 44303.14ms. Allocated memory was 161.5MB in the beginning and 415.2MB in the end (delta: 253.8MB). Free memory was 102.3MB in the beginning and 294.0MB in the end (delta: -191.7MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2022-02-20 21:56:28,330 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 77.6MB. Free memory was 35.8MB in the beginning and 35.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 848.26ms. Allocated memory is still 98.6MB. Free memory was 59.3MB in the beginning and 46.7MB in the end (delta: 12.6MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.96ms. Allocated memory is still 98.6MB. Free memory was 46.7MB in the beginning and 40.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.40ms. Allocated memory is still 98.6MB. Free memory was 40.5MB in the beginning and 33.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 967.60ms. Allocated memory was 98.6MB in the beginning and 161.5MB in the end (delta: 62.9MB). Free memory was 33.7MB in the beginning and 103.1MB in the end (delta: -69.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44303.14ms. Allocated memory was 161.5MB in the beginning and 415.2MB in the end (delta: 253.8MB). Free memory was 102.3MB in the beginning and 294.0MB in the end (delta: -191.7MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 21:56:28,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:56:29,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:56:29,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:56:29,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:56:29,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:56:29,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:56:29,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:56:29,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:56:29,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:56:29,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:56:29,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:56:29,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:56:29,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:56:29,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:56:29,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:56:29,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:56:29,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:56:29,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:56:29,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:56:29,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:56:29,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:56:29,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:56:29,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:56:29,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:56:29,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:56:29,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:56:29,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:56:29,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:56:29,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:56:30,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:56:30,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:56:30,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:56:30,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:56:30,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:56:30,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:56:30,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:56:30,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:56:30,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:56:30,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:56:30,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:56:30,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:56:30,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-02-20 21:56:30,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:56:30,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:56:30,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:56:30,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:56:30,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:56:30,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:56:30,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:56:30,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:56:30,041 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:56:30,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:56:30,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:56:30,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:56:30,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:56:30,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:56:30,042 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 21:56:30,042 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 21:56:30,043 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 21:56:30,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:56:30,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:56:30,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:56:30,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:56:30,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:56:30,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:56:30,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:56:30,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:56:30,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:56:30,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:56:30,049 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 21:56:30,049 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 21:56:30,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:56:30,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:56:30,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:56:30,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 21:56:30,050 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c [2022-02-20 21:56:30,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:56:30,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:56:30,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:56:30,310 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:56:30,312 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:56:30,313 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_x25.ko-entry_point.cil.out.i [2022-02-20 21:56:30,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a738d7fe0/3f9c6a80602f4355908882aa9dd17533/FLAGef6ff7e96 [2022-02-20 21:56:30,915 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:56:30,916 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_x25.ko-entry_point.cil.out.i [2022-02-20 21:56:30,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a738d7fe0/3f9c6a80602f4355908882aa9dd17533/FLAGef6ff7e96 [2022-02-20 21:56:31,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a738d7fe0/3f9c6a80602f4355908882aa9dd17533 [2022-02-20 21:56:31,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:56:31,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:56:31,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:56:31,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:56:31,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:56:31,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:56:31" (1/1) ... [2022-02-20 21:56:31,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3b231d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:31, skipping insertion in model container [2022-02-20 21:56:31,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:56:31" (1/1) ... [2022-02-20 21:56:31,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:56:31,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:56:32,070 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_x25.ko-entry_point.cil.out.i[152690,152703] [2022-02-20 21:56:32,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:56:32,352 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 21:56:32,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:56:32,467 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_x25.ko-entry_point.cil.out.i[152690,152703] [2022-02-20 21:56:32,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:56:32,525 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:56:32,630 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_x25.ko-entry_point.cil.out.i[152690,152703] [2022-02-20 21:56:32,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:56:32,719 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:56:32,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32 WrapperNode [2022-02-20 21:56:32,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:56:32,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:56:32,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:56:32,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:56:32,725 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:56:32" (1/1) ... [2022-02-20 21:56:32,755 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:56:32" (1/1) ... [2022-02-20 21:56:32,815 INFO L137 Inliner]: procedures = 116, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 598 [2022-02-20 21:56:32,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:56:32,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:56:32,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:56:32,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:56:32,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:56:32,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:56:32,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:56:32,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:56:32,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (1/1) ... [2022-02-20 21:56:32,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:56:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:56:32,915 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:56:32,928 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:56:32,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 21:56:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 21:56:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 21:56:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:56:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:56:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 21:56:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 21:56:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-02-20 21:56:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-02-20 21:56:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:56:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:56:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:56:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:56:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:56:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:56:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:56:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:56:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-02-20 21:56:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-02-20 21:56:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-02-20 21:56:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-02-20 21:56:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:56:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:56:32,949 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-02-20 21:56:32,949 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-02-20 21:56:32,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:56:32,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-02-20 21:56:32,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-02-20 21:56:32,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:56:32,949 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-02-20 21:56:32,949 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-02-20 21:56:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-02-20 21:56:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-02-20 21:56:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:56:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:56:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:56:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:56:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:56:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 21:56:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 21:56:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-02-20 21:56:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 21:56:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:56:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:56:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 21:56:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-02-20 21:56:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-02-20 21:56:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-02-20 21:56:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-02-20 21:56:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:56:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:56:33,171 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:56:33,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:56:33,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:56:34,027 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:56:34,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:56:34,040 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:56:34,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:56:34 BoogieIcfgContainer [2022-02-20 21:56:34,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:56:34,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:56:34,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:56:34,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:56:34,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:56:31" (1/3) ... [2022-02-20 21:56:34,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dceece9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:56:34, skipping insertion in model container [2022-02-20 21:56:34,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:56:32" (2/3) ... [2022-02-20 21:56:34,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dceece9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:56:34, skipping insertion in model container [2022-02-20 21:56:34,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:56:34" (3/3) ... [2022-02-20 21:56:34,049 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2022-02-20 21:56:34,054 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:56:34,054 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:56:34,089 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:56:34,095 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:56:34,095 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:56:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 21:56:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 21:56:34,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:34,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:34,130 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:34,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2022-02-20 21:56:34,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:56:34,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926643181] [2022-02-20 21:56:34,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:56:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:56:34,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:56:34,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 21:56:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:34,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:56:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:34,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:56:34,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(103bv64, 2bv64);call #Ultimate.allocInit(23bv64, 3bv64);call #Ultimate.allocInit(15bv64, 4bv64);call #Ultimate.allocInit(46bv64, 5bv64);call #Ultimate.allocInit(49bv64, 6bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~proto_group0~0.base, ~proto_group0~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_state_variable_1~0 := 0bv32;~proto_group1~0.base, ~proto_group1~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~#proto~0.base, ~#proto~0.offset := 7bv64, 0bv64;call #Ultimate.allocInit(88bv64, 7bv64);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, ~bvadd64(8bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(16bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(24bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(32bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, ~bvadd64(40bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(48bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, ~bvadd64(56bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#proto~0.base, ~bvadd64(64bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, ~bvadd64(72bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(80bv64, ~#proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 8bv64, 0bv64;call #Ultimate.allocInit(120bv64, 8bv64);#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 := 0bv32;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0bv64, 0bv64; {240#true} is VALID [2022-02-20 21:56:34,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {240#true} is VALID [2022-02-20 21:56:34,495 INFO L272 TraceCheckUtils]: 2: Hoare triple {240#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40bv64); {240#true} is VALID [2022-02-20 21:56:34,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#true} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {240#true} is VALID [2022-02-20 21:56:34,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1bv64, ~__size, ~__size); {240#true} is VALID [2022-02-20 21:56:34,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {240#true} is VALID [2022-02-20 21:56:34,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:56:34,496 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {240#true} {240#true} #597#return; {240#true} is VALID [2022-02-20 21:56:34,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {240#true} is VALID [2022-02-20 21:56:34,496 INFO L272 TraceCheckUtils]: 9: Hoare triple {240#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {240#true} is VALID [2022-02-20 21:56:34,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-02-20 21:56:34,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} assume !(0bv32 == ~cond); {240#true} is VALID [2022-02-20 21:56:34,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:56:34,497 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {240#true} {240#true} #599#return; {240#true} is VALID [2022-02-20 21:56:34,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {240#true} is VALID [2022-02-20 21:56:34,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 21:56:34,498 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {240#true} {240#true} #623#return; {240#true} is VALID [2022-02-20 21:56:34,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {240#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0bv32; {240#true} is VALID [2022-02-20 21:56:34,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {240#true} assume { :end_inline_ldv_set_init } true; {240#true} is VALID [2022-02-20 21:56:34,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {240#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:56:34,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0bv32 == main_~tmp___0~9#1; {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:56:34,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1bv32 == main_~tmp___0~9#1; {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:56:34,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch119#1; {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:56:34,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0bv32 == main_~tmp___2~1#1; {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:56:34,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch130#1; {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:56:34,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~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; {241#false} is VALID [2022-02-20 21:56:34,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {241#false} assume { :end_inline_unregister_hdlc_protocol } true; {241#false} is VALID [2022-02-20 21:56:34,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {241#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2bv32; {241#false} is VALID [2022-02-20 21:56:34,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {241#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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 0bv32 == ~last_index~0 then 1bv32 else 0bv32); {241#false} is VALID [2022-02-20 21:56:34,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {241#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {241#false} is VALID [2022-02-20 21:56:34,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {241#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~5#1); {241#false} is VALID [2022-02-20 21:56:34,503 INFO L272 TraceCheckUtils]: 31: Hoare triple {241#false} call ldv_error(); {241#false} is VALID [2022-02-20 21:56:34,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-02-20 21:56:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:56:34,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:56:34,504 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:56:34,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926643181] [2022-02-20 21:56:34,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926643181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:34,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:34,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:56:34,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647065893] [2022-02-20 21:56:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:34,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 21:56:34,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:34,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:56:34,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:34,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:56:34,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:56:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:56:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:56:34,575 INFO L87 Difference]: Start difference. First operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:56:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:35,895 INFO L93 Difference]: Finished difference Result 678 states and 971 transitions. [2022-02-20 21:56:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:56:35,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 21:56:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:56:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2022-02-20 21:56:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:56:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2022-02-20 21:56:35,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 971 transitions. [2022-02-20 21:56:36,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 971 edges. 971 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:36,980 INFO L225 Difference]: With dead ends: 678 [2022-02-20 21:56:36,981 INFO L226 Difference]: Without dead ends: 432 [2022-02-20 21:56:36,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:56:36,991 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 276 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:36,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 644 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:56:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-02-20 21:56:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2022-02-20 21:56:37,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:37,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 432 states. Second operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:56:37,053 INFO L74 IsIncluded]: Start isIncluded. First operand 432 states. Second operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:56:37,056 INFO L87 Difference]: Start difference. First operand 432 states. Second operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:56:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:37,074 INFO L93 Difference]: Finished difference Result 432 states and 572 transitions. [2022-02-20 21:56:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-02-20 21:56:37,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:37,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:37,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand 432 states. [2022-02-20 21:56:37,082 INFO L87 Difference]: Start difference. First operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand 432 states. [2022-02-20 21:56:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:37,096 INFO L93 Difference]: Finished difference Result 432 states and 572 transitions. [2022-02-20 21:56:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-02-20 21:56:37,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:37,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:37,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:37,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 21:56:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2022-02-20 21:56:37,116 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2022-02-20 21:56:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:37,117 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2022-02-20 21:56:37,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:56:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-02-20 21:56:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 21:56:37,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:37,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:37,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 21:56:37,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:56:37,328 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:37,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2022-02-20 21:56:37,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:56:37,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688584991] [2022-02-20 21:56:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:56:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:56:37,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:56:37,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 21:56:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:37,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:56:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:37,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:56:37,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {2762#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(103bv64, 2bv64);call #Ultimate.allocInit(23bv64, 3bv64);call #Ultimate.allocInit(15bv64, 4bv64);call #Ultimate.allocInit(46bv64, 5bv64);call #Ultimate.allocInit(49bv64, 6bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~proto_group0~0.base, ~proto_group0~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_state_variable_1~0 := 0bv32;~proto_group1~0.base, ~proto_group1~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~#proto~0.base, ~#proto~0.offset := 7bv64, 0bv64;call #Ultimate.allocInit(88bv64, 7bv64);call write~init~$Pointer$(#funAddr~x25_open.base, #funAddr~x25_open.offset, ~#proto~0.base, ~#proto~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~x25_close.base, #funAddr~x25_close.offset, ~#proto~0.base, ~bvadd64(8bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(16bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(24bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(32bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~x25_ioctl.base, #funAddr~x25_ioctl.offset, ~#proto~0.base, ~bvadd64(40bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(48bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~x25_rx.base, #funAddr~x25_rx.offset, ~#proto~0.base, ~bvadd64(56bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~x25_xmit.base, #funAddr~x25_xmit.offset, ~#proto~0.base, ~bvadd64(64bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, ~bvadd64(72bv64, ~#proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#proto~0.base, ~bvadd64(80bv64, ~#proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 8bv64, 0bv64;call #Ultimate.allocInit(120bv64, 8bv64);#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 := 0bv32;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0bv64, 0bv64; {2762#true} is VALID [2022-02-20 21:56:37,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset, main_#t~nondet118#1, main_#t~switch119#1, main_#t~nondet120#1, main_#t~switch121#1, main_#t~ret122#1, main_#t~ret123#1, main_#t~ret124#1, main_#t~ret125#1, main_#t~ret126#1, main_#t~ret127#1, main_#t~ret128#1, main_#t~nondet129#1, main_#t~switch130#1, main_#t~ret131#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~16#1.base, main_~tmp~16#1.offset, main_~tmp___0~9#1, main_~tmp___1~4#1, main_~tmp___2~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~16#1.base, main_~tmp~16#1.offset;havoc main_~tmp___0~9#1;havoc main_~tmp___1~4#1;havoc main_~tmp___2~1#1; {2762#true} is VALID [2022-02-20 21:56:37,564 INFO L272 TraceCheckUtils]: 2: Hoare triple {2762#true} call main_#t~ret117#1.base, main_#t~ret117#1.offset := ldv_successful_zalloc(40bv64); {2762#true} is VALID [2022-02-20 21:56:37,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {2762#true} ~__size := #in~__size;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~__size); {2762#true} is VALID [2022-02-20 21:56:37,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1bv64, ~__size, ~__size); {2762#true} is VALID [2022-02-20 21:56:37,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2762#true} is VALID [2022-02-20 21:56:37,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-02-20 21:56:37,565 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2762#true} {2762#true} #597#return; {2762#true} is VALID [2022-02-20 21:56:37,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {2762#true} ~p~0.base, ~p~0.offset := #t~malloc40.base, #t~malloc40.offset; {2762#true} is VALID [2022-02-20 21:56:37,565 INFO L272 TraceCheckUtils]: 9: Hoare triple {2762#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {2762#true} is VALID [2022-02-20 21:56:37,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {2762#true} ~cond := #in~cond; {2762#true} is VALID [2022-02-20 21:56:37,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {2762#true} assume !(0bv32 == ~cond); {2762#true} is VALID [2022-02-20 21:56:37,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-02-20 21:56:37,566 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2762#true} {2762#true} #599#return; {2762#true} is VALID [2022-02-20 21:56:37,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {2762#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {2762#true} is VALID [2022-02-20 21:56:37,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-02-20 21:56:37,571 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2762#true} {2762#true} #623#return; {2762#true} is VALID [2022-02-20 21:56:37,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#true} main_~tmp~16#1.base, main_~tmp~16#1.offset := main_#t~ret117#1.base, main_#t~ret117#1.offset;havoc main_#t~ret117#1.base, main_#t~ret117#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~16#1.base, main_~tmp~16#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0bv32; {2762#true} is VALID [2022-02-20 21:56:37,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {2762#true} assume { :end_inline_ldv_set_init } true; {2762#true} is VALID [2022-02-20 21:56:37,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {2762#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {2762#true} is VALID [2022-02-20 21:56:37,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {2762#true} main_~tmp___0~9#1 := main_#t~nondet118#1;havoc main_#t~nondet118#1;main_#t~switch119#1 := 0bv32 == main_~tmp___0~9#1; {2762#true} is VALID [2022-02-20 21:56:37,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {2762#true} assume !main_#t~switch119#1;main_#t~switch119#1 := main_#t~switch119#1 || 1bv32 == main_~tmp___0~9#1; {2762#true} is VALID [2022-02-20 21:56:37,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {2762#true} assume main_#t~switch119#1; {2762#true} is VALID [2022-02-20 21:56:37,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {2762#true} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___2~1#1 := main_#t~nondet129#1;havoc main_#t~nondet129#1;main_#t~switch130#1 := 0bv32 == main_~tmp___2~1#1; {2762#true} is VALID [2022-02-20 21:56:37,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {2762#true} assume !main_#t~switch130#1;main_#t~switch130#1 := main_#t~switch130#1 || 1bv32 == main_~tmp___2~1#1; {2762#true} is VALID [2022-02-20 21:56:37,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {2762#true} assume main_#t~switch130#1; {2762#true} is VALID [2022-02-20 21:56:37,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {2762#true} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;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; {2762#true} is VALID [2022-02-20 21:56:37,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {2762#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0bv32; {2848#(= |ULTIMATE.start_mod_init_#res#1| (_ bv0 32))} is VALID [2022-02-20 21:56:37,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {2848#(= |ULTIMATE.start_mod_init_#res#1| (_ bv0 32))} main_#t~ret131#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;~ldv_retval_1~0 := main_#t~ret131#1;havoc main_#t~ret131#1; {2852#(= (_ bv0 32) ~ldv_retval_1~0)} is VALID [2022-02-20 21:56:37,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {2852#(= (_ bv0 32) ~ldv_retval_1~0)} assume !(0bv32 == ~ldv_retval_1~0); {2763#false} is VALID [2022-02-20 21:56:37,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {2763#false} assume 0bv32 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2bv32; {2763#false} is VALID [2022-02-20 21:56:37,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {2763#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret144#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#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 0bv32 == ~last_index~0 then 1bv32 else 0bv32); {2763#false} is VALID [2022-02-20 21:56:37,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {2763#false} ldv_check_final_state_#t~ret144#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret144#1;havoc ldv_check_final_state_#t~ret144#1; {2763#false} is VALID [2022-02-20 21:56:37,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {2763#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~5#1); {2763#false} is VALID [2022-02-20 21:56:37,584 INFO L272 TraceCheckUtils]: 34: Hoare triple {2763#false} call ldv_error(); {2763#false} is VALID [2022-02-20 21:56:37,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {2763#false} assume !false; {2763#false} is VALID [2022-02-20 21:56:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:56:37,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:56:37,588 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:56:37,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688584991] [2022-02-20 21:56:37,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688584991] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:37,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:37,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:56:37,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525427725] [2022-02-20 21:56:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:37,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 21:56:37,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:37,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:56:37,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:37,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:56:37,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:56:37,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:56:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:56:37,637 INFO L87 Difference]: Start difference. First operand 432 states and 572 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)