./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-1.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-1.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 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:36:10,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:36:10,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:36:10,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:36:10,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:36:10,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:36:10,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:36:10,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:36:10,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:36:10,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:36:10,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:36:10,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:36:10,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:36:10,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:36:10,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:36:10,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:36:10,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:36:10,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:36:10,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:36:10,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:36:10,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:36:10,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:36:10,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:36:10,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:36:10,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:36:10,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:36:10,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:36:10,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:36:10,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:36:10,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:36:10,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:36:10,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:36:10,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:36:10,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:36:10,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:36:10,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:36:10,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:36:10,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:36:10,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:36:10,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:36:10,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:36:10,542 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,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:36:10,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:36:10,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:36:10,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:36:10,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:36:10,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:36:10,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:36:10,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:36:10,571 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:36:10,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:36:10,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:36:10,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:36:10,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:36:10,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:36:10,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:36:10,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:36:10,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:36:10,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:36:10,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:36:10,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:36:10,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:36:10,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:36:10,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:36:10,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:36:10,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:36:10,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:36:10,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:36:10,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:36:10,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:36:10,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:36:10,577 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 -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2022-02-20 21:36:10,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:36:10,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:36:10,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:36:10,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:36:10,806 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:36:10,807 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-1.i [2022-02-20 21:36:10,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d4ab61c/a4651ad65bdf40b3869ae41de9bf4d06/FLAGcef1f7dbe [2022-02-20 21:36:11,489 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:36:11,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-02-20 21:36:11,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d4ab61c/a4651ad65bdf40b3869ae41de9bf4d06/FLAGcef1f7dbe [2022-02-20 21:36:11,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d4ab61c/a4651ad65bdf40b3869ae41de9bf4d06 [2022-02-20 21:36:11,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:36:11,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:36:11,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:36:11,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:36:11,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:36:11,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:36:11" (1/1) ... [2022-02-20 21:36:11,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfe8046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:36:11, skipping insertion in model container [2022-02-20 21:36:11,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:36:11" (1/1) ... [2022-02-20 21:36:11,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:36:11,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:36:12,974 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-1.i[202861,202874] [2022-02-20 21:36:12,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:36:13,006 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:36:13,259 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-1.i[202861,202874] [2022-02-20 21:36:13,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:36:13,378 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:36:13,379 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,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:36:13,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:36:13,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:36:13,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:36:13,388 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,453 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,605 INFO L137 Inliner]: procedures = 157, calls = 812, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2787 [2022-02-20 21:36:13,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:36:13,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:36:13,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:36:13,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:36:13,613 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,613 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,641 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,642 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,718 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,732 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,746 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,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:36:13,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:36:13,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:36:13,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:36:13,776 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,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:36:13,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:36:13,812 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,830 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,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:36:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-02-20 21:36:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:36:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:36:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:36:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-02-20 21:36:13,852 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-02-20 21:36:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 21:36:13,853 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 21:36:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-02-20 21:36:13,853 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-02-20 21:36:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:36:13,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:36:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-02-20 21:36:13,854 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-02-20 21:36:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:36:13,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:36:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:36:13,855 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:36:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-02-20 21:36:13,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-02-20 21:36:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-02-20 21:36:13,855 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-02-20 21:36:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:36:13,855 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:36:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-02-20 21:36:13,856 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-02-20 21:36:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:36:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-02-20 21:36:13,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-02-20 21:36:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-02-20 21:36:13,856 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-02-20 21:36:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-02-20 21:36:13,857 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-02-20 21:36:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:36:13,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:36:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-02-20 21:36:13,857 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-02-20 21:36:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-02-20 21:36:13,858 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-02-20 21:36:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:36:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-02-20 21:36:13,858 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-02-20 21:36:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-02-20 21:36:13,858 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-02-20 21:36:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:36:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-02-20 21:36:13,859 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-02-20 21:36:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-02-20 21:36:13,859 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-02-20 21:36:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:36:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:36:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 21:36:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-02-20 21:36:13,860 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-02-20 21:36:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:36:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 21:36:13,861 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 21:36:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 21:36:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 21:36:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 21:36:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 21:36:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-02-20 21:36:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-02-20 21:36:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-02-20 21:36:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-02-20 21:36:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:36:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-02-20 21:36:13,864 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-02-20 21:36:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:36:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-02-20 21:36:13,864 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-02-20 21:36:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-02-20 21:36:13,864 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-02-20 21:36:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 21:36:13,865 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 21:36:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:36:13,865 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:36:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 21:36:13,866 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 21:36:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:36:13,866 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:36:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 21:36:13,866 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 21:36:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 21:36:13,867 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 21:36:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 21:36:13,867 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 21:36:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:36:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-02-20 21:36:13,868 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-02-20 21:36:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-02-20 21:36:13,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-02-20 21:36:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-02-20 21:36:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-02-20 21:36:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-02-20 21:36:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-02-20 21:36:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:36:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:36:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:36:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-02-20 21:36:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-02-20 21:36:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-02-20 21:36:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-02-20 21:36:14,380 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:36:14,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:36:17,216 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:36:17,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:36:17,240 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:36:17,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:36:17 BoogieIcfgContainer [2022-02-20 21:36:17,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:36:17,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:36:17,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:36:17,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:36:17,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:36:11" (1/3) ... [2022-02-20 21:36:17,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259d70df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:36:17, skipping insertion in model container [2022-02-20 21:36:17,251 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:17,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259d70df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:36:17, skipping insertion in model container [2022-02-20 21:36:17,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:36:17" (3/3) ... [2022-02-20 21:36:17,255 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-02-20 21:36:17,259 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:36:17,260 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:36:17,312 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:36:17,323 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:17,324 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:36:17,377 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:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 21:36:17,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:17,398 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:17,403 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -579474216, now seen corresponding path program 1 times [2022-02-20 21:36:17,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:17,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772546467] [2022-02-20 21:36:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:17,869 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:17,869 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:17,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #2426#return; {971#true} is VALID [2022-02-20 21:36:17,870 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:17,871 INFO L272 TraceCheckUtils]: 1: Hoare triple {971#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:17,872 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:17,872 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:17,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,872 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {971#true} {971#true} #2426#return; {971#true} is VALID [2022-02-20 21:36:17,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {971#true} is VALID [2022-02-20 21:36:17,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,874 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:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:17,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,888 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:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:17,926 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:17,927 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:17,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #2424#return; {971#true} is VALID [2022-02-20 21:36:17,928 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:17,929 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:17,930 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:17,930 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:17,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,931 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {971#true} {971#true} #2424#return; {971#true} is VALID [2022-02-20 21:36:17,931 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:17,931 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:17,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,932 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {971#true} {972#false} #2440#return; {972#false} is VALID [2022-02-20 21:36:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:36:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:17,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,944 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {971#true} {972#false} #2560#return; {972#false} is VALID [2022-02-20 21:36:17,952 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(44, 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:17,956 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~ret480#1.base, main_#t~ret480#1.offset, main_#t~ret481#1, main_#t~nondet482#1, main_#t~switch483#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~ret489#1, main_#t~mem490#1.base, main_#t~mem490#1.offset, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~ret496#1, main_#t~mem497#1.base, main_#t~mem497#1.offset, main_#t~mem498#1.base, main_#t~mem498#1.offset, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~ret502#1, main_#t~ret503#1, main_#t~nondet504#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:17,957 INFO L272 TraceCheckUtils]: 2: Hoare triple {973#(<= 256 ~slip_maxdev~0)} call main_#t~ret480#1.base, main_#t~ret480#1.offset := dev_alloc_skb(1); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:17,957 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:17,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {997#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:17,958 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:17,958 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:17,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,959 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {971#true} {971#true} #2426#return; {971#true} is VALID [2022-02-20 21:36:17,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {971#true} is VALID [2022-02-20 21:36:17,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,960 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:17,961 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~ret480#1.base, main_#t~ret480#1.offset;havoc main_#t~ret480#1.base, main_#t~ret480#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:17,961 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:17,962 INFO L272 TraceCheckUtils]: 14: Hoare triple {973#(<= 256 ~slip_maxdev~0)} call ldv_handler_precall(); {971#true} is VALID [2022-02-20 21:36:17,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,965 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:17,966 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~nondet431#1, slip_init_#t~nondet432#1, slip_init_#t~nondet433#1, slip_init_#t~ret434#1.base, slip_init_#t~ret434#1.offset, slip_init_#t~nondet435#1, slip_init_#t~ret436#1, slip_init_#t~nondet437#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:17,966 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:17,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {972#false} havoc slip_init_#t~nondet431#1;havoc slip_init_#t~nondet432#1;havoc slip_init_#t~nondet433#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:17,967 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:17,969 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:17,970 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:17,970 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:17,970 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:17,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,970 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {971#true} {971#true} #2424#return; {971#true} is VALID [2022-02-20 21:36:17,970 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:17,971 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:17,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,971 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {971#true} {972#false} #2440#return; {972#false} is VALID [2022-02-20 21:36:17,971 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:17,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {972#false} slip_init_#t~ret434#1.base, slip_init_#t~ret434#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~ret434#1.base, slip_init_#t~ret434#1.offset;havoc slip_init_#t~ret434#1.base, slip_init_#t~ret434#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:17,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {972#false} assume 0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616;havoc slip_init_#t~nondet435#1;slip_init_#res#1 := -12; {972#false} is VALID [2022-02-20 21:36:17,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {972#false} main_#t~ret481#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret481#1 && main_#t~ret481#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret481#1;havoc main_#t~ret481#1; {972#false} is VALID [2022-02-20 21:36:17,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {972#false} assume !(0 != main_~tmp~38#1); {972#false} is VALID [2022-02-20 21:36:17,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {972#false} assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1; {972#false} is VALID [2022-02-20 21:36:17,973 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:17,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {972#false} assume -2147483648 <= main_#t~nondet482#1 && main_#t~nondet482#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet482#1;havoc main_#t~nondet482#1;main_#t~switch483#1 := 0 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 1 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 2 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 3 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 4 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 5 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 6 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 7 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 8 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {972#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 9 == main_~tmp___0~20#1; {972#false} is VALID [2022-02-20 21:36:17,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {972#false} assume main_#t~switch483#1; {972#false} is VALID [2022-02-20 21:36:17,976 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:17,976 INFO L272 TraceCheckUtils]: 50: Hoare triple {972#false} call ldv_handler_precall(); {971#true} is VALID [2022-02-20 21:36:17,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {971#true} assume true; {971#true} is VALID [2022-02-20 21:36:17,977 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {971#true} {972#false} #2560#return; {972#false} is VALID [2022-02-20 21:36:17,977 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~ret509#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_#t~mem321#1.base, slip_open_#t~mem321#1.offset, slip_open_#t~mem322#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~nondet512#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet512#1 && capable_#t~nondet512#1 <= 2147483647;capable_#res#1 := capable_#t~nondet512#1;havoc capable_#t~nondet512#1; {972#false} is VALID [2022-02-20 21:36:17,978 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:17,978 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:17,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {972#false} ldv_slip_open_3_#t~ret509#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret509#1 && ldv_slip_open_3_#t~ret509#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret509#1;havoc ldv_slip_open_3_#t~ret509#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:17,979 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:17,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-02-20 21:36:17,980 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:17,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:17,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772546467] [2022-02-20 21:36:17,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772546467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:17,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:17,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:36:17,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613097786] [2022-02-20 21:36:17,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:17,988 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:17,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:17,992 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:18,060 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:18,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:36:18,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:36:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:36:18,086 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:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:22,895 INFO L93 Difference]: Finished difference Result 1950 states and 2923 transitions. [2022-02-20 21:36:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:36:22,896 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:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:36:22,898 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,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2923 transitions. [2022-02-20 21:36:23,013 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,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2923 transitions. [2022-02-20 21:36:23,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 2923 transitions. [2022-02-20 21:36:25,390 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,549 INFO L225 Difference]: With dead ends: 1950 [2022-02-20 21:36:25,550 INFO L226 Difference]: Without dead ends: 947 [2022-02-20 21:36:25,560 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,563 INFO L933 BasicCegarLoop]: 1371 mSDtfsCounter, 1580 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 1982 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,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1715 Valid, 1982 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:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-02-20 21:36:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-02-20 21:36:25,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:36:25,864 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:25,868 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:25,877 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:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:25,951 INFO L93 Difference]: Finished difference Result 947 states and 1402 transitions. [2022-02-20 21:36:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1402 transitions. [2022-02-20 21:36:25,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:25,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:25,966 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:25,969 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,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:26,025 INFO L93 Difference]: Finished difference Result 947 states and 1402 transitions. [2022-02-20 21:36:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1402 transitions. [2022-02-20 21:36:26,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:26,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:26,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:36:26,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:36:26,032 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,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1371 transitions. [2022-02-20 21:36:26,100 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1371 transitions. Word has length 59 [2022-02-20 21:36:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:36:26,101 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1371 transitions. [2022-02-20 21:36:26,101 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,101 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1371 transitions. [2022-02-20 21:36:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 21:36:26,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:26,104 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,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:36:26,104 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:26,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash -155827494, now seen corresponding path program 1 times [2022-02-20 21:36:26,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:26,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511679251] [2022-02-20 21:36:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:26,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,222 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,223 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,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6867#true} {6867#true} #2426#return; {6867#true} is VALID [2022-02-20 21:36:26,223 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,225 INFO L272 TraceCheckUtils]: 1: Hoare triple {6867#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,225 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,225 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,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,226 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6867#true} {6867#true} #2426#return; {6867#true} is VALID [2022-02-20 21:36:26,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {6867#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {6867#true} is VALID [2022-02-20 21:36:26,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,228 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6867#true} {6867#true} #2436#return; {6867#true} is VALID [2022-02-20 21:36:26,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,235 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {6867#true} {6867#true} #2438#return; {6867#true} is VALID [2022-02-20 21:36:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,261 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,262 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,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6867#true} {6867#true} #2424#return; {6867#true} is VALID [2022-02-20 21:36:26,262 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,263 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,265 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,265 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,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,266 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6867#true} {6867#true} #2424#return; {6867#true} is VALID [2022-02-20 21:36:26,267 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,274 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,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,275 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6867#true} {6867#true} #2440#return; {6867#true} is VALID [2022-02-20 21:36:26,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:36:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:26,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,283 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {6867#true} {6868#false} #2560#return; {6868#false} is VALID [2022-02-20 21:36:26,283 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(44, 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,284 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~ret480#1.base, main_#t~ret480#1.offset, main_#t~ret481#1, main_#t~nondet482#1, main_#t~switch483#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~ret489#1, main_#t~mem490#1.base, main_#t~mem490#1.offset, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~ret496#1, main_#t~mem497#1.base, main_#t~mem497#1.offset, main_#t~mem498#1.base, main_#t~mem498#1.offset, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~ret502#1, main_#t~ret503#1, main_#t~nondet504#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,284 INFO L272 TraceCheckUtils]: 2: Hoare triple {6867#true} call main_#t~ret480#1.base, main_#t~ret480#1.offset := dev_alloc_skb(1); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,284 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,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {6867#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {6894#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:26,285 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,285 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,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,286 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6867#true} {6867#true} #2426#return; {6867#true} is VALID [2022-02-20 21:36:26,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {6867#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {6867#true} is VALID [2022-02-20 21:36:26,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,286 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6867#true} {6867#true} #2436#return; {6867#true} is VALID [2022-02-20 21:36:26,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {6867#true} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret480#1.base, main_#t~ret480#1.offset;havoc main_#t~ret480#1.base, main_#t~ret480#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,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {6867#true} assume { :end_inline_ldv_initialize } true; {6867#true} is VALID [2022-02-20 21:36:26,287 INFO L272 TraceCheckUtils]: 14: Hoare triple {6867#true} call ldv_handler_precall(); {6867#true} is VALID [2022-02-20 21:36:26,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,287 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6867#true} {6867#true} #2438#return; {6867#true} is VALID [2022-02-20 21:36:26,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {6867#true} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet431#1, slip_init_#t~nondet432#1, slip_init_#t~nondet433#1, slip_init_#t~ret434#1.base, slip_init_#t~ret434#1.offset, slip_init_#t~nondet435#1, slip_init_#t~ret436#1, slip_init_#t~nondet437#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,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {6867#true} assume !(~slip_maxdev~0 <= 3); {6867#true} is VALID [2022-02-20 21:36:26,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {6867#true} havoc slip_init_#t~nondet431#1;havoc slip_init_#t~nondet432#1;havoc slip_init_#t~nondet433#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,289 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,289 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,292 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,292 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,292 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,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,293 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6867#true} {6867#true} #2424#return; {6867#true} is VALID [2022-02-20 21:36:26,293 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,294 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,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,295 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6867#true} {6867#true} #2440#return; {6867#true} is VALID [2022-02-20 21:36:26,295 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,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {6867#true} slip_init_#t~ret434#1.base, slip_init_#t~ret434#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~ret434#1.base, slip_init_#t~ret434#1.offset;havoc slip_init_#t~ret434#1.base, slip_init_#t~ret434#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,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {6867#true} assume 0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616;havoc slip_init_#t~nondet435#1;slip_init_#res#1 := -12; {6890#(<= (+ |ULTIMATE.start_slip_init_#res#1| 12) 0)} is VALID [2022-02-20 21:36:26,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {6890#(<= (+ |ULTIMATE.start_slip_init_#res#1| 12) 0)} main_#t~ret481#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret481#1 && main_#t~ret481#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret481#1;havoc main_#t~ret481#1; {6891#(<= (+ |ULTIMATE.start_main_~tmp~38#1| 12) 0)} is VALID [2022-02-20 21:36:26,297 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,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {6868#false} assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1; {6868#false} is VALID [2022-02-20 21:36:26,297 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,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {6868#false} assume -2147483648 <= main_#t~nondet482#1 && main_#t~nondet482#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet482#1;havoc main_#t~nondet482#1;main_#t~switch483#1 := 0 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 1 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 2 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 3 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 4 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 5 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 6 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 7 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 8 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {6868#false} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 9 == main_~tmp___0~20#1; {6868#false} is VALID [2022-02-20 21:36:26,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {6868#false} assume main_#t~switch483#1; {6868#false} is VALID [2022-02-20 21:36:26,299 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,300 INFO L272 TraceCheckUtils]: 50: Hoare triple {6868#false} call ldv_handler_precall(); {6867#true} is VALID [2022-02-20 21:36:26,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {6867#true} assume true; {6867#true} is VALID [2022-02-20 21:36:26,300 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6867#true} {6868#false} #2560#return; {6868#false} is VALID [2022-02-20 21:36:26,300 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~ret509#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_#t~mem321#1.base, slip_open_#t~mem321#1.offset, slip_open_#t~mem322#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~nondet512#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet512#1 && capable_#t~nondet512#1 <= 2147483647;capable_#res#1 := capable_#t~nondet512#1;havoc capable_#t~nondet512#1; {6868#false} is VALID [2022-02-20 21:36:26,300 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,301 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,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {6868#false} ldv_slip_open_3_#t~ret509#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret509#1 && ldv_slip_open_3_#t~ret509#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret509#1;havoc ldv_slip_open_3_#t~ret509#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,301 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,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {6868#false} assume !false; {6868#false} is VALID [2022-02-20 21:36:26,303 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,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:26,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511679251] [2022-02-20 21:36:26,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511679251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:26,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:26,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:36:26,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141320304] [2022-02-20 21:36:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:26,305 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,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:26,306 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,352 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,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:36:26,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:36:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:36:26,353 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:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:34,783 INFO L93 Difference]: Finished difference Result 1859 states and 2750 transitions. [2022-02-20 21:36:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:36:34,783 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:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:36:34,784 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:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2750 transitions. [2022-02-20 21:36:34,846 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:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2750 transitions. [2022-02-20 21:36:34,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 2750 transitions. [2022-02-20 21:36:37,115 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,196 INFO L225 Difference]: With dead ends: 1859 [2022-02-20 21:36:37,196 INFO L226 Difference]: Without dead ends: 947 [2022-02-20 21:36:37,201 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,203 INFO L933 BasicCegarLoop]: 1317 mSDtfsCounter, 372 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:36:37,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 3507 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 21:36:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-02-20 21:36:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-02-20 21:36:37,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:36:37,410 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,412 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,414 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,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:37,464 INFO L93 Difference]: Finished difference Result 947 states and 1401 transitions. [2022-02-20 21:36:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1401 transitions. [2022-02-20 21:36:37,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:37,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:37,470 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,473 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,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:37,524 INFO L93 Difference]: Finished difference Result 947 states and 1401 transitions. [2022-02-20 21:36:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1401 transitions. [2022-02-20 21:36:37,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:37,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:37,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:36:37,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:36:37,532 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,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1370 transitions. [2022-02-20 21:36:37,595 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1370 transitions. Word has length 59 [2022-02-20 21:36:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:36:37,597 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1370 transitions. [2022-02-20 21:36:37,597 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,597 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1370 transitions. [2022-02-20 21:36:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 21:36:37,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:37,599 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,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:36:37,600 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:37,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1779924711, now seen corresponding path program 1 times [2022-02-20 21:36:37,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:37,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125193338] [2022-02-20 21:36:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,741 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,741 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,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12622#true} {12622#true} #2426#return; {12622#true} is VALID [2022-02-20 21:36:37,742 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,742 INFO L272 TraceCheckUtils]: 1: Hoare triple {12622#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,743 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,743 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,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,743 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12622#true} {12622#true} #2426#return; {12622#true} is VALID [2022-02-20 21:36:37,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {12622#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {12622#true} is VALID [2022-02-20 21:36:37,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,744 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12622#true} {12622#true} #2436#return; {12622#true} is VALID [2022-02-20 21:36:37,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,753 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {12622#true} {12622#true} #2438#return; {12622#true} is VALID [2022-02-20 21:36:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,766 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,766 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,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12622#true} {12622#true} #2424#return; {12622#true} is VALID [2022-02-20 21:36:37,770 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,771 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,771 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,771 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,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,771 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12622#true} {12622#true} #2424#return; {12622#true} is VALID [2022-02-20 21:36:37,772 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,772 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,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,772 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12622#true} {12622#true} #2440#return; {12622#true} is VALID [2022-02-20 21:36:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:36:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:37,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,777 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {12622#true} {12622#true} #2560#return; {12622#true} is VALID [2022-02-20 21:36:37,777 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(44, 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,777 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~ret480#1.base, main_#t~ret480#1.offset, main_#t~ret481#1, main_#t~nondet482#1, main_#t~switch483#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~ret489#1, main_#t~mem490#1.base, main_#t~mem490#1.offset, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~ret496#1, main_#t~mem497#1.base, main_#t~mem497#1.offset, main_#t~mem498#1.base, main_#t~mem498#1.offset, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~ret502#1, main_#t~ret503#1, main_#t~nondet504#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,778 INFO L272 TraceCheckUtils]: 2: Hoare triple {12622#true} call main_#t~ret480#1.base, main_#t~ret480#1.offset := dev_alloc_skb(1); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,778 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,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {12622#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {12649#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:37,779 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,779 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,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,780 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12622#true} {12622#true} #2426#return; {12622#true} is VALID [2022-02-20 21:36:37,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {12622#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {12622#true} is VALID [2022-02-20 21:36:37,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,780 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12622#true} {12622#true} #2436#return; {12622#true} is VALID [2022-02-20 21:36:37,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {12622#true} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret480#1.base, main_#t~ret480#1.offset;havoc main_#t~ret480#1.base, main_#t~ret480#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,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {12622#true} assume { :end_inline_ldv_initialize } true; {12622#true} is VALID [2022-02-20 21:36:37,781 INFO L272 TraceCheckUtils]: 14: Hoare triple {12622#true} call ldv_handler_precall(); {12622#true} is VALID [2022-02-20 21:36:37,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,781 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12622#true} {12622#true} #2438#return; {12622#true} is VALID [2022-02-20 21:36:37,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {12622#true} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet431#1, slip_init_#t~nondet432#1, slip_init_#t~nondet433#1, slip_init_#t~ret434#1.base, slip_init_#t~ret434#1.offset, slip_init_#t~nondet435#1, slip_init_#t~ret436#1, slip_init_#t~nondet437#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,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {12622#true} assume !(~slip_maxdev~0 <= 3); {12622#true} is VALID [2022-02-20 21:36:37,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {12622#true} havoc slip_init_#t~nondet431#1;havoc slip_init_#t~nondet432#1;havoc slip_init_#t~nondet433#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,782 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,783 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,783 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,783 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,784 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,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,784 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12622#true} {12622#true} #2424#return; {12622#true} is VALID [2022-02-20 21:36:37,784 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,789 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,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,790 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12622#true} {12622#true} #2440#return; {12622#true} is VALID [2022-02-20 21:36:37,790 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,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {12622#true} slip_init_#t~ret434#1.base, slip_init_#t~ret434#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~ret434#1.base, slip_init_#t~ret434#1.offset;havoc slip_init_#t~ret434#1.base, slip_init_#t~ret434#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,795 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~nondet534#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~nondet534#1 && tty_register_ldisc_#t~nondet534#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet534#1;havoc tty_register_ldisc_#t~nondet534#1; {12622#true} is VALID [2022-02-20 21:36:37,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {12622#true} slip_init_#t~ret436#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= slip_init_#t~ret436#1 && slip_init_#t~ret436#1 <= 2147483647;slip_init_~status~0#1 := slip_init_#t~ret436#1;havoc slip_init_#t~ret436#1; {12622#true} is VALID [2022-02-20 21:36:37,796 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,796 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,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {12622#true} main_#t~ret481#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret481#1 && main_#t~ret481#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret481#1;havoc main_#t~ret481#1; {12622#true} is VALID [2022-02-20 21:36:37,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {12622#true} assume !(0 != main_~tmp~38#1); {12622#true} is VALID [2022-02-20 21:36:37,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {12622#true} assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1; {12622#true} is VALID [2022-02-20 21:36:37,797 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,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {12622#true} assume -2147483648 <= main_#t~nondet482#1 && main_#t~nondet482#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet482#1;havoc main_#t~nondet482#1;main_#t~switch483#1 := 0 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 1 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 2 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 3 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 4 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 5 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 6 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 7 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 8 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {12622#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 9 == main_~tmp___0~20#1; {12622#true} is VALID [2022-02-20 21:36:37,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {12622#true} assume main_#t~switch483#1; {12622#true} is VALID [2022-02-20 21:36:37,802 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,802 INFO L272 TraceCheckUtils]: 53: Hoare triple {12622#true} call ldv_handler_precall(); {12622#true} is VALID [2022-02-20 21:36:37,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {12622#true} assume true; {12622#true} is VALID [2022-02-20 21:36:37,802 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12622#true} {12622#true} #2560#return; {12622#true} is VALID [2022-02-20 21:36:37,802 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~ret509#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_#t~mem321#1.base, slip_open_#t~mem321#1.offset, slip_open_#t~mem322#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~nondet512#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet512#1 && capable_#t~nondet512#1 <= 2147483647;capable_#res#1 := capable_#t~nondet512#1;havoc capable_#t~nondet512#1; {12622#true} is VALID [2022-02-20 21:36:37,803 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,803 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,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {12647#(<= (+ |ULTIMATE.start_slip_open_#res#1| 1) 0)} ldv_slip_open_3_#t~ret509#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret509#1 && ldv_slip_open_3_#t~ret509#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret509#1;havoc ldv_slip_open_3_#t~ret509#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,804 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,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {12623#false} assume !false; {12623#false} is VALID [2022-02-20 21:36:37,805 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,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:37,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125193338] [2022-02-20 21:36:37,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125193338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:37,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:37,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:36:37,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877504942] [2022-02-20 21:36:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:37,808 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,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:37,809 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,867 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,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:36:37,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:37,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:36:37,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:36:37,869 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:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:48,513 INFO L93 Difference]: Finished difference Result 1461 states and 2231 transitions. [2022-02-20 21:36:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:36:48,513 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:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:36:48,514 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:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2022-02-20 21:36:48,578 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:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2022-02-20 21:36:48,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 2231 transitions. [2022-02-20 21:36:50,387 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:50,523 INFO L225 Difference]: With dead ends: 1461 [2022-02-20 21:36:50,523 INFO L226 Difference]: Without dead ends: 1459 [2022-02-20 21:36:50,524 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:50,525 INFO L933 BasicCegarLoop]: 2129 mSDtfsCounter, 1296 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 5287 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:36:50,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1381 Valid, 5287 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 21:36:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-02-20 21:36:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 931. [2022-02-20 21:36:50,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:36:50,911 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:50,913 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:50,916 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:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:51,025 INFO L93 Difference]: Finished difference Result 1459 states and 2229 transitions. [2022-02-20 21:36:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2229 transitions. [2022-02-20 21:36:51,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:51,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:51,036 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:51,053 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:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:36:51,163 INFO L93 Difference]: Finished difference Result 1459 states and 2229 transitions. [2022-02-20 21:36:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2229 transitions. [2022-02-20 21:36:51,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:36:51,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:36:51,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:36:51,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:36:51,174 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:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1372 transitions. [2022-02-20 21:36:51,239 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1372 transitions. Word has length 62 [2022-02-20 21:36:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:36:51,240 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1372 transitions. [2022-02-20 21:36:51,241 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:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1372 transitions. [2022-02-20 21:36:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 21:36:51,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:36:51,243 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:51,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:36:51,244 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:36:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:36:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2124530077, now seen corresponding path program 1 times [2022-02-20 21:36:51,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:36:51,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571036655] [2022-02-20 21:36:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:36:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:36:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:36:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,414 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:51,414 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:51,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18878#true} {18878#true} #2426#return; {18878#true} is VALID [2022-02-20 21:36:51,416 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:51,416 INFO L272 TraceCheckUtils]: 1: Hoare triple {18878#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:51,416 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:51,417 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:51,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,417 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18878#true} {18878#true} #2426#return; {18878#true} is VALID [2022-02-20 21:36:51,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {18878#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {18878#true} is VALID [2022-02-20 21:36:51,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,418 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:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:36:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,427 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:51,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:36:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:36:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,448 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:51,448 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:51,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18878#true} {18878#true} #2424#return; {18878#true} is VALID [2022-02-20 21:36:51,449 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:51,449 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:51,449 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:51,450 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:51,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,450 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18878#true} {18878#true} #2424#return; {18878#true} is VALID [2022-02-20 21:36:51,450 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:51,450 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:51,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,451 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:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:36:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,460 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:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 21:36:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:36:51,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,465 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {18878#true} {18879#false} #2622#return; {18879#false} is VALID [2022-02-20 21:36:51,469 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(44, 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:51,469 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~ret480#1.base, main_#t~ret480#1.offset, main_#t~ret481#1, main_#t~nondet482#1, main_#t~switch483#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~ret489#1, main_#t~mem490#1.base, main_#t~mem490#1.offset, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~ret496#1, main_#t~mem497#1.base, main_#t~mem497#1.offset, main_#t~mem498#1.base, main_#t~mem498#1.offset, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~ret502#1, main_#t~ret503#1, main_#t~nondet504#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:51,470 INFO L272 TraceCheckUtils]: 2: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} call main_#t~ret480#1.base, main_#t~ret480#1.offset := dev_alloc_skb(1); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:51,470 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:51,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {18878#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {18907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:36:51,471 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:51,471 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:51,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,472 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18878#true} {18878#true} #2426#return; {18878#true} is VALID [2022-02-20 21:36:51,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {18878#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {18878#true} is VALID [2022-02-20 21:36:51,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,473 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:51,473 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~ret480#1.base, main_#t~ret480#1.offset;havoc main_#t~ret480#1.base, main_#t~ret480#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:51,473 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:51,474 INFO L272 TraceCheckUtils]: 14: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} call ldv_handler_precall(); {18878#true} is VALID [2022-02-20 21:36:51,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,474 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:51,474 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~nondet431#1, slip_init_#t~nondet432#1, slip_init_#t~nondet433#1, slip_init_#t~ret434#1.base, slip_init_#t~ret434#1.offset, slip_init_#t~nondet435#1, slip_init_#t~ret436#1, slip_init_#t~nondet437#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:51,475 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:51,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} havoc slip_init_#t~nondet431#1;havoc slip_init_#t~nondet432#1;havoc slip_init_#t~nondet433#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:51,481 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:51,481 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:51,482 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:51,482 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:51,482 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:51,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,483 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18878#true} {18878#true} #2424#return; {18878#true} is VALID [2022-02-20 21:36:51,483 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:51,483 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:51,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,484 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:51,484 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:51,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} slip_init_#t~ret434#1.base, slip_init_#t~ret434#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~ret434#1.base, slip_init_#t~ret434#1.offset;havoc slip_init_#t~ret434#1.base, slip_init_#t~ret434#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:51,485 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~nondet534#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~nondet534#1 && tty_register_ldisc_#t~nondet534#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet534#1;havoc tty_register_ldisc_#t~nondet534#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} slip_init_#t~ret436#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= slip_init_#t~ret436#1 && slip_init_#t~ret436#1 <= 2147483647;slip_init_~status~0#1 := slip_init_#t~ret436#1;havoc slip_init_#t~ret436#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,486 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:51,486 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:51,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} main_#t~ret481#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret481#1 && main_#t~ret481#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret481#1;havoc main_#t~ret481#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,487 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:51,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,488 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:51,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume -2147483648 <= main_#t~nondet482#1 && main_#t~nondet482#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet482#1;havoc main_#t~nondet482#1;main_#t~switch483#1 := 0 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 1 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 2 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 3 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 4 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 5 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 6 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 7 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 8 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 9 == main_~tmp___0~20#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} assume main_#t~switch483#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,492 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:51,493 INFO L272 TraceCheckUtils]: 53: Hoare triple {18880#(<= 256 ~slip_maxdev~0)} call ldv_handler_precall(); {18878#true} is VALID [2022-02-20 21:36:51,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,493 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:51,494 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~ret509#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_#t~mem321#1.base, slip_open_#t~mem321#1.offset, slip_open_#t~mem322#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~nondet512#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet512#1 && capable_#t~nondet512#1 <= 2147483647;capable_#res#1 := capable_#t~nondet512#1;havoc capable_#t~nondet512#1; {18880#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 21:36:51,494 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:51,495 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:51,495 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:51,496 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:51,497 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:51,498 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:51,498 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:51,500 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:51,501 INFO L272 TraceCheckUtils]: 65: Hoare triple {18879#false} call rtnl_unlock(); {18878#true} is VALID [2022-02-20 21:36:51,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {18878#true} assume true; {18878#true} is VALID [2022-02-20 21:36:51,501 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {18878#true} {18879#false} #2622#return; {18879#false} is VALID [2022-02-20 21:36:51,501 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:51,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {18879#false} ldv_slip_open_3_#t~ret509#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret509#1 && ldv_slip_open_3_#t~ret509#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret509#1;havoc ldv_slip_open_3_#t~ret509#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:51,502 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:51,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {18879#false} assume !false; {18879#false} is VALID [2022-02-20 21:36:51,502 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:51,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:36:51,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571036655] [2022-02-20 21:36:51,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571036655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:36:51,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:36:51,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:36:51,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686214491] [2022-02-20 21:36:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:36:51,525 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:51,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:36:51,525 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:51,586 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:51,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:36:51,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:36:51,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:36:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:36:51,587 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:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:37:00,713 INFO L93 Difference]: Finished difference Result 2375 states and 3581 transitions. [2022-02-20 21:37:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:37:00,714 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:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:37:00,714 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:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3575 transitions. [2022-02-20 21:37:00,809 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:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3575 transitions. [2022-02-20 21:37:00,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3575 transitions. [2022-02-20 21:37:03,498 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:03,608 INFO L225 Difference]: With dead ends: 2375 [2022-02-20 21:37:03,609 INFO L226 Difference]: Without dead ends: 1463 [2022-02-20 21:37:03,611 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:03,612 INFO L933 BasicCegarLoop]: 1816 mSDtfsCounter, 2190 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 3403 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:37:03,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2464 Valid, 3403 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 21:37:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-02-20 21:37:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 932. [2022-02-20 21:37:03,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:37:04,000 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:04,002 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:04,003 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:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:37:04,103 INFO L93 Difference]: Finished difference Result 1463 states and 2232 transitions. [2022-02-20 21:37:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2232 transitions. [2022-02-20 21:37:04,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:37:04,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:37:04,112 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:04,113 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:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:37:04,231 INFO L93 Difference]: Finished difference Result 1463 states and 2232 transitions. [2022-02-20 21:37:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2232 transitions. [2022-02-20 21:37:04,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:37:04,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:37:04,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:37:04,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:37:04,239 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:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1373 transitions. [2022-02-20 21:37:04,303 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1373 transitions. Word has length 72 [2022-02-20 21:37:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:37:04,303 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1373 transitions. [2022-02-20 21:37:04,304 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:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1373 transitions. [2022-02-20 21:37:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 21:37:04,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:37:04,307 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:04,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:37:04,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:37:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:37:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash -45216834, now seen corresponding path program 1 times [2022-02-20 21:37:04,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:37:04,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935035190] [2022-02-20 21:37:04,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:37:04,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:37:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:37:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:37:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,446 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:04,446 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:04,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26398#true} {26398#true} #2426#return; {26398#true} is VALID [2022-02-20 21:37:04,448 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:04,449 INFO L272 TraceCheckUtils]: 1: Hoare triple {26398#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:04,449 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:04,449 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:04,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,450 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {26398#true} {26398#true} #2426#return; {26398#true} is VALID [2022-02-20 21:37:04,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {26398#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {26398#true} is VALID [2022-02-20 21:37:04,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,450 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {26398#true} {26398#true} #2436#return; {26398#true} is VALID [2022-02-20 21:37:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:37:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,455 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {26398#true} {26398#true} #2438#return; {26398#true} is VALID [2022-02-20 21:37:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:37:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:37:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,472 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:04,472 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:04,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26398#true} {26398#true} #2424#return; {26398#true} is VALID [2022-02-20 21:37:04,472 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:04,473 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:04,473 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:04,473 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:04,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,474 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {26398#true} {26398#true} #2424#return; {26398#true} is VALID [2022-02-20 21:37:04,474 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:04,474 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:04,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,474 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26398#true} {26398#true} #2440#return; {26398#true} is VALID [2022-02-20 21:37:04,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:37:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,479 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {26398#true} {26398#true} #2560#return; {26398#true} is VALID [2022-02-20 21:37:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:37:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:37:04,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,485 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:04,485 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(44, 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:04,486 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~ret480#1.base, main_#t~ret480#1.offset, main_#t~ret481#1, main_#t~nondet482#1, main_#t~switch483#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~ret489#1, main_#t~mem490#1.base, main_#t~mem490#1.offset, main_#t~mem491#1.base, main_#t~mem491#1.offset, main_#t~ret492#1, main_#t~mem493#1.base, main_#t~mem493#1.offset, main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~mem495#1.base, main_#t~mem495#1.offset, main_#t~ret496#1, main_#t~mem497#1.base, main_#t~mem497#1.offset, main_#t~mem498#1.base, main_#t~mem498#1.offset, main_#t~ret499#1, main_#t~ret500#1, main_#t~ret501#1, main_#t~ret502#1, main_#t~ret503#1, main_#t~nondet504#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:04,486 INFO L272 TraceCheckUtils]: 2: Hoare triple {26398#true} call main_#t~ret480#1.base, main_#t~ret480#1.offset := dev_alloc_skb(1); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:04,486 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:04,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {26398#true} call #t~ret515.base, #t~ret515.offset := ldv_malloc(243); {26428#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:37:04,487 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:04,487 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:04,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,488 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {26398#true} {26398#true} #2426#return; {26398#true} is VALID [2022-02-20 21:37:04,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {26398#true} #res.base, #res.offset := #t~ret515.base, #t~ret515.offset;havoc #t~ret515.base, #t~ret515.offset; {26398#true} is VALID [2022-02-20 21:37:04,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,488 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {26398#true} {26398#true} #2436#return; {26398#true} is VALID [2022-02-20 21:37:04,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {26398#true} main_~var_group2~0#1.base, main_~var_group2~0#1.offset := main_#t~ret480#1.base, main_#t~ret480#1.offset;havoc main_#t~ret480#1.base, main_#t~ret480#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:04,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {26398#true} assume { :end_inline_ldv_initialize } true; {26398#true} is VALID [2022-02-20 21:37:04,488 INFO L272 TraceCheckUtils]: 14: Hoare triple {26398#true} call ldv_handler_precall(); {26398#true} is VALID [2022-02-20 21:37:04,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,489 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26398#true} {26398#true} #2438#return; {26398#true} is VALID [2022-02-20 21:37:04,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {26398#true} assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet431#1, slip_init_#t~nondet432#1, slip_init_#t~nondet433#1, slip_init_#t~ret434#1.base, slip_init_#t~ret434#1.offset, slip_init_#t~nondet435#1, slip_init_#t~ret436#1, slip_init_#t~nondet437#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:04,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {26398#true} assume !(~slip_maxdev~0 <= 3); {26398#true} is VALID [2022-02-20 21:37:04,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {26398#true} havoc slip_init_#t~nondet431#1;havoc slip_init_#t~nondet432#1;havoc slip_init_#t~nondet433#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:04,490 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:04,490 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:04,491 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:04,491 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:04,491 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:04,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,491 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26398#true} {26398#true} #2424#return; {26398#true} is VALID [2022-02-20 21:37:04,491 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:04,491 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:04,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,492 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {26398#true} {26398#true} #2440#return; {26398#true} is VALID [2022-02-20 21:37:04,492 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:04,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {26398#true} slip_init_#t~ret434#1.base, slip_init_#t~ret434#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~ret434#1.base, slip_init_#t~ret434#1.offset;havoc slip_init_#t~ret434#1.base, slip_init_#t~ret434#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:04,492 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~nondet534#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~nondet534#1 && tty_register_ldisc_#t~nondet534#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet534#1;havoc tty_register_ldisc_#t~nondet534#1; {26398#true} is VALID [2022-02-20 21:37:04,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {26398#true} slip_init_#t~ret436#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= slip_init_#t~ret436#1 && slip_init_#t~ret436#1 <= 2147483647;slip_init_~status~0#1 := slip_init_#t~ret436#1;havoc slip_init_#t~ret436#1; {26398#true} is VALID [2022-02-20 21:37:04,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {26398#true} assume !(0 != slip_init_~status~0#1); {26398#true} is VALID [2022-02-20 21:37:04,493 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:04,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {26398#true} main_#t~ret481#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret481#1 && main_#t~ret481#1 <= 2147483647;main_~tmp~38#1 := main_#t~ret481#1;havoc main_#t~ret481#1; {26398#true} is VALID [2022-02-20 21:37:04,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {26398#true} assume !(0 != main_~tmp~38#1); {26398#true} is VALID [2022-02-20 21:37:04,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {26398#true} assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1; {26398#true} is VALID [2022-02-20 21:37:04,493 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:04,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {26398#true} assume -2147483648 <= main_#t~nondet482#1 && main_#t~nondet482#1 <= 2147483647;main_~tmp___0~20#1 := main_#t~nondet482#1;havoc main_#t~nondet482#1;main_#t~switch483#1 := 0 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 1 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 2 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 3 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 4 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 5 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 6 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 7 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 8 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {26398#true} assume !main_#t~switch483#1;main_#t~switch483#1 := main_#t~switch483#1 || 9 == main_~tmp___0~20#1; {26398#true} is VALID [2022-02-20 21:37:04,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {26398#true} assume main_#t~switch483#1; {26398#true} is VALID [2022-02-20 21:37:04,495 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:04,495 INFO L272 TraceCheckUtils]: 53: Hoare triple {26398#true} call ldv_handler_precall(); {26398#true} is VALID [2022-02-20 21:37:04,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,496 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26398#true} {26398#true} #2560#return; {26398#true} is VALID [2022-02-20 21:37:04,496 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~ret509#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_#t~mem321#1.base, slip_open_#t~mem321#1.offset, slip_open_#t~mem322#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~nondet512#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet512#1 && capable_#t~nondet512#1 <= 2147483647;capable_#res#1 := capable_#t~nondet512#1;havoc capable_#t~nondet512#1; {26398#true} is VALID [2022-02-20 21:37:04,496 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:04,496 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:04,496 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:04,496 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:04,497 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:04,497 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:04,497 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:04,498 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:04,498 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:04,498 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:04,498 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:04,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {26398#true} assume true; {26398#true} is VALID [2022-02-20 21:37:04,499 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:04,499 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:04,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {26426#(<= (+ |ULTIMATE.start_slip_open_#res#1| 17) 0)} ldv_slip_open_3_#t~ret509#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_3_#t~ret509#1 && ldv_slip_open_3_#t~ret509#1 <= 2147483647;ldv_slip_open_3_~tmp~41#1 := ldv_slip_open_3_#t~ret509#1;havoc ldv_slip_open_3_#t~ret509#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:04,500 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:04,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {26399#false} assume !false; {26399#false} is VALID [2022-02-20 21:37:04,501 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:04,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:37:04,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935035190] [2022-02-20 21:37:04,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935035190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:37:04,502 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:37:04,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:37:04,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771904616] [2022-02-20 21:37:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:37:04,505 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:04,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:37:04,505 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:04,559 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:04,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:37:04,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:37:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:37:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:37:04,560 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)