./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.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 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:36:10,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:36:10,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:36:10,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:36:10,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:36:10,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:36:10,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:36:10,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:36:10,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:36:10,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:36:10,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:36:10,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:36:10,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:36:10,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:36:10,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:36:10,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:36:10,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:36:10,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:36:10,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:36:10,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:36:10,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:36:10,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:36:10,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:36:10,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:36:10,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:36:10,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:36:10,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:36:10,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:36:10,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:36:10,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:36:10,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:36:10,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:36:10,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:36:10,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:36:10,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:36:10,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:36:10,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:36:10,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:36:10,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:36:10,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:36:10,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:36:10,934 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:36:10,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:36:10,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:36:10,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:36:10,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:36:10,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:36:10,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:36:10,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:36:10,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:36:10,951 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:36:10,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:36:10,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:36:10,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:36:10,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:36:10,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:36:10,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:36:10,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:36:10,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:36:10,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:36:10,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:36:10,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:36:10,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:36:10,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:36:10,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:36:10,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:36:10,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:36:10,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:36:10,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:36:10,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:36:10,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:36:10,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:36:10,954 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 -> 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 [2022-02-20 21:36:11,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:36:11,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:36:11,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:36:11,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:36:11,169 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:36:11,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-02-20 21:36:11,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40b1c0aa/f7ae7dcaffe44589a70748f46bed3a2d/FLAG33b91509b [2022-02-20 21:36:11,794 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:36:11,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-02-20 21:36:11,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40b1c0aa/f7ae7dcaffe44589a70748f46bed3a2d/FLAG33b91509b [2022-02-20 21:36:12,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40b1c0aa/f7ae7dcaffe44589a70748f46bed3a2d [2022-02-20 21:36:12,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:36:12,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:36:12,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:36:12,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:36:12,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:36:12,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:36:12" (1/1) ... [2022-02-20 21:36:12,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4906348e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:12, skipping insertion in model container [2022-02-20 21:36:12,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:36:12" (1/1) ... [2022-02-20 21:36:12,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:36:12,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:36:13,211 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-02-20 21:36:13,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:36:13,249 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:36:13,458 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-02-20 21:36:13,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:36:13,534 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:36:13,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13 WrapperNode [2022-02-20 21:36:13,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:36:13,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:36:13,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:36:13,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:36:13,540 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:36:13" (1/1) ... [2022-02-20 21:36:13,582 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:36:13" (1/1) ... [2022-02-20 21:36:13,686 INFO L137 Inliner]: procedures = 157, calls = 810, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2783 [2022-02-20 21:36:13,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:36:13,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:36:13,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:36:13,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:36:13,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:36:13,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:36:13,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:36:13,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:36:13,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (1/1) ... [2022-02-20 21:36:13,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:36:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:36:13,941 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:36:13,951 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:36:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:36:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-02-20 21:36:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:36:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:36:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:36:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-02-20 21:36:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-02-20 21:36:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 21:36:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 21:36:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-02-20 21:36:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-02-20 21:36:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:36:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:36:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-02-20 21:36:13,974 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-02-20 21:36:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:36:13,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:36:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:36:13,974 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:36:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-02-20 21:36:13,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-02-20 21:36:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-02-20 21:36:13,975 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-02-20 21:36:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:36:13,975 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:36:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-02-20 21:36:13,975 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-02-20 21:36:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:36:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-02-20 21:36:13,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-02-20 21:36:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-02-20 21:36:13,976 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-02-20 21:36:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-02-20 21:36:13,976 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-02-20 21:36:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:36:13,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:36:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-02-20 21:36:13,977 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-02-20 21:36:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-02-20 21:36:13,977 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-02-20 21:36:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:36:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-02-20 21:36:13,977 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-02-20 21:36:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-02-20 21:36:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-02-20 21:36:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:36:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-02-20 21:36:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-02-20 21:36:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-02-20 21:36:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-02-20 21:36:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:36:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:36:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 21:36:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-02-20 21:36:13,979 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-02-20 21:36:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:36:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 21:36:13,979 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 21:36:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 21:36:13,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 21:36:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 21:36:13,980 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 21:36:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-02-20 21:36:13,980 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-02-20 21:36:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-02-20 21:36:13,980 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-02-20 21:36:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:36:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-02-20 21:36:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-02-20 21:36:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:36:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-02-20 21:36:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-02-20 21:36:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-02-20 21:36:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-02-20 21:36:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 21:36:13,982 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 21:36:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:36:13,982 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:36:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 21:36:13,982 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 21:36:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:36:13,982 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:36:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 21:36:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 21:36:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 21:36:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 21:36:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 21:36:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 21:36:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:36:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-02-20 21:36:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-02-20 21:36:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-02-20 21:36:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-02-20 21:36:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-02-20 21:36:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-02-20 21:36:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-02-20 21:36:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-02-20 21:36:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:36:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:36:13,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:36:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-02-20 21:36:13,985 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-02-20 21:36:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-02-20 21:36:13,985 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-02-20 21:36:14,378 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:36:14,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:36:16,356 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:36:16,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:36:16,369 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:36:16,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:36:16 BoogieIcfgContainer [2022-02-20 21:36:16,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:36:16,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:36:16,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:36:16,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:36:16,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:36:12" (1/3) ... [2022-02-20 21:36:16,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab42bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:36:16, skipping insertion in model container [2022-02-20 21:36:16,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:13" (2/3) ... [2022-02-20 21:36:16,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab42bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:36:16, skipping insertion in model container [2022-02-20 21:36:16,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:36:16" (3/3) ... [2022-02-20 21:36:16,376 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-02-20 21:36:16,380 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:36:16,380 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:36:16,421 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:36:16,426 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:36:16,426 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:36:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 968 states, 716 states have (on average 1.4329608938547487) internal successors, (1026), 743 states have internal predecessors, (1026), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2022-02-20 21:36:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 21:36:16,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:16,464 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:36:16,464 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:16,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash -579474216, now seen corresponding path program 1 times [2022-02-20 21:36:16,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:16,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070683946] [2022-02-20 21:36:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:16,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {971#true} is VALID [2022-02-20 21:36:16,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {971#true} is VALID [2022-02-20 21:36:16,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #2426#return; {971#true} is VALID [2022-02-20 21:36:16,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {971#true} is VALID [2022-02-20 21:36:16,733 INFO L272 TraceCheckUtils]: 1: Hoare triple {971#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:16,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {971#true} is VALID [2022-02-20 21:36:16,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {971#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {971#true} is VALID [2022-02-20 21:36:16,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,734 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {971#true} {971#true} #2426#return; {971#true} is VALID [2022-02-20 21:36:16,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {971#true} is VALID [2022-02-20 21:36:16,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,735 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {971#true} {973#(<= 256 ~slip_maxdev~0)} #2436#return; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:16,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,745 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {971#true} {973#(<= 256 ~slip_maxdev~0)} #2438#return; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:16,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:16,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {971#true} is VALID [2022-02-20 21:36:16,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {971#true} is VALID [2022-02-20 21:36:16,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #2424#return; {971#true} is VALID [2022-02-20 21:36:16,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {971#true} is VALID [2022-02-20 21:36:16,769 INFO L272 TraceCheckUtils]: 1: Hoare triple {971#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:16,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {971#true} is VALID [2022-02-20 21:36:16,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {971#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {971#true} is VALID [2022-02-20 21:36:16,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,770 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {971#true} {971#true} #2424#return; {971#true} is VALID [2022-02-20 21:36:16,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {971#true} is VALID [2022-02-20 21:36:16,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {971#true} is VALID [2022-02-20 21:36:16,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,771 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {971#true} {972#false} #2440#return; {972#false} is VALID [2022-02-20 21:36:16,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:36:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:16,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,821 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {971#true} {972#false} #2560#return; {972#false} is VALID [2022-02-20 21:36:16,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {971#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(42, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(64, 4);call #Ultimate.allocInit(59, 5);call #Ultimate.allocInit(34, 6);call #Ultimate.allocInit(37, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(46, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(37, 13);call #Ultimate.allocInit(5, 14);call write~init~int(115, 14, 0, 1);call write~init~int(108, 14, 1, 1);call write~init~int(37, 14, 2, 1);call write~init~int(100, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(20, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(19, 17);call #Ultimate.allocInit(5, 18);call write~init~int(115, 18, 0, 1);call write~init~int(108, 18, 1, 1);call write~init~int(105, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(79, 19);call #Ultimate.allocInit(22, 20);call #Ultimate.allocInit(72, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(37, 25);call #Ultimate.allocInit(54, 26);call #Ultimate.allocInit(62, 27);~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 28, 0;call #Ultimate.allocInit(280, 28);call write~init~$Pointer$(#funAddr~sl_init.base, #funAddr~sl_init.offset, ~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_uninit.base, #funAddr~sl_uninit.offset, ~#sl_netdev_ops~0.base, 8 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_open.base, #funAddr~sl_open.offset, ~#sl_netdev_ops~0.base, 16 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_close.base, #funAddr~sl_close.offset, ~#sl_netdev_ops~0.base, 24 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_xmit.base, #funAddr~sl_xmit.offset, ~#sl_netdev_ops~0.base, 32 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 40 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 48 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 56 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 64 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 72 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 80 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_ioctl.base, #funAddr~sl_ioctl.offset, ~#sl_netdev_ops~0.base, 88 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 96 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_change_mtu.base, #funAddr~sl_change_mtu.offset, ~#sl_netdev_ops~0.base, 104 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 112 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_tx_timeout.base, #funAddr~sl_tx_timeout.offset, ~#sl_netdev_ops~0.base, 120 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_get_stats64.base, #funAddr~sl_get_stats64.offset, ~#sl_netdev_ops~0.base, 128 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 136 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 144 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 152 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 160 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 168 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 176 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 184 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 192 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 200 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 208 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 216 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 224 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 232 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 240 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 248 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 256 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 264 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 272 + ~#sl_netdev_ops~0.offset, 8);~#sl_ldisc~0.base, ~#sl_ldisc~0.offset := 29, 0;call #Ultimate.allocInit(144, 29);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(18, 0, ~#sl_ldisc~0.base, 4 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 12 + ~#sl_ldisc~0.offset, 4);call write~init~int(0, ~#sl_ldisc~0.base, 16 + ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~slip_open.base, #funAddr~slip_open.offset, ~#sl_ldisc~0.base, 20 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_close.base, #funAddr~slip_close.offset, ~#sl_ldisc~0.base, 28 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 36 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 44 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 52 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 60 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_ioctl.base, #funAddr~slip_ioctl.offset, ~#sl_ldisc~0.base, 68 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_compat_ioctl.base, #funAddr~slip_compat_ioctl.offset, ~#sl_ldisc~0.base, 76 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 84 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 92 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_hangup.base, #funAddr~slip_hangup.offset, ~#sl_ldisc~0.base, 100 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_receive_buf.base, #funAddr~slip_receive_buf.offset, ~#sl_ldisc~0.base, 108 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_write_wakeup.base, #funAddr~slip_write_wakeup.offset, ~#sl_ldisc~0.base, 116 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 124 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#sl_ldisc~0.base, 132 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 140 + ~#sl_ldisc~0.offset, 4);~LDV_IN_INTERRUPT~0 := 0; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {973#(<= 256 ~slip_maxdev~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset, main_#t~ret479#1, main_#t~nondet480#1, main_#t~switch481#1, main_#t~mem482#1.base, main_#t~mem482#1.offset, main_#t~ret483#1, main_#t~mem484#1.base, main_#t~mem484#1.offset, main_#t~ret485#1, main_#t~mem486#1.base, main_#t~mem486#1.offset, main_#t~ret487#1, main_#t~mem488#1.base, main_#t~mem488#1.offset, main_#t~mem489#1.base, main_#t~mem489#1.offset, main_#t~ret490#1, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1.base, main_#t~ret492#1.offset, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~mem496#1.base, main_#t~mem496#1.offset, main_#t~ret497#1, main_#t~ret498#1, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~nondet502#1, main_~res_sl_init_14~0#1, main_~res_sl_open_11~0#1, main_~res_sl_close_10~0#1, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset, main_~var_sl_change_mtu_12_p1~0#1, main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset, main_~var_sl_ioctl_30_p2~0#1, main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset, main_~res_slip_open_21~0#1, main_~var_group6~0#1.base, main_~var_group6~0#1.offset, main_~var_slip_ioctl_28_p2~0#1, main_~var_slip_ioctl_28_p3~0#1, main_~var_slip_compat_ioctl_29_p2~0#1, main_~var_slip_compat_ioctl_29_p3~0#1, main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset, main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset, main_~var_slip_receive_buf_18_p3~0#1, main_~var_sl_keepalive_34_p0~0#1, main_~var_sl_outfill_33_p0~0#1, main_~ldv_s_sl_netdev_ops_net_device_ops~0#1, main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1, main_~tmp~38#1, main_~tmp___0~20#1, main_~tmp___1~13#1;havoc main_~res_sl_init_14~0#1;havoc main_~res_sl_open_11~0#1;havoc main_~res_sl_close_10~0#1;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;call main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset := #Ultimate.allocOnStack(184);havoc main_~var_sl_change_mtu_12_p1~0#1;call main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset := #Ultimate.allocOnStack(37);havoc main_~var_sl_ioctl_30_p2~0#1;call main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset := #Ultimate.allocOnStack(2516);havoc main_~res_slip_open_21~0#1;havoc main_~var_group6~0#1.base, main_~var_group6~0#1.offset;havoc main_~var_slip_ioctl_28_p2~0#1;havoc main_~var_slip_ioctl_28_p3~0#1;havoc main_~var_slip_compat_ioctl_29_p2~0#1;havoc main_~var_slip_compat_ioctl_29_p3~0#1;havoc main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset;havoc main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset;havoc main_~var_slip_receive_buf_18_p3~0#1;havoc main_~var_sl_keepalive_34_p0~0#1;havoc main_~var_sl_outfill_33_p0~0#1;havoc main_~ldv_s_sl_netdev_ops_net_device_ops~0#1;havoc main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1;havoc main_~tmp~38#1;havoc main_~tmp___0~20#1;havoc main_~tmp___1~13#1; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,828 INFO L272 TraceCheckUtils]: 2: Hoare triple {973#(<= 256 ~slip_maxdev~0)} call main_#t~ret478#1.base, main_#t~ret478#1.offset := dev_alloc_skb(1); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:16,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {971#true} is VALID [2022-02-20 21:36:16,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:16,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {971#true} is VALID [2022-02-20 21:36:16,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {971#true} is VALID [2022-02-20 21:36:16,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,829 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {971#true} {971#true} #2426#return; {971#true} is VALID [2022-02-20 21:36:16,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {971#true} is VALID [2022-02-20 21:36:16,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,831 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {971#true} {973#(<= 256 ~slip_maxdev~0)} #2436#return; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {973#(<= 256 ~slip_maxdev~0)} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret478#1.base, main_#t~ret478#1.offset;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset;main_~ldv_s_sl_netdev_ops_net_device_ops~0#1 := 0;main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {973#(<= 256 ~slip_maxdev~0)} assume { :end_inline_ldv_initialize } true; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,832 INFO L272 TraceCheckUtils]: 14: Hoare triple {973#(<= 256 ~slip_maxdev~0)} call ldv_handler_precall(); {971#true} is VALID [2022-02-20 21:36:16,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,833 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {971#true} {973#(<= 256 ~slip_maxdev~0)} #2438#return; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {973#(<= 256 ~slip_maxdev~0)} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet429#1, slip_init_#t~nondet430#1, slip_init_#t~nondet431#1, slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset, slip_init_#t~nondet433#1, slip_init_#t~ret434#1, slip_init_#t~nondet435#1, slip_init_~status~0#1, slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {973#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:16,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {973#(<= 256 ~slip_maxdev~0)} assume ~slip_maxdev~0 <= 3;~slip_maxdev~0 := 4; {972#false} is VALID [2022-02-20 21:36:16,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {972#false} havoc slip_init_#t~nondet429#1;havoc slip_init_#t~nondet430#1;havoc slip_init_#t~nondet431#1;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 8 * ~slip_maxdev~0, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {972#false} is VALID [2022-02-20 21:36:16,834 INFO L272 TraceCheckUtils]: 20: Hoare triple {972#false} call kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:16,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {971#true} is VALID [2022-02-20 21:36:16,835 INFO L272 TraceCheckUtils]: 22: Hoare triple {971#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:16,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {971#true} is VALID [2022-02-20 21:36:16,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {971#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {971#true} is VALID [2022-02-20 21:36:16,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,836 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {971#true} {971#true} #2424#return; {971#true} is VALID [2022-02-20 21:36:16,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {971#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {971#true} is VALID [2022-02-20 21:36:16,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {971#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {971#true} is VALID [2022-02-20 21:36:16,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,836 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {971#true} {972#false} #2440#return; {972#false} is VALID [2022-02-20 21:36:16,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {972#false} kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset := kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {972#false} is VALID [2022-02-20 21:36:16,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {972#false} slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset := slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;havoc slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {972#false} is VALID [2022-02-20 21:36:16,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {972#false} assume 0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616;havoc slip_init_#t~nondet433#1;slip_init_#res#1 := -12; {972#false} is VALID [2022-02-20 21:36:16,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {972#false} main_#t~ret479#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret479#1 && main_#t~ret479#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret479#1;havoc main_#t~ret479#1; {972#false} is VALID [2022-02-20 21:36:16,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {972#false} assume !(0 != main_~tmp~38#1); {972#false} is VALID [2022-02-20 21:36:16,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {972#false} assume -2147483648 <= main_#t~nondet502#1 && main_#t~nondet502#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1; {972#false} is VALID [2022-02-20 21:36:16,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {972#false} assume (0 != main_~tmp___1~13#1 || 0 != main_~ldv_s_sl_netdev_ops_net_device_ops~0#1) || 0 != main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {972#false} is VALID [2022-02-20 21:36:16,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {972#false} assume -2147483648 <= main_#t~nondet480#1 && main_#t~nondet480#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet480#1;havoc main_#t~nondet480#1;main_#t~switch481#1 := 0 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 1 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 2 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 3 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 4 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 5 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 6 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 7 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 8 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {972#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 9 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:16,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {972#false} assume main_#t~switch481#1; {972#false} is VALID [2022-02-20 21:36:16,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {972#false} assume 0 == main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {972#false} is VALID [2022-02-20 21:36:16,840 INFO L272 TraceCheckUtils]: 50: Hoare triple {972#false} call ldv_handler_precall(); {971#true} is VALID [2022-02-20 21:36:16,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:16,841 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {971#true} {972#false} #2560#return; {972#false} is VALID [2022-02-20 21:36:16,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {972#false} assume { :begin_inline_ldv_slip_open_3 } true;ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset := main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset;havoc ldv_slip_open_3_#res#1;havoc ldv_slip_open_3_#t~ret507#1, ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset, ldv_slip_open_3_~ldv_func_res~2#1, ldv_slip_open_3_~tmp~41#1;ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset := ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset;havoc ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret302#1, slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset, slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset, slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset, slip_open_#t~mem306#1, slip_open_#t~short307#1, slip_open_#t~ret308#1, slip_open_#t~ret309#1.base, slip_open_#t~ret309#1.offset, slip_open_#t~ret310#1, slip_open_#t~ret311#1.base, slip_open_#t~ret311#1.offset, slip_open_#t~mem312#1, slip_open_#t~ret313#1, slip_open_#t~ret314#1, slip_open_#t~mem315#1.base, slip_open_#t~mem315#1.offset, slip_open_#t~ret316#1, slip_open_#t~mem317#1, slip_open_#t~mem318#1, slip_open_#t~mem319#1, slip_open_#t~mem320#1, slip_open_~tty#1.base, slip_open_~tty#1.offset, slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset, slip_open_~err~2#1, slip_open_~tmp~26#1, slip_open_~tmp___0~10#1, slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset, slip_open_~tmp___2~3#1;slip_open_~tty#1.base, slip_open_~tty#1.offset := slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset;havoc slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset;havoc slip_open_~err~2#1;havoc slip_open_~tmp~26#1;havoc slip_open_~tmp___0~10#1;havoc slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset;havoc slip_open_~tmp___2~3#1;assume { :begin_inline_capable } true;capable_#in~arg0#1 := 12;havoc capable_#res#1;havoc capable_#t~nondet510#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet510#1 && capable_#t~nondet510#1 <= 2147483647;capable_#res#1 := capable_#t~nondet510#1;havoc capable_#t~nondet510#1; {972#false} is VALID [2022-02-20 21:36:16,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {972#false} slip_open_#t~ret302#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret302#1 && slip_open_#t~ret302#1 <= 2147483647;slip_open_~tmp~26#1 := slip_open_#t~ret302#1;havoc slip_open_#t~ret302#1; {972#false} is VALID [2022-02-20 21:36:16,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {972#false} assume 0 == slip_open_~tmp~26#1;slip_open_#res#1 := -1; {972#false} is VALID [2022-02-20 21:36:16,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {972#false} ldv_slip_open_3_#t~ret507#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret507#1 && ldv_slip_open_3_#t~ret507#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret507#1;havoc ldv_slip_open_3_#t~ret507#1;ldv_slip_open_3_~ldv_func_res~2#1 := ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_check_callback_ret_val_~ret_val#1;ldv_check_callback_ret_val_~ret_val#1 := ldv_check_callback_ret_val_#in~ret_val#1; {972#false} is VALID [2022-02-20 21:36:16,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {972#false} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0);assume { :begin_inline_ldv_error } true; {972#false} is VALID [2022-02-20 21:36:16,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-02-20 21:36:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 21:36:16,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:16,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070683946] [2022-02-20 21:36:16,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070683946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:16,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:16,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:36:16,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575799419] [2022-02-20 21:36:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:16,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-02-20 21:36:16,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:16,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 21:36:16,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:36:16,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:36:16,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:36:16,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:36:16,940 INFO L87 Difference]: Start difference. First operand has 968 states, 716 states have (on average 1.4329608938547487) internal successors, (1026), 743 states have internal predecessors, (1026), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 21:36:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:23,261 INFO L93 Difference]: Finished difference Result 1950 states and 2923 transitions. [2022-02-20 21:36:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:36:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-02-20 21:36:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:36:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 21:36:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2923 transitions. [2022-02-20 21:36:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 21:36:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2923 transitions. [2022-02-20 21:36:23,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 2923 transitions. [2022-02-20 21:36:25,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2923 edges. 2923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:36:25,972 INFO L225 Difference]: With dead ends: 1950 [2022-02-20 21:36:25,972 INFO L226 Difference]: Without dead ends: 947 [2022-02-20 21:36:25,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:36:25,985 INFO L933 BasicCegarLoop]: 1369 mSDtfsCounter, 1580 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:36:25,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1717 Valid, 1978 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 21:36:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-02-20 21:36:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-02-20 21:36:26,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:36:26,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 947 states. Second operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:26,253 INFO L74 IsIncluded]: Start isIncluded. First operand 947 states. Second operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:26,255 INFO L87 Difference]: Start difference. First operand 947 states. Second operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:26,302 INFO L93 Difference]: Finished difference Result 947 states and 1402 transitions. [2022-02-20 21:36:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1402 transitions. [2022-02-20 21:36:26,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:26,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:26,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 947 states. [2022-02-20 21:36:26,312 INFO L87 Difference]: Start difference. First operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 947 states. [2022-02-20 21:36:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:26,355 INFO L93 Difference]: Finished difference Result 947 states and 1402 transitions. [2022-02-20 21:36:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1402 transitions. [2022-02-20 21:36:26,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:26,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:26,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:36:26,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:36:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1371 transitions. [2022-02-20 21:36:26,432 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1371 transitions. Word has length 59 [2022-02-20 21:36:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:36:26,433 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1371 transitions. [2022-02-20 21:36:26,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 21:36:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1371 transitions. [2022-02-20 21:36:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 21:36:26,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:26,442 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:36:26,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:36:26,443 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:26,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash -155827494, now seen corresponding path program 1 times [2022-02-20 21:36:26,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:26,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578491424] [2022-02-20 21:36:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {6867#true} is VALID [2022-02-20 21:36:26,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {6867#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {6867#true} is VALID [2022-02-20 21:36:26,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6867#true} {6867#true} #2426#return; {6867#true} is VALID [2022-02-20 21:36:26,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {6867#true} is VALID [2022-02-20 21:36:26,603 INFO L272 TraceCheckUtils]: 1: Hoare triple {6867#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {6867#true} is VALID [2022-02-20 21:36:26,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {6867#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {6867#true} is VALID [2022-02-20 21:36:26,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,603 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6867#true} {6867#true} #2426#return; {6867#true} is VALID [2022-02-20 21:36:26,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {6867#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {6867#true} is VALID [2022-02-20 21:36:26,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,604 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6867#true} {6867#true} #2436#return; {6867#true} is VALID [2022-02-20 21:36:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,609 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {6867#true} {6867#true} #2438#return; {6867#true} is VALID [2022-02-20 21:36:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {6867#true} is VALID [2022-02-20 21:36:26,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {6867#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {6867#true} is VALID [2022-02-20 21:36:26,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6867#true} {6867#true} #2424#return; {6867#true} is VALID [2022-02-20 21:36:26,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {6867#true} is VALID [2022-02-20 21:36:26,623 INFO L272 TraceCheckUtils]: 1: Hoare triple {6867#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {6867#true} is VALID [2022-02-20 21:36:26,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {6867#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {6867#true} is VALID [2022-02-20 21:36:26,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,624 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6867#true} {6867#true} #2424#return; {6867#true} is VALID [2022-02-20 21:36:26,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {6867#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {6867#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,624 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6867#true} {6867#true} #2440#return; {6867#true} is VALID [2022-02-20 21:36:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:36:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,629 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {6867#true} {6868#false} #2560#return; {6868#false} is VALID [2022-02-20 21:36:26,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {6867#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(42, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(64, 4);call #Ultimate.allocInit(59, 5);call #Ultimate.allocInit(34, 6);call #Ultimate.allocInit(37, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(46, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(37, 13);call #Ultimate.allocInit(5, 14);call write~init~int(115, 14, 0, 1);call write~init~int(108, 14, 1, 1);call write~init~int(37, 14, 2, 1);call write~init~int(100, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(20, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(19, 17);call #Ultimate.allocInit(5, 18);call write~init~int(115, 18, 0, 1);call write~init~int(108, 18, 1, 1);call write~init~int(105, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(79, 19);call #Ultimate.allocInit(22, 20);call #Ultimate.allocInit(72, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(37, 25);call #Ultimate.allocInit(54, 26);call #Ultimate.allocInit(62, 27);~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 28, 0;call #Ultimate.allocInit(280, 28);call write~init~$Pointer$(#funAddr~sl_init.base, #funAddr~sl_init.offset, ~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_uninit.base, #funAddr~sl_uninit.offset, ~#sl_netdev_ops~0.base, 8 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_open.base, #funAddr~sl_open.offset, ~#sl_netdev_ops~0.base, 16 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_close.base, #funAddr~sl_close.offset, ~#sl_netdev_ops~0.base, 24 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_xmit.base, #funAddr~sl_xmit.offset, ~#sl_netdev_ops~0.base, 32 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 40 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 48 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 56 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 64 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 72 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 80 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_ioctl.base, #funAddr~sl_ioctl.offset, ~#sl_netdev_ops~0.base, 88 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 96 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_change_mtu.base, #funAddr~sl_change_mtu.offset, ~#sl_netdev_ops~0.base, 104 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 112 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_tx_timeout.base, #funAddr~sl_tx_timeout.offset, ~#sl_netdev_ops~0.base, 120 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_get_stats64.base, #funAddr~sl_get_stats64.offset, ~#sl_netdev_ops~0.base, 128 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 136 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 144 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 152 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 160 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 168 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 176 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 184 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 192 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 200 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 208 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 216 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 224 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 232 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 240 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 248 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 256 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 264 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 272 + ~#sl_netdev_ops~0.offset, 8);~#sl_ldisc~0.base, ~#sl_ldisc~0.offset := 29, 0;call #Ultimate.allocInit(144, 29);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(18, 0, ~#sl_ldisc~0.base, 4 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 12 + ~#sl_ldisc~0.offset, 4);call write~init~int(0, ~#sl_ldisc~0.base, 16 + ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~slip_open.base, #funAddr~slip_open.offset, ~#sl_ldisc~0.base, 20 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_close.base, #funAddr~slip_close.offset, ~#sl_ldisc~0.base, 28 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 36 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 44 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 52 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 60 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_ioctl.base, #funAddr~slip_ioctl.offset, ~#sl_ldisc~0.base, 68 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_compat_ioctl.base, #funAddr~slip_compat_ioctl.offset, ~#sl_ldisc~0.base, 76 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 84 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 92 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_hangup.base, #funAddr~slip_hangup.offset, ~#sl_ldisc~0.base, 100 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_receive_buf.base, #funAddr~slip_receive_buf.offset, ~#sl_ldisc~0.base, 108 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_write_wakeup.base, #funAddr~slip_write_wakeup.offset, ~#sl_ldisc~0.base, 116 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 124 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#sl_ldisc~0.base, 132 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 140 + ~#sl_ldisc~0.offset, 4);~LDV_IN_INTERRUPT~0 := 0; {6867#true} is VALID [2022-02-20 21:36:26,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {6867#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset, main_#t~ret479#1, main_#t~nondet480#1, main_#t~switch481#1, main_#t~mem482#1.base, main_#t~mem482#1.offset, main_#t~ret483#1, main_#t~mem484#1.base, main_#t~mem484#1.offset, main_#t~ret485#1, main_#t~mem486#1.base, main_#t~mem486#1.offset, main_#t~ret487#1, main_#t~mem488#1.base, main_#t~mem488#1.offset, main_#t~mem489#1.base, main_#t~mem489#1.offset, main_#t~ret490#1, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1.base, main_#t~ret492#1.offset, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~mem496#1.base, main_#t~mem496#1.offset, main_#t~ret497#1, main_#t~ret498#1, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~nondet502#1, main_~res_sl_init_14~0#1, main_~res_sl_open_11~0#1, main_~res_sl_close_10~0#1, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset, main_~var_sl_change_mtu_12_p1~0#1, main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset, main_~var_sl_ioctl_30_p2~0#1, main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset, main_~res_slip_open_21~0#1, main_~var_group6~0#1.base, main_~var_group6~0#1.offset, main_~var_slip_ioctl_28_p2~0#1, main_~var_slip_ioctl_28_p3~0#1, main_~var_slip_compat_ioctl_29_p2~0#1, main_~var_slip_compat_ioctl_29_p3~0#1, main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset, main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset, main_~var_slip_receive_buf_18_p3~0#1, main_~var_sl_keepalive_34_p0~0#1, main_~var_sl_outfill_33_p0~0#1, main_~ldv_s_sl_netdev_ops_net_device_ops~0#1, main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1, main_~tmp~38#1, main_~tmp___0~20#1, main_~tmp___1~13#1;havoc main_~res_sl_init_14~0#1;havoc main_~res_sl_open_11~0#1;havoc main_~res_sl_close_10~0#1;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;call main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset := #Ultimate.allocOnStack(184);havoc main_~var_sl_change_mtu_12_p1~0#1;call main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset := #Ultimate.allocOnStack(37);havoc main_~var_sl_ioctl_30_p2~0#1;call main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset := #Ultimate.allocOnStack(2516);havoc main_~res_slip_open_21~0#1;havoc main_~var_group6~0#1.base, main_~var_group6~0#1.offset;havoc main_~var_slip_ioctl_28_p2~0#1;havoc main_~var_slip_ioctl_28_p3~0#1;havoc main_~var_slip_compat_ioctl_29_p2~0#1;havoc main_~var_slip_compat_ioctl_29_p3~0#1;havoc main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset;havoc main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset;havoc main_~var_slip_receive_buf_18_p3~0#1;havoc main_~var_sl_keepalive_34_p0~0#1;havoc main_~var_sl_outfill_33_p0~0#1;havoc main_~ldv_s_sl_netdev_ops_net_device_ops~0#1;havoc main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1;havoc main_~tmp~38#1;havoc main_~tmp___0~20#1;havoc main_~tmp___1~13#1; {6867#true} is VALID [2022-02-20 21:36:26,630 INFO L272 TraceCheckUtils]: 2: Hoare triple {6867#true} call main_#t~ret478#1.base, main_#t~ret478#1.offset := dev_alloc_skb(1); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {6867#true} is VALID [2022-02-20 21:36:26,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {6867#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {6867#true} is VALID [2022-02-20 21:36:26,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {6867#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {6867#true} is VALID [2022-02-20 21:36:26,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,632 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6867#true} {6867#true} #2426#return; {6867#true} is VALID [2022-02-20 21:36:26,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {6867#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {6867#true} is VALID [2022-02-20 21:36:26,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,632 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6867#true} {6867#true} #2436#return; {6867#true} is VALID [2022-02-20 21:36:26,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {6867#true} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret478#1.base, main_#t~ret478#1.offset;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset;main_~ldv_s_sl_netdev_ops_net_device_ops~0#1 := 0;main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {6867#true} is VALID [2022-02-20 21:36:26,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {6867#true} assume { :end_inline_ldv_initialize } true; {6867#true} is VALID [2022-02-20 21:36:26,633 INFO L272 TraceCheckUtils]: 14: Hoare triple {6867#true} call ldv_handler_precall(); {6867#true} is VALID [2022-02-20 21:36:26,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,633 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6867#true} {6867#true} #2438#return; {6867#true} is VALID [2022-02-20 21:36:26,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {6867#true} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet429#1, slip_init_#t~nondet430#1, slip_init_#t~nondet431#1, slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset, slip_init_#t~nondet433#1, slip_init_#t~ret434#1, slip_init_#t~nondet435#1, slip_init_~status~0#1, slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {6867#true} assume !(~slip_maxdev~0 <= 3); {6867#true} is VALID [2022-02-20 21:36:26,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {6867#true} havoc slip_init_#t~nondet429#1;havoc slip_init_#t~nondet430#1;havoc slip_init_#t~nondet431#1;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 8 * ~slip_maxdev~0, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,634 INFO L272 TraceCheckUtils]: 20: Hoare triple {6867#true} call kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {6867#true} is VALID [2022-02-20 21:36:26,635 INFO L272 TraceCheckUtils]: 22: Hoare triple {6867#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {6867#true} is VALID [2022-02-20 21:36:26,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {6867#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {6867#true} is VALID [2022-02-20 21:36:26,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,636 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6867#true} {6867#true} #2424#return; {6867#true} is VALID [2022-02-20 21:36:26,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {6867#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {6867#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,636 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6867#true} {6867#true} #2440#return; {6867#true} is VALID [2022-02-20 21:36:26,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {6867#true} kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset := kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {6867#true} slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset := slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;havoc slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {6867#true} is VALID [2022-02-20 21:36:26,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {6867#true} assume 0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616;havoc slip_init_#t~nondet433#1;slip_init_#res#1 := -12; {6890#(<= (+ |ULTIMATE.start_slip_init_#res#1| 12) 0)} is VALID [2022-02-20 21:36:26,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {6890#(<= (+ |ULTIMATE.start_slip_init_#res#1| 12) 0)} main_#t~ret479#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret479#1 && main_#t~ret479#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret479#1;havoc main_#t~ret479#1; {6891#(<= (+ |ULTIMATE.start_main_~tmp~38#1| 12) 0)} is VALID [2022-02-20 21:36:26,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {6891#(<= (+ |ULTIMATE.start_main_~tmp~38#1| 12) 0)} assume !(0 != main_~tmp~38#1); {6868#false} is VALID [2022-02-20 21:36:26,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {6868#false} assume -2147483648 <= main_#t~nondet502#1 && main_#t~nondet502#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1; {6868#false} is VALID [2022-02-20 21:36:26,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {6868#false} assume (0 != main_~tmp___1~13#1 || 0 != main_~ldv_s_sl_netdev_ops_net_device_ops~0#1) || 0 != main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {6868#false} is VALID [2022-02-20 21:36:26,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {6868#false} assume -2147483648 <= main_#t~nondet480#1 && main_#t~nondet480#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet480#1;havoc main_#t~nondet480#1;main_#t~switch481#1 := 0 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 1 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 2 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 3 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 4 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 5 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 6 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 7 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 8 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {6868#false} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 9 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {6868#false} assume main_#t~switch481#1; {6868#false} is VALID [2022-02-20 21:36:26,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {6868#false} assume 0 == main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {6868#false} is VALID [2022-02-20 21:36:26,640 INFO L272 TraceCheckUtils]: 50: Hoare triple {6868#false} call ldv_handler_precall(); {6867#true} is VALID [2022-02-20 21:36:26,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,641 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6867#true} {6868#false} #2560#return; {6868#false} is VALID [2022-02-20 21:36:26,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {6868#false} assume { :begin_inline_ldv_slip_open_3 } true;ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset := main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset;havoc ldv_slip_open_3_#res#1;havoc ldv_slip_open_3_#t~ret507#1, ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset, ldv_slip_open_3_~ldv_func_res~2#1, ldv_slip_open_3_~tmp~41#1;ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset := ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset;havoc ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret302#1, slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset, slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset, slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset, slip_open_#t~mem306#1, slip_open_#t~short307#1, slip_open_#t~ret308#1, slip_open_#t~ret309#1.base, slip_open_#t~ret309#1.offset, slip_open_#t~ret310#1, slip_open_#t~ret311#1.base, slip_open_#t~ret311#1.offset, slip_open_#t~mem312#1, slip_open_#t~ret313#1, slip_open_#t~ret314#1, slip_open_#t~mem315#1.base, slip_open_#t~mem315#1.offset, slip_open_#t~ret316#1, slip_open_#t~mem317#1, slip_open_#t~mem318#1, slip_open_#t~mem319#1, slip_open_#t~mem320#1, slip_open_~tty#1.base, slip_open_~tty#1.offset, slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset, slip_open_~err~2#1, slip_open_~tmp~26#1, slip_open_~tmp___0~10#1, slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset, slip_open_~tmp___2~3#1;slip_open_~tty#1.base, slip_open_~tty#1.offset := slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset;havoc slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset;havoc slip_open_~err~2#1;havoc slip_open_~tmp~26#1;havoc slip_open_~tmp___0~10#1;havoc slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset;havoc slip_open_~tmp___2~3#1;assume { :begin_inline_capable } true;capable_#in~arg0#1 := 12;havoc capable_#res#1;havoc capable_#t~nondet510#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet510#1 && capable_#t~nondet510#1 <= 2147483647;capable_#res#1 := capable_#t~nondet510#1;havoc capable_#t~nondet510#1; {6868#false} is VALID [2022-02-20 21:36:26,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {6868#false} slip_open_#t~ret302#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret302#1 && slip_open_#t~ret302#1 <= 2147483647;slip_open_~tmp~26#1 := slip_open_#t~ret302#1;havoc slip_open_#t~ret302#1; {6868#false} is VALID [2022-02-20 21:36:26,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {6868#false} assume 0 == slip_open_~tmp~26#1;slip_open_#res#1 := -1; {6868#false} is VALID [2022-02-20 21:36:26,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {6868#false} ldv_slip_open_3_#t~ret507#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret507#1 && ldv_slip_open_3_#t~ret507#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret507#1;havoc ldv_slip_open_3_#t~ret507#1;ldv_slip_open_3_~ldv_func_res~2#1 := ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_check_callback_ret_val_~ret_val#1;ldv_check_callback_ret_val_~ret_val#1 := ldv_check_callback_ret_val_#in~ret_val#1; {6868#false} is VALID [2022-02-20 21:36:26,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {6868#false} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0);assume { :begin_inline_ldv_error } true; {6868#false} is VALID [2022-02-20 21:36:26,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {6868#false} assume !false; {6868#false} is VALID [2022-02-20 21:36:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 21:36:26,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:26,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578491424] [2022-02-20 21:36:26,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578491424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:26,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:26,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:36:26,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590701233] [2022-02-20 21:36:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:26,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-02-20 21:36:26,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:26,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:36:26,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:36:26,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:36:26,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:36:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:36:26,683 INFO L87 Difference]: Start difference. First operand 929 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:36:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:35,313 INFO L93 Difference]: Finished difference Result 1859 states and 2750 transitions. [2022-02-20 21:36:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:36:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-02-20 21:36:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:36:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:36:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2750 transitions. [2022-02-20 21:36:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:36:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2750 transitions. [2022-02-20 21:36:35,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 2750 transitions. [2022-02-20 21:36:37,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2750 edges. 2750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:36:37,185 INFO L225 Difference]: With dead ends: 1859 [2022-02-20 21:36:37,185 INFO L226 Difference]: Without dead ends: 947 [2022-02-20 21:36:37,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:36:37,193 INFO L933 BasicCegarLoop]: 1327 mSDtfsCounter, 372 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:36:37,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 3538 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 21:36:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-02-20 21:36:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-02-20 21:36:37,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:36:37,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 947 states. Second operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:37,372 INFO L74 IsIncluded]: Start isIncluded. First operand 947 states. Second operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:37,373 INFO L87 Difference]: Start difference. First operand 947 states. Second operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:37,410 INFO L93 Difference]: Finished difference Result 947 states and 1401 transitions. [2022-02-20 21:36:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1401 transitions. [2022-02-20 21:36:37,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:37,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:37,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 947 states. [2022-02-20 21:36:37,418 INFO L87 Difference]: Start difference. First operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 947 states. [2022-02-20 21:36:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:37,457 INFO L93 Difference]: Finished difference Result 947 states and 1401 transitions. [2022-02-20 21:36:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1401 transitions. [2022-02-20 21:36:37,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:37,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:37,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:36:37,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:36:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1370 transitions. [2022-02-20 21:36:37,506 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1370 transitions. Word has length 59 [2022-02-20 21:36:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:36:37,507 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1370 transitions. [2022-02-20 21:36:37,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:36:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1370 transitions. [2022-02-20 21:36:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 21:36:37,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:37,508 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:36:37,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:36:37,509 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1779924711, now seen corresponding path program 1 times [2022-02-20 21:36:37,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:37,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598901530] [2022-02-20 21:36:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {12622#true} is VALID [2022-02-20 21:36:37,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {12622#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {12622#true} is VALID [2022-02-20 21:36:37,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12622#true} {12622#true} #2426#return; {12622#true} is VALID [2022-02-20 21:36:37,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {12622#true} is VALID [2022-02-20 21:36:37,644 INFO L272 TraceCheckUtils]: 1: Hoare triple {12622#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {12622#true} is VALID [2022-02-20 21:36:37,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {12622#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {12622#true} is VALID [2022-02-20 21:36:37,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,645 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12622#true} {12622#true} #2426#return; {12622#true} is VALID [2022-02-20 21:36:37,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {12622#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {12622#true} is VALID [2022-02-20 21:36:37,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,645 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12622#true} {12622#true} #2436#return; {12622#true} is VALID [2022-02-20 21:36:37,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,657 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {12622#true} {12622#true} #2438#return; {12622#true} is VALID [2022-02-20 21:36:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {12622#true} is VALID [2022-02-20 21:36:37,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {12622#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {12622#true} is VALID [2022-02-20 21:36:37,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12622#true} {12622#true} #2424#return; {12622#true} is VALID [2022-02-20 21:36:37,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {12622#true} is VALID [2022-02-20 21:36:37,676 INFO L272 TraceCheckUtils]: 1: Hoare triple {12622#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {12622#true} is VALID [2022-02-20 21:36:37,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {12622#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {12622#true} is VALID [2022-02-20 21:36:37,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,678 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12622#true} {12622#true} #2424#return; {12622#true} is VALID [2022-02-20 21:36:37,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {12622#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,679 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12622#true} {12622#true} #2440#return; {12622#true} is VALID [2022-02-20 21:36:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:36:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,684 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {12622#true} {12622#true} #2560#return; {12622#true} is VALID [2022-02-20 21:36:37,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {12622#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(42, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(64, 4);call #Ultimate.allocInit(59, 5);call #Ultimate.allocInit(34, 6);call #Ultimate.allocInit(37, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(46, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(37, 13);call #Ultimate.allocInit(5, 14);call write~init~int(115, 14, 0, 1);call write~init~int(108, 14, 1, 1);call write~init~int(37, 14, 2, 1);call write~init~int(100, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(20, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(19, 17);call #Ultimate.allocInit(5, 18);call write~init~int(115, 18, 0, 1);call write~init~int(108, 18, 1, 1);call write~init~int(105, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(79, 19);call #Ultimate.allocInit(22, 20);call #Ultimate.allocInit(72, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(37, 25);call #Ultimate.allocInit(54, 26);call #Ultimate.allocInit(62, 27);~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 28, 0;call #Ultimate.allocInit(280, 28);call write~init~$Pointer$(#funAddr~sl_init.base, #funAddr~sl_init.offset, ~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_uninit.base, #funAddr~sl_uninit.offset, ~#sl_netdev_ops~0.base, 8 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_open.base, #funAddr~sl_open.offset, ~#sl_netdev_ops~0.base, 16 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_close.base, #funAddr~sl_close.offset, ~#sl_netdev_ops~0.base, 24 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_xmit.base, #funAddr~sl_xmit.offset, ~#sl_netdev_ops~0.base, 32 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 40 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 48 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 56 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 64 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 72 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 80 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_ioctl.base, #funAddr~sl_ioctl.offset, ~#sl_netdev_ops~0.base, 88 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 96 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_change_mtu.base, #funAddr~sl_change_mtu.offset, ~#sl_netdev_ops~0.base, 104 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 112 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_tx_timeout.base, #funAddr~sl_tx_timeout.offset, ~#sl_netdev_ops~0.base, 120 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_get_stats64.base, #funAddr~sl_get_stats64.offset, ~#sl_netdev_ops~0.base, 128 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 136 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 144 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 152 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 160 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 168 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 176 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 184 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 192 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 200 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 208 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 216 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 224 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 232 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 240 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 248 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 256 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 264 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 272 + ~#sl_netdev_ops~0.offset, 8);~#sl_ldisc~0.base, ~#sl_ldisc~0.offset := 29, 0;call #Ultimate.allocInit(144, 29);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(18, 0, ~#sl_ldisc~0.base, 4 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 12 + ~#sl_ldisc~0.offset, 4);call write~init~int(0, ~#sl_ldisc~0.base, 16 + ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~slip_open.base, #funAddr~slip_open.offset, ~#sl_ldisc~0.base, 20 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_close.base, #funAddr~slip_close.offset, ~#sl_ldisc~0.base, 28 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 36 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 44 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 52 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 60 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_ioctl.base, #funAddr~slip_ioctl.offset, ~#sl_ldisc~0.base, 68 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_compat_ioctl.base, #funAddr~slip_compat_ioctl.offset, ~#sl_ldisc~0.base, 76 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 84 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 92 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_hangup.base, #funAddr~slip_hangup.offset, ~#sl_ldisc~0.base, 100 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_receive_buf.base, #funAddr~slip_receive_buf.offset, ~#sl_ldisc~0.base, 108 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_write_wakeup.base, #funAddr~slip_write_wakeup.offset, ~#sl_ldisc~0.base, 116 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 124 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#sl_ldisc~0.base, 132 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 140 + ~#sl_ldisc~0.offset, 4);~LDV_IN_INTERRUPT~0 := 0; {12622#true} is VALID [2022-02-20 21:36:37,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {12622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset, main_#t~ret479#1, main_#t~nondet480#1, main_#t~switch481#1, main_#t~mem482#1.base, main_#t~mem482#1.offset, main_#t~ret483#1, main_#t~mem484#1.base, main_#t~mem484#1.offset, main_#t~ret485#1, main_#t~mem486#1.base, main_#t~mem486#1.offset, main_#t~ret487#1, main_#t~mem488#1.base, main_#t~mem488#1.offset, main_#t~mem489#1.base, main_#t~mem489#1.offset, main_#t~ret490#1, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1.base, main_#t~ret492#1.offset, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~mem496#1.base, main_#t~mem496#1.offset, main_#t~ret497#1, main_#t~ret498#1, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~nondet502#1, main_~res_sl_init_14~0#1, main_~res_sl_open_11~0#1, main_~res_sl_close_10~0#1, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset, main_~var_sl_change_mtu_12_p1~0#1, main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset, main_~var_sl_ioctl_30_p2~0#1, main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset, main_~res_slip_open_21~0#1, main_~var_group6~0#1.base, main_~var_group6~0#1.offset, main_~var_slip_ioctl_28_p2~0#1, main_~var_slip_ioctl_28_p3~0#1, main_~var_slip_compat_ioctl_29_p2~0#1, main_~var_slip_compat_ioctl_29_p3~0#1, main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset, main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset, main_~var_slip_receive_buf_18_p3~0#1, main_~var_sl_keepalive_34_p0~0#1, main_~var_sl_outfill_33_p0~0#1, main_~ldv_s_sl_netdev_ops_net_device_ops~0#1, main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1, main_~tmp~38#1, main_~tmp___0~20#1, main_~tmp___1~13#1;havoc main_~res_sl_init_14~0#1;havoc main_~res_sl_open_11~0#1;havoc main_~res_sl_close_10~0#1;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;call main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset := #Ultimate.allocOnStack(184);havoc main_~var_sl_change_mtu_12_p1~0#1;call main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset := #Ultimate.allocOnStack(37);havoc main_~var_sl_ioctl_30_p2~0#1;call main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset := #Ultimate.allocOnStack(2516);havoc main_~res_slip_open_21~0#1;havoc main_~var_group6~0#1.base, main_~var_group6~0#1.offset;havoc main_~var_slip_ioctl_28_p2~0#1;havoc main_~var_slip_ioctl_28_p3~0#1;havoc main_~var_slip_compat_ioctl_29_p2~0#1;havoc main_~var_slip_compat_ioctl_29_p3~0#1;havoc main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset;havoc main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset;havoc main_~var_slip_receive_buf_18_p3~0#1;havoc main_~var_sl_keepalive_34_p0~0#1;havoc main_~var_sl_outfill_33_p0~0#1;havoc main_~ldv_s_sl_netdev_ops_net_device_ops~0#1;havoc main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1;havoc main_~tmp~38#1;havoc main_~tmp___0~20#1;havoc main_~tmp___1~13#1; {12622#true} is VALID [2022-02-20 21:36:37,685 INFO L272 TraceCheckUtils]: 2: Hoare triple {12622#true} call main_#t~ret478#1.base, main_#t~ret478#1.offset := dev_alloc_skb(1); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {12622#true} is VALID [2022-02-20 21:36:37,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {12622#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {12622#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12622#true} {12622#true} #2426#return; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {12622#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12622#true} {12622#true} #2436#return; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {12622#true} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret478#1.base, main_#t~ret478#1.offset;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset;main_~ldv_s_sl_netdev_ops_net_device_ops~0#1 := 0;main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {12622#true} is VALID [2022-02-20 21:36:37,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {12622#true} assume { :end_inline_ldv_initialize } true; {12622#true} is VALID [2022-02-20 21:36:37,687 INFO L272 TraceCheckUtils]: 14: Hoare triple {12622#true} call ldv_handler_precall(); {12622#true} is VALID [2022-02-20 21:36:37,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,687 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12622#true} {12622#true} #2438#return; {12622#true} is VALID [2022-02-20 21:36:37,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {12622#true} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet429#1, slip_init_#t~nondet430#1, slip_init_#t~nondet431#1, slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset, slip_init_#t~nondet433#1, slip_init_#t~ret434#1, slip_init_#t~nondet435#1, slip_init_~status~0#1, slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {12622#true} assume !(~slip_maxdev~0 <= 3); {12622#true} is VALID [2022-02-20 21:36:37,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {12622#true} havoc slip_init_#t~nondet429#1;havoc slip_init_#t~nondet430#1;havoc slip_init_#t~nondet431#1;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 8 * ~slip_maxdev~0, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,688 INFO L272 TraceCheckUtils]: 20: Hoare triple {12622#true} call kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {12622#true} is VALID [2022-02-20 21:36:37,688 INFO L272 TraceCheckUtils]: 22: Hoare triple {12622#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {12622#true} is VALID [2022-02-20 21:36:37,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {12622#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {12622#true} is VALID [2022-02-20 21:36:37,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12622#true} {12622#true} #2424#return; {12622#true} is VALID [2022-02-20 21:36:37,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {12622#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {12622#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,697 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12622#true} {12622#true} #2440#return; {12622#true} is VALID [2022-02-20 21:36:37,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {12622#true} kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset := kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {12622#true} slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset := slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;havoc slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {12622#true} is VALID [2022-02-20 21:36:37,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {12622#true} assume !(0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616);assume { :begin_inline_tty_register_ldisc } true;tty_register_ldisc_#in~arg0#1, tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset := 1, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset;havoc tty_register_ldisc_#res#1;havoc tty_register_ldisc_#t~nondet532#1, tty_register_ldisc_~arg0#1, tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset;tty_register_ldisc_~arg0#1 := tty_register_ldisc_#in~arg0#1;tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset := tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset;assume -2147483648 <= tty_register_ldisc_#t~nondet532#1 && tty_register_ldisc_#t~nondet532#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet532#1;havoc tty_register_ldisc_#t~nondet532#1; {12622#true} is VALID [2022-02-20 21:36:37,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {12622#true} slip_init_#t~ret434#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= slip_init_#t~ret434#1 && slip_init_#t~ret434#1 <= 2147483647;slip_init_~status~0#1 := slip_init_#t~ret434#1;havoc slip_init_#t~ret434#1; {12622#true} is VALID [2022-02-20 21:36:37,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {12622#true} assume !(0 != slip_init_~status~0#1); {12622#true} is VALID [2022-02-20 21:36:37,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {12622#true} slip_init_#res#1 := slip_init_~status~0#1; {12622#true} is VALID [2022-02-20 21:36:37,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {12622#true} main_#t~ret479#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret479#1 && main_#t~ret479#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret479#1;havoc main_#t~ret479#1; {12622#true} is VALID [2022-02-20 21:36:37,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {12622#true} assume !(0 != main_~tmp~38#1); {12622#true} is VALID [2022-02-20 21:36:37,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {12622#true} assume -2147483648 <= main_#t~nondet502#1 && main_#t~nondet502#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1; {12622#true} is VALID [2022-02-20 21:36:37,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {12622#true} assume (0 != main_~tmp___1~13#1 || 0 != main_~ldv_s_sl_netdev_ops_net_device_ops~0#1) || 0 != main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {12622#true} is VALID [2022-02-20 21:36:37,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {12622#true} assume -2147483648 <= main_#t~nondet480#1 && main_#t~nondet480#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet480#1;havoc main_#t~nondet480#1;main_#t~switch481#1 := 0 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 1 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 2 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 3 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 4 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 5 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 6 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 7 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 8 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {12622#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 9 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {12622#true} assume main_#t~switch481#1; {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {12622#true} assume 0 == main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L272 TraceCheckUtils]: 53: Hoare triple {12622#true} call ldv_handler_precall(); {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12622#true} {12622#true} #2560#return; {12622#true} is VALID [2022-02-20 21:36:37,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {12622#true} assume { :begin_inline_ldv_slip_open_3 } true;ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset := main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset;havoc ldv_slip_open_3_#res#1;havoc ldv_slip_open_3_#t~ret507#1, ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset, ldv_slip_open_3_~ldv_func_res~2#1, ldv_slip_open_3_~tmp~41#1;ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset := ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset;havoc ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret302#1, slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset, slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset, slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset, slip_open_#t~mem306#1, slip_open_#t~short307#1, slip_open_#t~ret308#1, slip_open_#t~ret309#1.base, slip_open_#t~ret309#1.offset, slip_open_#t~ret310#1, slip_open_#t~ret311#1.base, slip_open_#t~ret311#1.offset, slip_open_#t~mem312#1, slip_open_#t~ret313#1, slip_open_#t~ret314#1, slip_open_#t~mem315#1.base, slip_open_#t~mem315#1.offset, slip_open_#t~ret316#1, slip_open_#t~mem317#1, slip_open_#t~mem318#1, slip_open_#t~mem319#1, slip_open_#t~mem320#1, slip_open_~tty#1.base, slip_open_~tty#1.offset, slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset, slip_open_~err~2#1, slip_open_~tmp~26#1, slip_open_~tmp___0~10#1, slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset, slip_open_~tmp___2~3#1;slip_open_~tty#1.base, slip_open_~tty#1.offset := slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset;havoc slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset;havoc slip_open_~err~2#1;havoc slip_open_~tmp~26#1;havoc slip_open_~tmp___0~10#1;havoc slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset;havoc slip_open_~tmp___2~3#1;assume { :begin_inline_capable } true;capable_#in~arg0#1 := 12;havoc capable_#res#1;havoc capable_#t~nondet510#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet510#1 && capable_#t~nondet510#1 <= 2147483647;capable_#res#1 := capable_#t~nondet510#1;havoc capable_#t~nondet510#1; {12622#true} is VALID [2022-02-20 21:36:37,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {12622#true} slip_open_#t~ret302#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret302#1 && slip_open_#t~ret302#1 <= 2147483647;slip_open_~tmp~26#1 := slip_open_#t~ret302#1;havoc slip_open_#t~ret302#1; {12622#true} is VALID [2022-02-20 21:36:37,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {12622#true} assume 0 == slip_open_~tmp~26#1;slip_open_#res#1 := -1; {12647#(<= (+ |ULTIMATE.start_slip_open_#res#1| 1) 0)} is VALID [2022-02-20 21:36:37,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {12647#(<= (+ |ULTIMATE.start_slip_open_#res#1| 1) 0)} ldv_slip_open_3_#t~ret507#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret507#1 && ldv_slip_open_3_#t~ret507#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret507#1;havoc ldv_slip_open_3_#t~ret507#1;ldv_slip_open_3_~ldv_func_res~2#1 := ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_check_callback_ret_val_~ret_val#1;ldv_check_callback_ret_val_~ret_val#1 := ldv_check_callback_ret_val_#in~ret_val#1; {12648#(<= (+ |ULTIMATE.start_ldv_check_callback_ret_val_~ret_val#1| 1) 0)} is VALID [2022-02-20 21:36:37,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {12648#(<= (+ |ULTIMATE.start_ldv_check_callback_ret_val_~ret_val#1| 1) 0)} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0);assume { :begin_inline_ldv_error } true; {12623#false} is VALID [2022-02-20 21:36:37,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {12623#false} assume !false; {12623#false} is VALID [2022-02-20 21:36:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 21:36:37,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:37,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598901530] [2022-02-20 21:36:37,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598901530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:37,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:37,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:36:37,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133676023] [2022-02-20 21:36:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:37,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-02-20 21:36:37,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:37,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:36:37,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:36:37,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:36:37,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:36:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:36:37,756 INFO L87 Difference]: Start difference. First operand 929 states and 1370 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:36:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:51,230 INFO L93 Difference]: Finished difference Result 1461 states and 2231 transitions. [2022-02-20 21:36:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:36:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-02-20 21:36:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:36:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:36:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2022-02-20 21:36:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:36:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2022-02-20 21:36:51,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 2231 transitions. [2022-02-20 21:36:52,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2231 edges. 2231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:36:53,090 INFO L225 Difference]: With dead ends: 1461 [2022-02-20 21:36:53,090 INFO L226 Difference]: Without dead ends: 1459 [2022-02-20 21:36:53,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:36:53,091 INFO L933 BasicCegarLoop]: 2137 mSDtfsCounter, 1296 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 5310 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 21:36:53,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1381 Valid, 5310 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 21:36:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-02-20 21:36:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 931. [2022-02-20 21:36:53,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:36:53,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1459 states. Second operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:53,445 INFO L74 IsIncluded]: Start isIncluded. First operand 1459 states. Second operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:53,446 INFO L87 Difference]: Start difference. First operand 1459 states. Second operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:53,515 INFO L93 Difference]: Finished difference Result 1459 states and 2229 transitions. [2022-02-20 21:36:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2229 transitions. [2022-02-20 21:36:53,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:53,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:53,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 1459 states. [2022-02-20 21:36:53,538 INFO L87 Difference]: Start difference. First operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 1459 states. [2022-02-20 21:36:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:53,610 INFO L93 Difference]: Finished difference Result 1459 states and 2229 transitions. [2022-02-20 21:36:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2229 transitions. [2022-02-20 21:36:53,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:53,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:53,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:36:53,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:36:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:36:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1372 transitions. [2022-02-20 21:36:53,661 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1372 transitions. Word has length 62 [2022-02-20 21:36:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:36:53,661 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1372 transitions. [2022-02-20 21:36:53,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:36:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1372 transitions. [2022-02-20 21:36:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 21:36:53,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:53,663 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:36:53,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:36:53,664 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2124530077, now seen corresponding path program 1 times [2022-02-20 21:36:53,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:53,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066174626] [2022-02-20 21:36:53,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {18878#true} is VALID [2022-02-20 21:36:53,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {18878#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {18878#true} is VALID [2022-02-20 21:36:53,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18878#true} {18878#true} #2426#return; {18878#true} is VALID [2022-02-20 21:36:53,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {18878#true} is VALID [2022-02-20 21:36:53,808 INFO L272 TraceCheckUtils]: 1: Hoare triple {18878#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:53,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {18878#true} is VALID [2022-02-20 21:36:53,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {18878#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {18878#true} is VALID [2022-02-20 21:36:53,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,809 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18878#true} {18878#true} #2426#return; {18878#true} is VALID [2022-02-20 21:36:53,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {18878#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {18878#true} is VALID [2022-02-20 21:36:53,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,809 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2436#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,814 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2438#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {18878#true} is VALID [2022-02-20 21:36:53,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {18878#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {18878#true} is VALID [2022-02-20 21:36:53,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18878#true} {18878#true} #2424#return; {18878#true} is VALID [2022-02-20 21:36:53,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {18878#true} is VALID [2022-02-20 21:36:53,827 INFO L272 TraceCheckUtils]: 1: Hoare triple {18878#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:53,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {18878#true} is VALID [2022-02-20 21:36:53,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {18878#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {18878#true} is VALID [2022-02-20 21:36:53,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,827 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18878#true} {18878#true} #2424#return; {18878#true} is VALID [2022-02-20 21:36:53,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {18878#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {18878#true} is VALID [2022-02-20 21:36:53,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {18878#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {18878#true} is VALID [2022-02-20 21:36:53,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,828 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2440#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:36:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,833 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2560#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 21:36:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:53,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,837 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {18878#true} {18879#false} #2622#return; {18879#false} is VALID [2022-02-20 21:36:53,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {18878#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(42, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(64, 4);call #Ultimate.allocInit(59, 5);call #Ultimate.allocInit(34, 6);call #Ultimate.allocInit(37, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(46, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(37, 13);call #Ultimate.allocInit(5, 14);call write~init~int(115, 14, 0, 1);call write~init~int(108, 14, 1, 1);call write~init~int(37, 14, 2, 1);call write~init~int(100, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(20, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(19, 17);call #Ultimate.allocInit(5, 18);call write~init~int(115, 18, 0, 1);call write~init~int(108, 18, 1, 1);call write~init~int(105, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(79, 19);call #Ultimate.allocInit(22, 20);call #Ultimate.allocInit(72, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(37, 25);call #Ultimate.allocInit(54, 26);call #Ultimate.allocInit(62, 27);~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 28, 0;call #Ultimate.allocInit(280, 28);call write~init~$Pointer$(#funAddr~sl_init.base, #funAddr~sl_init.offset, ~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_uninit.base, #funAddr~sl_uninit.offset, ~#sl_netdev_ops~0.base, 8 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_open.base, #funAddr~sl_open.offset, ~#sl_netdev_ops~0.base, 16 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_close.base, #funAddr~sl_close.offset, ~#sl_netdev_ops~0.base, 24 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_xmit.base, #funAddr~sl_xmit.offset, ~#sl_netdev_ops~0.base, 32 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 40 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 48 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 56 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 64 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 72 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 80 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_ioctl.base, #funAddr~sl_ioctl.offset, ~#sl_netdev_ops~0.base, 88 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 96 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_change_mtu.base, #funAddr~sl_change_mtu.offset, ~#sl_netdev_ops~0.base, 104 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 112 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_tx_timeout.base, #funAddr~sl_tx_timeout.offset, ~#sl_netdev_ops~0.base, 120 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_get_stats64.base, #funAddr~sl_get_stats64.offset, ~#sl_netdev_ops~0.base, 128 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 136 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 144 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 152 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 160 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 168 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 176 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 184 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 192 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 200 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 208 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 216 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 224 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 232 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 240 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 248 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 256 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 264 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 272 + ~#sl_netdev_ops~0.offset, 8);~#sl_ldisc~0.base, ~#sl_ldisc~0.offset := 29, 0;call #Ultimate.allocInit(144, 29);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(18, 0, ~#sl_ldisc~0.base, 4 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 12 + ~#sl_ldisc~0.offset, 4);call write~init~int(0, ~#sl_ldisc~0.base, 16 + ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~slip_open.base, #funAddr~slip_open.offset, ~#sl_ldisc~0.base, 20 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_close.base, #funAddr~slip_close.offset, ~#sl_ldisc~0.base, 28 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 36 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 44 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 52 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 60 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_ioctl.base, #funAddr~slip_ioctl.offset, ~#sl_ldisc~0.base, 68 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_compat_ioctl.base, #funAddr~slip_compat_ioctl.offset, ~#sl_ldisc~0.base, 76 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 84 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 92 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_hangup.base, #funAddr~slip_hangup.offset, ~#sl_ldisc~0.base, 100 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_receive_buf.base, #funAddr~slip_receive_buf.offset, ~#sl_ldisc~0.base, 108 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_write_wakeup.base, #funAddr~slip_write_wakeup.offset, ~#sl_ldisc~0.base, 116 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 124 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#sl_ldisc~0.base, 132 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 140 + ~#sl_ldisc~0.offset, 4);~LDV_IN_INTERRUPT~0 := 0; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset, main_#t~ret479#1, main_#t~nondet480#1, main_#t~switch481#1, main_#t~mem482#1.base, main_#t~mem482#1.offset, main_#t~ret483#1, main_#t~mem484#1.base, main_#t~mem484#1.offset, main_#t~ret485#1, main_#t~mem486#1.base, main_#t~mem486#1.offset, main_#t~ret487#1, main_#t~mem488#1.base, main_#t~mem488#1.offset, main_#t~mem489#1.base, main_#t~mem489#1.offset, main_#t~ret490#1, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1.base, main_#t~ret492#1.offset, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~mem496#1.base, main_#t~mem496#1.offset, main_#t~ret497#1, main_#t~ret498#1, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~nondet502#1, main_~res_sl_init_14~0#1, main_~res_sl_open_11~0#1, main_~res_sl_close_10~0#1, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset, main_~var_sl_change_mtu_12_p1~0#1, main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset, main_~var_sl_ioctl_30_p2~0#1, main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset, main_~res_slip_open_21~0#1, main_~var_group6~0#1.base, main_~var_group6~0#1.offset, main_~var_slip_ioctl_28_p2~0#1, main_~var_slip_ioctl_28_p3~0#1, main_~var_slip_compat_ioctl_29_p2~0#1, main_~var_slip_compat_ioctl_29_p3~0#1, main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset, main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset, main_~var_slip_receive_buf_18_p3~0#1, main_~var_sl_keepalive_34_p0~0#1, main_~var_sl_outfill_33_p0~0#1, main_~ldv_s_sl_netdev_ops_net_device_ops~0#1, main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1, main_~tmp~38#1, main_~tmp___0~20#1, main_~tmp___1~13#1;havoc main_~res_sl_init_14~0#1;havoc main_~res_sl_open_11~0#1;havoc main_~res_sl_close_10~0#1;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;call main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset := #Ultimate.allocOnStack(184);havoc main_~var_sl_change_mtu_12_p1~0#1;call main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset := #Ultimate.allocOnStack(37);havoc main_~var_sl_ioctl_30_p2~0#1;call main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset := #Ultimate.allocOnStack(2516);havoc main_~res_slip_open_21~0#1;havoc main_~var_group6~0#1.base, main_~var_group6~0#1.offset;havoc main_~var_slip_ioctl_28_p2~0#1;havoc main_~var_slip_ioctl_28_p3~0#1;havoc main_~var_slip_compat_ioctl_29_p2~0#1;havoc main_~var_slip_compat_ioctl_29_p3~0#1;havoc main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset;havoc main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset;havoc main_~var_slip_receive_buf_18_p3~0#1;havoc main_~var_sl_keepalive_34_p0~0#1;havoc main_~var_sl_outfill_33_p0~0#1;havoc main_~ldv_s_sl_netdev_ops_net_device_ops~0#1;havoc main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1;havoc main_~tmp~38#1;havoc main_~tmp___0~20#1;havoc main_~tmp___1~13#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,841 INFO L272 TraceCheckUtils]: 2: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} call main_#t~ret478#1.base, main_#t~ret478#1.offset := dev_alloc_skb(1); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:53,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {18878#true} is VALID [2022-02-20 21:36:53,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {18878#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:53,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {18878#true} is VALID [2022-02-20 21:36:53,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {18878#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {18878#true} is VALID [2022-02-20 21:36:53,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,842 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18878#true} {18878#true} #2426#return; {18878#true} is VALID [2022-02-20 21:36:53,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {18878#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {18878#true} is VALID [2022-02-20 21:36:53,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,842 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2436#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret478#1.base, main_#t~ret478#1.offset;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset;main_~ldv_s_sl_netdev_ops_net_device_ops~0#1 := 0;main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume { :end_inline_ldv_initialize } true; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,851 INFO L272 TraceCheckUtils]: 14: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} call ldv_handler_precall(); {18878#true} is VALID [2022-02-20 21:36:53,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,852 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2438#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet429#1, slip_init_#t~nondet430#1, slip_init_#t~nondet431#1, slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset, slip_init_#t~nondet433#1, slip_init_#t~ret434#1, slip_init_#t~nondet435#1, slip_init_~status~0#1, slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !(~slip_maxdev~0 <= 3); {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} havoc slip_init_#t~nondet429#1;havoc slip_init_#t~nondet430#1;havoc slip_init_#t~nondet431#1;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 8 * ~slip_maxdev~0, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,853 INFO L272 TraceCheckUtils]: 20: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} call kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:53,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {18878#true} is VALID [2022-02-20 21:36:53,854 INFO L272 TraceCheckUtils]: 22: Hoare triple {18878#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:53,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {18878#true} is VALID [2022-02-20 21:36:53,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {18878#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {18878#true} is VALID [2022-02-20 21:36:53,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,854 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18878#true} {18878#true} #2424#return; {18878#true} is VALID [2022-02-20 21:36:53,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {18878#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {18878#true} is VALID [2022-02-20 21:36:53,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {18878#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {18878#true} is VALID [2022-02-20 21:36:53,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,855 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2440#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset := kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset := slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;havoc slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !(0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616);assume { :begin_inline_tty_register_ldisc } true;tty_register_ldisc_#in~arg0#1, tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset := 1, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset;havoc tty_register_ldisc_#res#1;havoc tty_register_ldisc_#t~nondet532#1, tty_register_ldisc_~arg0#1, tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset;tty_register_ldisc_~arg0#1 := tty_register_ldisc_#in~arg0#1;tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset := tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset;assume -2147483648 <= tty_register_ldisc_#t~nondet532#1 && tty_register_ldisc_#t~nondet532#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet532#1;havoc tty_register_ldisc_#t~nondet532#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} slip_init_#t~ret434#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= slip_init_#t~ret434#1 && slip_init_#t~ret434#1 <= 2147483647;slip_init_~status~0#1 := slip_init_#t~ret434#1;havoc slip_init_#t~ret434#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !(0 != slip_init_~status~0#1); {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} slip_init_#res#1 := slip_init_~status~0#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} main_#t~ret479#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret479#1 && main_#t~ret479#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret479#1;havoc main_#t~ret479#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !(0 != main_~tmp~38#1); {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume -2147483648 <= main_#t~nondet502#1 && main_#t~nondet502#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume (0 != main_~tmp___1~13#1 || 0 != main_~ldv_s_sl_netdev_ops_net_device_ops~0#1) || 0 != main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume -2147483648 <= main_#t~nondet480#1 && main_#t~nondet480#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet480#1;havoc main_#t~nondet480#1;main_#t~switch481#1 := 0 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 1 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 2 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 3 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 4 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 5 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 6 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 7 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 8 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 9 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume main_#t~switch481#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume 0 == main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,862 INFO L272 TraceCheckUtils]: 53: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} call ldv_handler_precall(); {18878#true} is VALID [2022-02-20 21:36:53,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,862 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18878#true} {18880#(<= 256 ~slip_maxdev~0)} #2560#return; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume { :begin_inline_ldv_slip_open_3 } true;ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset := main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset;havoc ldv_slip_open_3_#res#1;havoc ldv_slip_open_3_#t~ret507#1, ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset, ldv_slip_open_3_~ldv_func_res~2#1, ldv_slip_open_3_~tmp~41#1;ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset := ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset;havoc ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret302#1, slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset, slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset, slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset, slip_open_#t~mem306#1, slip_open_#t~short307#1, slip_open_#t~ret308#1, slip_open_#t~ret309#1.base, slip_open_#t~ret309#1.offset, slip_open_#t~ret310#1, slip_open_#t~ret311#1.base, slip_open_#t~ret311#1.offset, slip_open_#t~mem312#1, slip_open_#t~ret313#1, slip_open_#t~ret314#1, slip_open_#t~mem315#1.base, slip_open_#t~mem315#1.offset, slip_open_#t~ret316#1, slip_open_#t~mem317#1, slip_open_#t~mem318#1, slip_open_#t~mem319#1, slip_open_#t~mem320#1, slip_open_~tty#1.base, slip_open_~tty#1.offset, slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset, slip_open_~err~2#1, slip_open_~tmp~26#1, slip_open_~tmp___0~10#1, slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset, slip_open_~tmp___2~3#1;slip_open_~tty#1.base, slip_open_~tty#1.offset := slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset;havoc slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset;havoc slip_open_~err~2#1;havoc slip_open_~tmp~26#1;havoc slip_open_~tmp___0~10#1;havoc slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset;havoc slip_open_~tmp___2~3#1;assume { :begin_inline_capable } true;capable_#in~arg0#1 := 12;havoc capable_#res#1;havoc capable_#t~nondet510#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet510#1 && capable_#t~nondet510#1 <= 2147483647;capable_#res#1 := capable_#t~nondet510#1;havoc capable_#t~nondet510#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} slip_open_#t~ret302#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret302#1 && slip_open_#t~ret302#1 <= 2147483647;slip_open_~tmp~26#1 := slip_open_#t~ret302#1;havoc slip_open_#t~ret302#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !(0 == slip_open_~tmp~26#1);call slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset := read~$Pointer$(slip_open_~tty#1.base, 24 + slip_open_~tty#1.offset, 8);call slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset := read~$Pointer$(slip_open_#t~mem303#1.base, 56 + slip_open_#t~mem303#1.offset, 8); {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !(0 == (slip_open_#t~mem304#1.base + slip_open_#t~mem304#1.offset) % 18446744073709551616);havoc slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset;havoc slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset;assume { :begin_inline_rtnl_lock } true; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:53,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume { :end_inline_rtnl_lock } true;assume { :begin_inline_sl_sync } true;havoc sl_sync_#t~mem288#1.base, sl_sync_#t~mem288#1.offset, sl_sync_#t~ret289#1.base, sl_sync_#t~ret289#1.offset, sl_sync_#t~mem290#1.base, sl_sync_#t~mem290#1.offset, sl_sync_#t~mem291#1, sl_sync_#t~short292#1, sl_sync_#t~mem293#1, sl_sync_#t~ret294#1, sl_sync_~i~1#1, sl_sync_~dev~2#1.base, sl_sync_~dev~2#1.offset, sl_sync_~sl~10#1.base, sl_sync_~sl~10#1.offset, sl_sync_~tmp~24#1.base, sl_sync_~tmp~24#1.offset;havoc sl_sync_~i~1#1;havoc sl_sync_~dev~2#1.base, sl_sync_~dev~2#1.offset;havoc sl_sync_~sl~10#1.base, sl_sync_~sl~10#1.offset;havoc sl_sync_~tmp~24#1.base, sl_sync_~tmp~24#1.offset;sl_sync_~i~1#1 := 0; {18904#(and (= |ULTIMATE.start_sl_sync_~i~1#1| 0) (<= 256 ~slip_maxdev~0))} is VALID [2022-02-20 21:36:53,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {18904#(and (= |ULTIMATE.start_sl_sync_~i~1#1| 0) (<= 256 ~slip_maxdev~0))} assume !(sl_sync_~i~1#1 < ~slip_maxdev~0); {18879#false} is VALID [2022-02-20 21:36:53,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {18879#false} assume { :end_inline_sl_sync } true;call slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset := read~$Pointer$(slip_open_~tty#1.base, 1095 + slip_open_~tty#1.offset, 8);slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset := slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset;havoc slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset;slip_open_~err~2#1 := -17;slip_open_#t~short307#1 := 0 != (slip_open_~sl~12#1.base + slip_open_~sl~12#1.offset) % 18446744073709551616; {18879#false} is VALID [2022-02-20 21:36:53,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {18879#false} assume slip_open_#t~short307#1;call slip_open_#t~mem306#1 := read~int(slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset, 4);slip_open_#t~short307#1 := 21250 == slip_open_#t~mem306#1; {18879#false} is VALID [2022-02-20 21:36:53,865 INFO L290 TraceCheckUtils]: 64: Hoare triple {18879#false} assume slip_open_#t~short307#1;havoc slip_open_#t~mem306#1;havoc slip_open_#t~short307#1; {18879#false} is VALID [2022-02-20 21:36:53,865 INFO L272 TraceCheckUtils]: 65: Hoare triple {18879#false} call rtnl_unlock(); {18878#true} is VALID [2022-02-20 21:36:53,865 INFO L290 TraceCheckUtils]: 66: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:53,865 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {18878#true} {18879#false} #2622#return; {18879#false} is VALID [2022-02-20 21:36:53,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {18879#false} slip_open_#res#1 := slip_open_~err~2#1; {18879#false} is VALID [2022-02-20 21:36:53,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {18879#false} ldv_slip_open_3_#t~ret507#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret507#1 && ldv_slip_open_3_#t~ret507#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret507#1;havoc ldv_slip_open_3_#t~ret507#1;ldv_slip_open_3_~ldv_func_res~2#1 := ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_check_callback_ret_val_~ret_val#1;ldv_check_callback_ret_val_~ret_val#1 := ldv_check_callback_ret_val_#in~ret_val#1; {18879#false} is VALID [2022-02-20 21:36:53,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {18879#false} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0);assume { :begin_inline_ldv_error } true; {18879#false} is VALID [2022-02-20 21:36:53,865 INFO L290 TraceCheckUtils]: 71: Hoare triple {18879#false} assume !false; {18879#false} is VALID [2022-02-20 21:36:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 21:36:53,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:53,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066174626] [2022-02-20 21:36:53,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066174626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:53,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:53,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:36:53,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298190887] [2022-02-20 21:36:53,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2022-02-20 21:36:53,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:53,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 21:36:53,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:36:53,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:36:53,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:53,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:36:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:36:53,921 INFO L87 Difference]: Start difference. First operand 931 states and 1372 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 21:37:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:37:05,246 INFO L93 Difference]: Finished difference Result 2375 states and 3581 transitions. [2022-02-20 21:37:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:37:05,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2022-02-20 21:37:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:37:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 21:37:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3575 transitions. [2022-02-20 21:37:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 21:37:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3575 transitions. [2022-02-20 21:37:05,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3575 transitions. [2022-02-20 21:37:07,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3575 edges. 3575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:37:08,082 INFO L225 Difference]: With dead ends: 2375 [2022-02-20 21:37:08,082 INFO L226 Difference]: Without dead ends: 1463 [2022-02-20 21:37:08,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:37:08,085 INFO L933 BasicCegarLoop]: 1808 mSDtfsCounter, 2197 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:37:08,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2472 Valid, 3388 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 21:37:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-02-20 21:37:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 932. [2022-02-20 21:37:08,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:37:08,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1463 states. Second operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:37:08,342 INFO L74 IsIncluded]: Start isIncluded. First operand 1463 states. Second operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:37:08,343 INFO L87 Difference]: Start difference. First operand 1463 states. Second operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:37:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:37:08,408 INFO L93 Difference]: Finished difference Result 1463 states and 2232 transitions. [2022-02-20 21:37:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2232 transitions. [2022-02-20 21:37:08,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:37:08,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:37:08,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 1463 states. [2022-02-20 21:37:08,413 INFO L87 Difference]: Start difference. First operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) Second operand 1463 states. [2022-02-20 21:37:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:37:08,479 INFO L93 Difference]: Finished difference Result 1463 states and 2232 transitions. [2022-02-20 21:37:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2232 transitions. [2022-02-20 21:37:08,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:37:08,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:37:08,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:37:08,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:37:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-02-20 21:37:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1373 transitions. [2022-02-20 21:37:08,525 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1373 transitions. Word has length 72 [2022-02-20 21:37:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:37:08,525 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1373 transitions. [2022-02-20 21:37:08,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 21:37:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1373 transitions. [2022-02-20 21:37:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 21:37:08,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:37:08,527 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:37:08,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:37:08,527 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:37:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:37:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash -45216834, now seen corresponding path program 1 times [2022-02-20 21:37:08,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:37:08,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644090946] [2022-02-20 21:37:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:37:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:37:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:37:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:37:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {26398#true} is VALID [2022-02-20 21:37:08,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {26398#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {26398#true} is VALID [2022-02-20 21:37:08,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26398#true} {26398#true} #2426#return; {26398#true} is VALID [2022-02-20 21:37:08,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {26398#true} is VALID [2022-02-20 21:37:08,608 INFO L272 TraceCheckUtils]: 1: Hoare triple {26398#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:08,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {26398#true} is VALID [2022-02-20 21:37:08,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {26398#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {26398#true} is VALID [2022-02-20 21:37:08,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,609 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {26398#true} {26398#true} #2426#return; {26398#true} is VALID [2022-02-20 21:37:08,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {26398#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {26398#true} is VALID [2022-02-20 21:37:08,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,609 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {26398#true} {26398#true} #2436#return; {26398#true} is VALID [2022-02-20 21:37:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:37:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,612 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {26398#true} {26398#true} #2438#return; {26398#true} is VALID [2022-02-20 21:37:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:37:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:37:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {26398#true} is VALID [2022-02-20 21:37:08,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {26398#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {26398#true} is VALID [2022-02-20 21:37:08,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26398#true} {26398#true} #2424#return; {26398#true} is VALID [2022-02-20 21:37:08,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {26398#true} is VALID [2022-02-20 21:37:08,628 INFO L272 TraceCheckUtils]: 1: Hoare triple {26398#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:08,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {26398#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {26398#true} {26398#true} #2424#return; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {26398#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {26398#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26398#true} {26398#true} #2440#return; {26398#true} is VALID [2022-02-20 21:37:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:37:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,636 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {26398#true} {26398#true} #2560#return; {26398#true} is VALID [2022-02-20 21:37:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:37:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:08,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,643 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {26398#true} {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} #2622#return; {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} is VALID [2022-02-20 21:37:08,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {26398#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(42, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(64, 4);call #Ultimate.allocInit(59, 5);call #Ultimate.allocInit(34, 6);call #Ultimate.allocInit(37, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(46, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(37, 13);call #Ultimate.allocInit(5, 14);call write~init~int(115, 14, 0, 1);call write~init~int(108, 14, 1, 1);call write~init~int(37, 14, 2, 1);call write~init~int(100, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(20, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(19, 17);call #Ultimate.allocInit(5, 18);call write~init~int(115, 18, 0, 1);call write~init~int(108, 18, 1, 1);call write~init~int(105, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(79, 19);call #Ultimate.allocInit(22, 20);call #Ultimate.allocInit(72, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(37, 25);call #Ultimate.allocInit(54, 26);call #Ultimate.allocInit(62, 27);~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 28, 0;call #Ultimate.allocInit(280, 28);call write~init~$Pointer$(#funAddr~sl_init.base, #funAddr~sl_init.offset, ~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_uninit.base, #funAddr~sl_uninit.offset, ~#sl_netdev_ops~0.base, 8 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_open.base, #funAddr~sl_open.offset, ~#sl_netdev_ops~0.base, 16 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_close.base, #funAddr~sl_close.offset, ~#sl_netdev_ops~0.base, 24 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_xmit.base, #funAddr~sl_xmit.offset, ~#sl_netdev_ops~0.base, 32 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 40 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 48 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 56 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 64 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 72 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 80 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_ioctl.base, #funAddr~sl_ioctl.offset, ~#sl_netdev_ops~0.base, 88 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 96 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_change_mtu.base, #funAddr~sl_change_mtu.offset, ~#sl_netdev_ops~0.base, 104 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 112 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_tx_timeout.base, #funAddr~sl_tx_timeout.offset, ~#sl_netdev_ops~0.base, 120 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sl_get_stats64.base, #funAddr~sl_get_stats64.offset, ~#sl_netdev_ops~0.base, 128 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 136 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 144 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 152 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 160 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 168 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 176 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 184 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 192 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 200 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 208 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 216 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 224 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 232 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 240 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 248 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 256 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 264 + ~#sl_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_netdev_ops~0.base, 272 + ~#sl_netdev_ops~0.offset, 8);~#sl_ldisc~0.base, ~#sl_ldisc~0.offset := 29, 0;call #Ultimate.allocInit(144, 29);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(18, 0, ~#sl_ldisc~0.base, 4 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 12 + ~#sl_ldisc~0.offset, 4);call write~init~int(0, ~#sl_ldisc~0.base, 16 + ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~slip_open.base, #funAddr~slip_open.offset, ~#sl_ldisc~0.base, 20 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_close.base, #funAddr~slip_close.offset, ~#sl_ldisc~0.base, 28 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 36 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 44 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 52 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 60 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_ioctl.base, #funAddr~slip_ioctl.offset, ~#sl_ldisc~0.base, 68 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_compat_ioctl.base, #funAddr~slip_compat_ioctl.offset, ~#sl_ldisc~0.base, 76 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 84 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 92 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_hangup.base, #funAddr~slip_hangup.offset, ~#sl_ldisc~0.base, 100 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_receive_buf.base, #funAddr~slip_receive_buf.offset, ~#sl_ldisc~0.base, 108 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~slip_write_wakeup.base, #funAddr~slip_write_wakeup.offset, ~#sl_ldisc~0.base, 116 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#sl_ldisc~0.base, 124 + ~#sl_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#sl_ldisc~0.base, 132 + ~#sl_ldisc~0.offset, 8);call write~init~int(0, ~#sl_ldisc~0.base, 140 + ~#sl_ldisc~0.offset, 4);~LDV_IN_INTERRUPT~0 := 0; {26398#true} is VALID [2022-02-20 21:37:08,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {26398#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset, main_#t~ret479#1, main_#t~nondet480#1, main_#t~switch481#1, main_#t~mem482#1.base, main_#t~mem482#1.offset, main_#t~ret483#1, main_#t~mem484#1.base, main_#t~mem484#1.offset, main_#t~ret485#1, main_#t~mem486#1.base, main_#t~mem486#1.offset, main_#t~ret487#1, main_#t~mem488#1.base, main_#t~mem488#1.offset, main_#t~mem489#1.base, main_#t~mem489#1.offset, main_#t~ret490#1, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1.base, main_#t~ret492#1.offset, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~mem496#1.base, main_#t~mem496#1.offset, main_#t~ret497#1, main_#t~ret498#1, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~nondet502#1, main_~res_sl_init_14~0#1, main_~res_sl_open_11~0#1, main_~res_sl_close_10~0#1, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset, main_~var_sl_change_mtu_12_p1~0#1, main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset, main_~var_sl_ioctl_30_p2~0#1, main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset, main_~res_slip_open_21~0#1, main_~var_group6~0#1.base, main_~var_group6~0#1.offset, main_~var_slip_ioctl_28_p2~0#1, main_~var_slip_ioctl_28_p3~0#1, main_~var_slip_compat_ioctl_29_p2~0#1, main_~var_slip_compat_ioctl_29_p3~0#1, main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset, main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset, main_~var_slip_receive_buf_18_p3~0#1, main_~var_sl_keepalive_34_p0~0#1, main_~var_sl_outfill_33_p0~0#1, main_~ldv_s_sl_netdev_ops_net_device_ops~0#1, main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1, main_~tmp~38#1, main_~tmp___0~20#1, main_~tmp___1~13#1;havoc main_~res_sl_init_14~0#1;havoc main_~res_sl_open_11~0#1;havoc main_~res_sl_close_10~0#1;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;call main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset := #Ultimate.allocOnStack(184);havoc main_~var_sl_change_mtu_12_p1~0#1;call main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset := #Ultimate.allocOnStack(37);havoc main_~var_sl_ioctl_30_p2~0#1;call main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset := #Ultimate.allocOnStack(2516);havoc main_~res_slip_open_21~0#1;havoc main_~var_group6~0#1.base, main_~var_group6~0#1.offset;havoc main_~var_slip_ioctl_28_p2~0#1;havoc main_~var_slip_ioctl_28_p3~0#1;havoc main_~var_slip_compat_ioctl_29_p2~0#1;havoc main_~var_slip_compat_ioctl_29_p3~0#1;havoc main_~var_slip_receive_buf_18_p1~0#1.base, main_~var_slip_receive_buf_18_p1~0#1.offset;havoc main_~var_slip_receive_buf_18_p2~0#1.base, main_~var_slip_receive_buf_18_p2~0#1.offset;havoc main_~var_slip_receive_buf_18_p3~0#1;havoc main_~var_sl_keepalive_34_p0~0#1;havoc main_~var_sl_outfill_33_p0~0#1;havoc main_~ldv_s_sl_netdev_ops_net_device_ops~0#1;havoc main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1;havoc main_~tmp~38#1;havoc main_~tmp___0~20#1;havoc main_~tmp___1~13#1; {26398#true} is VALID [2022-02-20 21:37:08,644 INFO L272 TraceCheckUtils]: 2: Hoare triple {26398#true} call main_#t~ret478#1.base, main_#t~ret478#1.offset := dev_alloc_skb(1); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:08,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {26398#true} call #t~ret513.base, #t~ret513.offset := ldv_malloc(243); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:08,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {26398#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {26398#true} {26398#true} #2426#return; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {26398#true} #res.base, #res.offset := #t~ret513.base, #t~ret513.offset;havoc #t~ret513.base, #t~ret513.offset; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {26398#true} {26398#true} #2436#return; {26398#true} is VALID [2022-02-20 21:37:08,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {26398#true} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret478#1.base, main_#t~ret478#1.offset;havoc main_#t~ret478#1.base, main_#t~ret478#1.offset;main_~ldv_s_sl_netdev_ops_net_device_ops~0#1 := 0;main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {26398#true} is VALID [2022-02-20 21:37:08,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {26398#true} assume { :end_inline_ldv_initialize } true; {26398#true} is VALID [2022-02-20 21:37:08,646 INFO L272 TraceCheckUtils]: 14: Hoare triple {26398#true} call ldv_handler_precall(); {26398#true} is VALID [2022-02-20 21:37:08,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,646 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26398#true} {26398#true} #2438#return; {26398#true} is VALID [2022-02-20 21:37:08,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {26398#true} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet429#1, slip_init_#t~nondet430#1, slip_init_#t~nondet431#1, slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset, slip_init_#t~nondet433#1, slip_init_#t~ret434#1, slip_init_#t~nondet435#1, slip_init_~status~0#1, slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {26398#true} assume !(~slip_maxdev~0 <= 3); {26398#true} is VALID [2022-02-20 21:37:08,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {26398#true} havoc slip_init_#t~nondet429#1;havoc slip_init_#t~nondet430#1;havoc slip_init_#t~nondet431#1;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 8 * ~slip_maxdev~0, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,647 INFO L272 TraceCheckUtils]: 20: Hoare triple {26398#true} call kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:08,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {26398#true} is VALID [2022-02-20 21:37:08,647 INFO L272 TraceCheckUtils]: 22: Hoare triple {26398#true} call __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset := ldv_malloc(__kmalloc_~size#1); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:08,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet42#1 && #t~nondet42#1 <= 2147483647; {26398#true} is VALID [2022-02-20 21:37:08,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {26398#true} assume !(0 != #t~nondet42#1);havoc #t~nondet42#1;#res#1.base, #res#1.offset := 0, 0; {26398#true} is VALID [2022-02-20 21:37:08,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,648 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26398#true} {26398#true} #2424#return; {26398#true} is VALID [2022-02-20 21:37:08,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {26398#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset;havoc __kmalloc_#t~ret45#1.base, __kmalloc_#t~ret45#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {26398#true} #t~ret46#1.base, #t~ret46#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret46#1.base, #t~ret46#1.offset;havoc #t~ret46#1.base, #t~ret46#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,648 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {26398#true} {26398#true} #2440#return; {26398#true} is VALID [2022-02-20 21:37:08,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {26398#true} kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset := kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;havoc kzalloc_#t~ret47#1.base, kzalloc_#t~ret47#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~2#1.base, kzalloc_~tmp~2#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {26398#true} slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset := slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;havoc slip_init_#t~ret432#1.base, slip_init_#t~ret432#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~34#1.base, slip_init_~tmp~34#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {26398#true} assume !(0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616);assume { :begin_inline_tty_register_ldisc } true;tty_register_ldisc_#in~arg0#1, tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset := 1, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset;havoc tty_register_ldisc_#res#1;havoc tty_register_ldisc_#t~nondet532#1, tty_register_ldisc_~arg0#1, tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset;tty_register_ldisc_~arg0#1 := tty_register_ldisc_#in~arg0#1;tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset := tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset;assume -2147483648 <= tty_register_ldisc_#t~nondet532#1 && tty_register_ldisc_#t~nondet532#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet532#1;havoc tty_register_ldisc_#t~nondet532#1; {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {26398#true} slip_init_#t~ret434#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= slip_init_#t~ret434#1 && slip_init_#t~ret434#1 <= 2147483647;slip_init_~status~0#1 := slip_init_#t~ret434#1;havoc slip_init_#t~ret434#1; {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {26398#true} assume !(0 != slip_init_~status~0#1); {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {26398#true} slip_init_#res#1 := slip_init_~status~0#1; {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {26398#true} main_#t~ret479#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret479#1 && main_#t~ret479#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret479#1;havoc main_#t~ret479#1; {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {26398#true} assume !(0 != main_~tmp~38#1); {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {26398#true} assume -2147483648 <= main_#t~nondet502#1 && main_#t~nondet502#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1; {26398#true} is VALID [2022-02-20 21:37:08,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {26398#true} assume (0 != main_~tmp___1~13#1 || 0 != main_~ldv_s_sl_netdev_ops_net_device_ops~0#1) || 0 != main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {26398#true} assume -2147483648 <= main_#t~nondet480#1 && main_#t~nondet480#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet480#1;havoc main_#t~nondet480#1;main_#t~switch481#1 := 0 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 1 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 2 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 3 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 4 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 5 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 6 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 7 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 8 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {26398#true} assume !main_#t~switch481#1;main_#t~switch481#1 := main_#t~switch481#1 || 9 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {26398#true} assume main_#t~switch481#1; {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {26398#true} assume 0 == main_~ldv_s_sl_ldisc_tty_ldisc_ops~0#1; {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L272 TraceCheckUtils]: 53: Hoare triple {26398#true} call ldv_handler_precall(); {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26398#true} {26398#true} #2560#return; {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {26398#true} assume { :begin_inline_ldv_slip_open_3 } true;ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset := main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset;havoc ldv_slip_open_3_#res#1;havoc ldv_slip_open_3_#t~ret507#1, ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset, ldv_slip_open_3_~ldv_func_res~2#1, ldv_slip_open_3_~tmp~41#1;ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset := ldv_slip_open_3_#in~tty#1.base, ldv_slip_open_3_#in~tty#1.offset;havoc ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_3_~tty#1.base, ldv_slip_open_3_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret302#1, slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset, slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset, slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset, slip_open_#t~mem306#1, slip_open_#t~short307#1, slip_open_#t~ret308#1, slip_open_#t~ret309#1.base, slip_open_#t~ret309#1.offset, slip_open_#t~ret310#1, slip_open_#t~ret311#1.base, slip_open_#t~ret311#1.offset, slip_open_#t~mem312#1, slip_open_#t~ret313#1, slip_open_#t~ret314#1, slip_open_#t~mem315#1.base, slip_open_#t~mem315#1.offset, slip_open_#t~ret316#1, slip_open_#t~mem317#1, slip_open_#t~mem318#1, slip_open_#t~mem319#1, slip_open_#t~mem320#1, slip_open_~tty#1.base, slip_open_~tty#1.offset, slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset, slip_open_~err~2#1, slip_open_~tmp~26#1, slip_open_~tmp___0~10#1, slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset, slip_open_~tmp___2~3#1;slip_open_~tty#1.base, slip_open_~tty#1.offset := slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset;havoc slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset;havoc slip_open_~err~2#1;havoc slip_open_~tmp~26#1;havoc slip_open_~tmp___0~10#1;havoc slip_open_~tmp___1~6#1.base, slip_open_~tmp___1~6#1.offset;havoc slip_open_~tmp___2~3#1;assume { :begin_inline_capable } true;capable_#in~arg0#1 := 12;havoc capable_#res#1;havoc capable_#t~nondet510#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet510#1 && capable_#t~nondet510#1 <= 2147483647;capable_#res#1 := capable_#t~nondet510#1;havoc capable_#t~nondet510#1; {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {26398#true} slip_open_#t~ret302#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret302#1 && slip_open_#t~ret302#1 <= 2147483647;slip_open_~tmp~26#1 := slip_open_#t~ret302#1;havoc slip_open_#t~ret302#1; {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {26398#true} assume !(0 == slip_open_~tmp~26#1);call slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset := read~$Pointer$(slip_open_~tty#1.base, 24 + slip_open_~tty#1.offset, 8);call slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset := read~$Pointer$(slip_open_#t~mem303#1.base, 56 + slip_open_#t~mem303#1.offset, 8); {26398#true} is VALID [2022-02-20 21:37:08,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {26398#true} assume !(0 == (slip_open_#t~mem304#1.base + slip_open_#t~mem304#1.offset) % 18446744073709551616);havoc slip_open_#t~mem303#1.base, slip_open_#t~mem303#1.offset;havoc slip_open_#t~mem304#1.base, slip_open_#t~mem304#1.offset;assume { :begin_inline_rtnl_lock } true; {26398#true} is VALID [2022-02-20 21:37:08,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {26398#true} assume { :end_inline_rtnl_lock } true;assume { :begin_inline_sl_sync } true;havoc sl_sync_#t~mem288#1.base, sl_sync_#t~mem288#1.offset, sl_sync_#t~ret289#1.base, sl_sync_#t~ret289#1.offset, sl_sync_#t~mem290#1.base, sl_sync_#t~mem290#1.offset, sl_sync_#t~mem291#1, sl_sync_#t~short292#1, sl_sync_#t~mem293#1, sl_sync_#t~ret294#1, sl_sync_~i~1#1, sl_sync_~dev~2#1.base, sl_sync_~dev~2#1.offset, sl_sync_~sl~10#1.base, sl_sync_~sl~10#1.offset, sl_sync_~tmp~24#1.base, sl_sync_~tmp~24#1.offset;havoc sl_sync_~i~1#1;havoc sl_sync_~dev~2#1.base, sl_sync_~dev~2#1.offset;havoc sl_sync_~sl~10#1.base, sl_sync_~sl~10#1.offset;havoc sl_sync_~tmp~24#1.base, sl_sync_~tmp~24#1.offset;sl_sync_~i~1#1 := 0; {26398#true} is VALID [2022-02-20 21:37:08,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {26398#true} assume sl_sync_~i~1#1 < ~slip_maxdev~0; {26398#true} is VALID [2022-02-20 21:37:08,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {26398#true} call sl_sync_#t~mem288#1.base, sl_sync_#t~mem288#1.offset := read~$Pointer$(~slip_devs~0.base, ~slip_devs~0.offset + 8 * (if sl_sync_~i~1#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then sl_sync_~i~1#1 % 18446744073709551616 % 18446744073709551616 else sl_sync_~i~1#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);sl_sync_~dev~2#1.base, sl_sync_~dev~2#1.offset := sl_sync_#t~mem288#1.base, sl_sync_#t~mem288#1.offset;havoc sl_sync_#t~mem288#1.base, sl_sync_#t~mem288#1.offset; {26398#true} is VALID [2022-02-20 21:37:08,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {26398#true} assume 0 == (sl_sync_~dev~2#1.base + sl_sync_~dev~2#1.offset) % 18446744073709551616; {26398#true} is VALID [2022-02-20 21:37:08,653 INFO L290 TraceCheckUtils]: 64: Hoare triple {26398#true} assume { :end_inline_sl_sync } true;call slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset := read~$Pointer$(slip_open_~tty#1.base, 1095 + slip_open_~tty#1.offset, 8);slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset := slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset;havoc slip_open_#t~mem305#1.base, slip_open_#t~mem305#1.offset;slip_open_~err~2#1 := -17;slip_open_#t~short307#1 := 0 != (slip_open_~sl~12#1.base + slip_open_~sl~12#1.offset) % 18446744073709551616; {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} is VALID [2022-02-20 21:37:08,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} assume slip_open_#t~short307#1;call slip_open_#t~mem306#1 := read~int(slip_open_~sl~12#1.base, slip_open_~sl~12#1.offset, 4);slip_open_#t~short307#1 := 21250 == slip_open_#t~mem306#1; {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} is VALID [2022-02-20 21:37:08,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} assume slip_open_#t~short307#1;havoc slip_open_#t~mem306#1;havoc slip_open_#t~short307#1; {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} is VALID [2022-02-20 21:37:08,653 INFO L272 TraceCheckUtils]: 67: Hoare triple {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} call rtnl_unlock(); {26398#true} is VALID [2022-02-20 21:37:08,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:08,654 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {26398#true} {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} #2622#return; {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} is VALID [2022-02-20 21:37:08,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {26423#(<= (+ |ULTIMATE.start_slip_open_~err~2#1| 17) 0)} slip_open_#res#1 := slip_open_~err~2#1; {26426#(<= (+ |ULTIMATE.start_slip_open_#res#1| 17) 0)} is VALID [2022-02-20 21:37:08,654 INFO L290 TraceCheckUtils]: 71: Hoare triple {26426#(<= (+ |ULTIMATE.start_slip_open_#res#1| 17) 0)} ldv_slip_open_3_#t~ret507#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret507#1 && ldv_slip_open_3_#t~ret507#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret507#1;havoc ldv_slip_open_3_#t~ret507#1;ldv_slip_open_3_~ldv_func_res~2#1 := ldv_slip_open_3_~tmp~41#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_3_~ldv_func_res~2#1;havoc ldv_check_callback_ret_val_~ret_val#1;ldv_check_callback_ret_val_~ret_val#1 := ldv_check_callback_ret_val_#in~ret_val#1; {26427#(<= (+ |ULTIMATE.start_ldv_check_callback_ret_val_~ret_val#1| 17) 0)} is VALID [2022-02-20 21:37:08,655 INFO L290 TraceCheckUtils]: 72: Hoare triple {26427#(<= (+ |ULTIMATE.start_ldv_check_callback_ret_val_~ret_val#1| 17) 0)} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0);assume { :begin_inline_ldv_error } true; {26399#false} is VALID [2022-02-20 21:37:08,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {26399#false} assume !false; {26399#false} is VALID [2022-02-20 21:37:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 21:37:08,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:37:08,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644090946] [2022-02-20 21:37:08,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644090946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:37:08,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:37:08,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:37:08,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606877766] [2022-02-20 21:37:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:37:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2022-02-20 21:37:08,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:37:08,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 21:37:08,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:37:08,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:37:08,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:37:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:37:08,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:37:08,703 INFO L87 Difference]: Start difference. First operand 932 states and 1373 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)