./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:03:44,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:03:44,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:03:44,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:03:44,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:03:44,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:03:44,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:03:44,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:03:44,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:03:44,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:03:44,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:03:44,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:03:44,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:03:44,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:03:44,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:03:44,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:03:44,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:03:44,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:03:44,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:03:44,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:03:44,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:03:44,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:03:44,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:03:44,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:03:44,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:03:44,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:03:44,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:03:44,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:03:44,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:03:44,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:03:44,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:03:44,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:03:44,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:03:44,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:03:44,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:03:44,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:03:44,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:03:44,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:03:44,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:03:44,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:03:44,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:03:44,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:03:44,385 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:03:44,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:03:44,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:03:44,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:03:44,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:03:44,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:03:44,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:03:44,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:03:44,394 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:03:44,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:03:44,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:03:44,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:03:44,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:03:44,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:03:44,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:03:44,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:03:44,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:03:44,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:03:44,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:03:44,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:03:44,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:03:44,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:03:44,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:03:44,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:03:44,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:03:44,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:03:44,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:03:44,398 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:03:44,398 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:03:44,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:03:44,398 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 -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e [2022-02-20 22:03:44,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:03:44,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:03:44,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:03:44,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:03:44,593 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:03:44,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-02-20 22:03:44,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b31cfda/f369ffa21c8c4d3d927ecc98522ff178/FLAGbb6bf3d04 [2022-02-20 22:03:45,183 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:03:45,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-02-20 22:03:45,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b31cfda/f369ffa21c8c4d3d927ecc98522ff178/FLAGbb6bf3d04 [2022-02-20 22:03:45,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b31cfda/f369ffa21c8c4d3d927ecc98522ff178 [2022-02-20 22:03:45,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:03:45,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:03:45,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:03:45,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:03:45,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:03:45,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:03:45" (1/1) ... [2022-02-20 22:03:45,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261b81c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:45, skipping insertion in model container [2022-02-20 22:03:45,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:03:45" (1/1) ... [2022-02-20 22:03:45,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:03:45,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:03:46,165 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-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-02-20 22:03:46,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:03:46,791 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:03:46,844 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-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-02-20 22:03:46,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:03:47,063 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:03:47,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47 WrapperNode [2022-02-20 22:03:47,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:03:47,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:03:47,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:03:47,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:03:47,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,281 INFO L137 Inliner]: procedures = 184, calls = 828, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3190 [2022-02-20 22:03:47,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:03:47,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:03:47,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:03:47,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:03:47,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:03:47,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:03:47,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:03:47,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:03:47,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (1/1) ... [2022-02-20 22:03:47,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:03:47,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:03:47,515 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 22:03:47,521 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 22:03:47,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-02-20 22:03:47,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-02-20 22:03:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-02-20 22:03:47,543 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-02-20 22:03:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:03:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-02-20 22:03:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-02-20 22:03:47,544 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-02-20 22:03:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:03:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:03:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:03:47,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:03:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:03:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-02-20 22:03:47,545 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-02-20 22:03:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 22:03:47,545 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 22:03:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-02-20 22:03:47,545 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-02-20 22:03:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 22:03:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 22:03:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-02-20 22:03:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-02-20 22:03:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:03:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:03:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 22:03:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 22:03:47,547 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-02-20 22:03:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-02-20 22:03:47,547 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:03:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:03:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-02-20 22:03:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-02-20 22:03:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:03:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:03:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:03:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:03:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:03:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-02-20 22:03:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-02-20 22:03:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:03:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:03:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-02-20 22:03:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-02-20 22:03:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-02-20 22:03:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-02-20 22:03:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:03:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-02-20 22:03:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-02-20 22:03:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-02-20 22:03:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-02-20 22:03:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-02-20 22:03:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-02-20 22:03:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:03:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-02-20 22:03:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-02-20 22:03:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-02-20 22:03:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-02-20 22:03:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:03:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:03:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 22:03:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-02-20 22:03:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-02-20 22:03:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-02-20 22:03:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-02-20 22:03:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-02-20 22:03:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-02-20 22:03:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-02-20 22:03:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-02-20 22:03:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:03:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 22:03:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 22:03:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 22:03:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 22:03:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 22:03:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 22:03:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-02-20 22:03:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-02-20 22:03:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-02-20 22:03:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-02-20 22:03:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:03:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-02-20 22:03:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-02-20 22:03:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:03:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-02-20 22:03:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-02-20 22:03:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 22:03:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 22:03:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-02-20 22:03:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-02-20 22:03:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 22:03:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 22:03:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 22:03:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 22:03:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-02-20 22:03:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-02-20 22:03:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-02-20 22:03:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-02-20 22:03:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 22:03:47,559 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 22:03:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 22:03:47,559 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 22:03:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 22:03:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 22:03:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 22:03:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 22:03:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:03:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-02-20 22:03:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-02-20 22:03:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-02-20 22:03:47,561 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-02-20 22:03:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-02-20 22:03:47,561 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-02-20 22:03:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:03:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 22:03:47,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 22:03:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:03:47,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:03:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-02-20 22:03:47,563 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-02-20 22:03:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-02-20 22:03:47,565 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-02-20 22:03:48,003 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:03:48,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:03:48,269 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:03:50,317 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:03:50,330 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:03:50,343 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:03:50,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:03:50 BoogieIcfgContainer [2022-02-20 22:03:50,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:03:50,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:03:50,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:03:50,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:03:50,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:03:45" (1/3) ... [2022-02-20 22:03:50,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2bf1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:03:50, skipping insertion in model container [2022-02-20 22:03:50,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:03:47" (2/3) ... [2022-02-20 22:03:50,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2bf1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:03:50, skipping insertion in model container [2022-02-20 22:03:50,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:03:50" (3/3) ... [2022-02-20 22:03:50,351 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-02-20 22:03:50,355 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:03:50,355 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:03:50,406 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:03:50,411 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 22:03:50,411 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:03:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-02-20 22:03:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 22:03:50,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:03:50,474 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:50,474 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:03:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:03:50,478 INFO L85 PathProgramCache]: Analyzing trace with hash 385485251, now seen corresponding path program 1 times [2022-02-20 22:03:50,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:03:50,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665130504] [2022-02-20 22:03:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:03:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:03:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:03:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #2846#return; {1093#true} is VALID [2022-02-20 22:03:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:03:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #2848#return; {1093#true} is VALID [2022-02-20 22:03:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:03:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #2850#return; {1093#true} is VALID [2022-02-20 22:03:50,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:03:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #2852#return; {1093#true} is VALID [2022-02-20 22:03:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:03:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #2854#return; {1093#true} is VALID [2022-02-20 22:03:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 22:03:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #2856#return; {1093#true} is VALID [2022-02-20 22:03:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:03:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:50,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #2858#return; {1093#true} is VALID [2022-02-20 22:03:50,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {1093#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(74, 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(5, 16);call write~init~int(115, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(0, 16, 4, 1);call #Ultimate.allocInit(79, 17);call #Ultimate.allocInit(22, 18);call #Ultimate.allocInit(72, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(37, 23);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(62, 25);~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_state_2~0 := 0;~ldv_state_variable_0~0 := 0;~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2~0.base, ~ldv_timer_list_2~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~sl_netdev_ops_group1~0.base, ~sl_netdev_ops_group1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 26, 0;call #Ultimate.allocInit(280, 26);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 := 27, 0;call #Ultimate.allocInit(144, 27);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(16, 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_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0; {1093#true} is VALID [2022-02-20 22:03:50,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~ret495#1.base, main_#t~ret495#1.offset, main_#t~nondet496#1, main_#t~ret497#1.base, main_#t~ret497#1.offset, main_#t~nondet498#1, main_#t~nondet499#1, main_#t~ret500#1.base, main_#t~ret500#1.offset, main_#t~nondet501#1, main_#t~nondet502#1, main_#t~nondet503#1, main_#t~nondet504#1, main_#t~ret505#1.base, main_#t~ret505#1.offset, main_#t~ret506#1.base, main_#t~ret506#1.offset, main_#t~ret507#1.base, main_#t~ret507#1.offset, main_#t~nondet508#1, main_#t~switch509#1, main_#t~nondet510#1, main_#t~switch511#1, main_#t~ret512#1, main_#t~ret513#1, main_#t~ret514#1, main_#t~ret515#1, main_#t~ret516#1, main_#t~ret517#1, main_#t~ret518#1, main_#t~ret519#1, main_#t~ret520#1.base, main_#t~ret520#1.offset, main_#t~ret521#1.base, main_#t~ret521#1.offset, main_#t~ret522#1.base, main_#t~ret522#1.offset, main_#t~ret523#1, main_#t~nondet524#1, main_#t~switch525#1, main_#t~ret526#1, main_#t~nondet527#1, main_#t~switch528#1, main_#t~ret529#1, main_#t~ret530#1, main_#t~ret531#1, main_#t~ret532#1, main_#t~ret533#1, main_#t~ret534#1, main_#t~ret535#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~44#1.base, main_~tmp~44#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset, main_~ldvarg3~0#1, main_~tmp___1~13#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset, main_~ldvarg2~0#1, main_~tmp___3~4#1, main_~ldvarg11~0#1, main_~tmp___4~3#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~ldvarg12~0#1, main_~tmp___6~1#1, main_~ldvarg5~0#1, main_~tmp___7~1#1, main_~ldvarg6~0#1, main_~tmp___8~0#1, main_~ldvarg8~0#1, main_~tmp___9~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset, main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset, main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset, main_~tmp___13~0#1, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~44#1.base, main_~tmp~44#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___3~4#1;havoc main_~ldvarg11~0#1;havoc main_~tmp___4~3#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~ldvarg12~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___7~1#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg8~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset;havoc main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset;havoc main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;havoc main_~tmp___13~0#1;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1; {1093#true} is VALID [2022-02-20 22:03:50,928 INFO L272 TraceCheckUtils]: 2: Hoare triple {1093#true} call main_#t~ret494#1.base, main_#t~ret494#1.offset := ldv_zalloc(240); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:50,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,928 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1093#true} {1093#true} #2846#return; {1093#true} is VALID [2022-02-20 22:03:50,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#true} main_~tmp~44#1.base, main_~tmp~44#1.offset := main_#t~ret494#1.base, main_#t~ret494#1.offset;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~44#1.base, main_~tmp~44#1.offset; {1093#true} is VALID [2022-02-20 22:03:50,929 INFO L272 TraceCheckUtils]: 8: Hoare triple {1093#true} call main_#t~ret495#1.base, main_#t~ret495#1.offset := ldv_zalloc(40); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:50,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,930 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1093#true} {1093#true} #2848#return; {1093#true} is VALID [2022-02-20 22:03:50,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {1093#true} main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset := main_#t~ret495#1.base, main_#t~ret495#1.offset;havoc main_#t~ret495#1.base, main_#t~ret495#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;assume -2147483648 <= main_#t~nondet496#1 && main_#t~nondet496#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet496#1;havoc main_#t~nondet496#1;main_~ldvarg3~0#1 := main_~tmp___1~13#1; {1093#true} is VALID [2022-02-20 22:03:50,930 INFO L272 TraceCheckUtils]: 14: Hoare triple {1093#true} call main_#t~ret497#1.base, main_#t~ret497#1.offset := ldv_zalloc(184); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:50,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,931 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1093#true} {1093#true} #2850#return; {1093#true} is VALID [2022-02-20 22:03:50,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#true} main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset := main_#t~ret497#1.base, main_#t~ret497#1.offset;havoc main_#t~ret497#1.base, main_#t~ret497#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;assume -2147483648 <= main_#t~nondet498#1 && main_#t~nondet498#1 <= 2147483647;main_~tmp___3~4#1 := main_#t~nondet498#1;havoc main_#t~nondet498#1;main_~ldvarg2~0#1 := main_~tmp___3~4#1;main_~tmp___4~3#1 := main_#t~nondet499#1;havoc main_#t~nondet499#1;main_~ldvarg11~0#1 := main_~tmp___4~3#1; {1093#true} is VALID [2022-02-20 22:03:50,932 INFO L272 TraceCheckUtils]: 20: Hoare triple {1093#true} call main_#t~ret500#1.base, main_#t~ret500#1.offset := ldv_zalloc(336); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:50,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,932 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1093#true} {1093#true} #2852#return; {1093#true} is VALID [2022-02-20 22:03:50,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1093#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret500#1.base, main_#t~ret500#1.offset;havoc main_#t~ret500#1.base, main_#t~ret500#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;main_~tmp___6~1#1 := main_#t~nondet501#1;havoc main_#t~nondet501#1;main_~ldvarg12~0#1 := main_~tmp___6~1#1;main_~tmp___7~1#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1;main_~ldvarg5~0#1 := main_~tmp___7~1#1;main_~tmp___8~0#1 := main_#t~nondet503#1;havoc main_#t~nondet503#1;main_~ldvarg6~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1;main_~ldvarg8~0#1 := main_~tmp___9~0#1; {1093#true} is VALID [2022-02-20 22:03:50,933 INFO L272 TraceCheckUtils]: 26: Hoare triple {1093#true} call main_#t~ret505#1.base, main_#t~ret505#1.offset := ldv_zalloc(336); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:50,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,934 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1093#true} {1093#true} #2854#return; {1093#true} is VALID [2022-02-20 22:03:50,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {1093#true} main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset := main_#t~ret505#1.base, main_#t~ret505#1.offset;havoc main_#t~ret505#1.base, main_#t~ret505#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset; {1093#true} is VALID [2022-02-20 22:03:50,935 INFO L272 TraceCheckUtils]: 32: Hoare triple {1093#true} call main_#t~ret506#1.base, main_#t~ret506#1.offset := ldv_zalloc(1); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:50,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,935 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1093#true} {1093#true} #2856#return; {1093#true} is VALID [2022-02-20 22:03:50,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {1093#true} main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset := main_#t~ret506#1.base, main_#t~ret506#1.offset;havoc main_#t~ret506#1.base, main_#t~ret506#1.offset;main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset := main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset; {1093#true} is VALID [2022-02-20 22:03:50,936 INFO L272 TraceCheckUtils]: 38: Hoare triple {1093#true} call main_#t~ret507#1.base, main_#t~ret507#1.offset := ldv_zalloc(1); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:50,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {1093#true} is VALID [2022-02-20 22:03:50,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {1093#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1093#true} is VALID [2022-02-20 22:03:50,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-02-20 22:03:50,937 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1093#true} {1093#true} #2858#return; {1093#true} is VALID [2022-02-20 22:03:50,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {1093#true} main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset := main_#t~ret507#1.base, main_#t~ret507#1.offset;havoc main_#t~ret507#1.base, main_#t~ret507#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;assume { :begin_inline_ldv_initialize } true; {1093#true} is VALID [2022-02-20 22:03:50,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {1093#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {1123#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:03:50,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {1123#(= ~ldv_state_variable_3~0 0)} assume -2147483648 <= main_#t~nondet508#1 && main_#t~nondet508#1 <= 2147483647;main_~tmp___13~0#1 := main_#t~nondet508#1;havoc main_#t~nondet508#1;main_#t~switch509#1 := 0 == main_~tmp___13~0#1; {1123#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:03:50,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {1123#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 1 == main_~tmp___13~0#1; {1123#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:03:50,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {1123#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 2 == main_~tmp___13~0#1; {1123#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:03:50,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {1123#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 3 == main_~tmp___13~0#1; {1123#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:03:50,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {1123#(= ~ldv_state_variable_3~0 0)} assume main_#t~switch509#1; {1123#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:03:50,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {1123#(= ~ldv_state_variable_3~0 0)} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet527#1 && main_#t~nondet527#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet527#1;havoc main_#t~nondet527#1;main_#t~switch528#1 := 0 == main_~tmp___16~0#1; {1094#false} is VALID [2022-02-20 22:03:50,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {1094#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 1 == main_~tmp___16~0#1; {1094#false} is VALID [2022-02-20 22:03:50,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {1094#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 2 == main_~tmp___16~0#1; {1094#false} is VALID [2022-02-20 22:03:50,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {1094#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 3 == main_~tmp___16~0#1; {1094#false} is VALID [2022-02-20 22:03:50,941 INFO L290 TraceCheckUtils]: 54: Hoare triple {1094#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 4 == main_~tmp___16~0#1; {1094#false} is VALID [2022-02-20 22:03:50,941 INFO L290 TraceCheckUtils]: 55: Hoare triple {1094#false} assume main_#t~switch528#1; {1094#false} is VALID [2022-02-20 22:03:50,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {1094#false} assume 1 == ~ldv_state_variable_3~0;assume { :begin_inline_ldv_slip_open_18 } true;ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset := ~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset;havoc ldv_slip_open_18_#res#1;havoc ldv_slip_open_18_#t~ret555#1, ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset, ldv_slip_open_18_~ldv_func_res~17#1, ldv_slip_open_18_~tmp~62#1;ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset := ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset;havoc ldv_slip_open_18_~ldv_func_res~17#1;havoc ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret305#1, slip_open_#t~mem306#1.base, slip_open_#t~mem306#1.offset, slip_open_#t~mem307#1.base, slip_open_#t~mem307#1.offset, slip_open_#t~mem308#1.base, slip_open_#t~mem308#1.offset, slip_open_#t~mem309#1, slip_open_#t~short310#1, slip_open_#t~ret311#1, slip_open_#t~ret312#1.base, slip_open_#t~ret312#1.offset, slip_open_#t~ret313#1, slip_open_#t~ret314#1.base, slip_open_#t~ret314#1.offset, slip_open_#t~mem315#1, slip_open_#t~ret316#1, slip_open_#t~ret317#1, slip_open_#t~mem318#1.base, slip_open_#t~mem318#1.offset, slip_open_#t~ret319#1, slip_open_#t~mem320#1, slip_open_#t~mem321#1, slip_open_#t~mem322#1, slip_open_#t~mem323#1, slip_open_#t~mem324#1.base, slip_open_#t~mem324#1.offset, slip_open_#t~mem325#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~30#1, slip_open_~tmp___0~12#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~30#1;havoc slip_open_~tmp___0~12#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~nondet558#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet558#1 && capable_#t~nondet558#1 <= 2147483647;capable_#res#1 := capable_#t~nondet558#1;havoc capable_#t~nondet558#1; {1094#false} is VALID [2022-02-20 22:03:50,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {1094#false} slip_open_#t~ret305#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret305#1 && slip_open_#t~ret305#1 <= 2147483647;slip_open_~tmp~30#1 := slip_open_#t~ret305#1;havoc slip_open_#t~ret305#1; {1094#false} is VALID [2022-02-20 22:03:50,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {1094#false} assume 0 == slip_open_~tmp~30#1;slip_open_#res#1 := -1; {1094#false} is VALID [2022-02-20 22:03:50,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {1094#false} ldv_slip_open_18_#t~ret555#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_18_#t~ret555#1 && ldv_slip_open_18_#t~ret555#1 <= 2147483647;ldv_slip_open_18_~tmp~62#1 := ldv_slip_open_18_#t~ret555#1;havoc ldv_slip_open_18_#t~ret555#1;ldv_slip_open_18_~ldv_func_res~17#1 := ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_18_~ldv_func_res~17#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; {1094#false} is VALID [2022-02-20 22:03:50,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {1094#false} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0); {1094#false} is VALID [2022-02-20 22:03:50,942 INFO L272 TraceCheckUtils]: 61: Hoare triple {1094#false} call ldv_error(); {1094#false} is VALID [2022-02-20 22:03:50,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-02-20 22:03:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 22:03:50,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:03:50,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665130504] [2022-02-20 22:03:50,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665130504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:03:50,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:03:50,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:03:50,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053202364] [2022-02-20 22:03:50,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:03:50,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-02-20 22:03:50,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:03:50,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:03:50,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:50,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:03:50,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:03:51,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:03:51,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:03:51,015 INFO L87 Difference]: Start difference. First operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:04:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:01,410 INFO L93 Difference]: Finished difference Result 2930 states and 4384 transitions. [2022-02-20 22:04:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:04:01,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-02-20 22:04:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:04:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:04:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4384 transitions. [2022-02-20 22:04:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:04:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4384 transitions. [2022-02-20 22:04:01,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 4384 transitions. [2022-02-20 22:04:04,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4384 edges. 4384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:05,049 INFO L225 Difference]: With dead ends: 2930 [2022-02-20 22:04:05,050 INFO L226 Difference]: Without dead ends: 1760 [2022-02-20 22:04:05,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 22:04:05,059 INFO L933 BasicCegarLoop]: 1701 mSDtfsCounter, 1448 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-20 22:04:05,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1573 Valid, 3253 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-02-20 22:04:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-02-20 22:04:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1604. [2022-02-20 22:04:05,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:04:05,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1760 states. Second operand has 1604 states, 1182 states have (on average 1.4027072758037225) internal successors, (1658), 1215 states have internal predecessors, (1658), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:05,176 INFO L74 IsIncluded]: Start isIncluded. First operand 1760 states. Second operand has 1604 states, 1182 states have (on average 1.4027072758037225) internal successors, (1658), 1215 states have internal predecessors, (1658), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:05,180 INFO L87 Difference]: Start difference. First operand 1760 states. Second operand has 1604 states, 1182 states have (on average 1.4027072758037225) internal successors, (1658), 1215 states have internal predecessors, (1658), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:05,305 INFO L93 Difference]: Finished difference Result 1760 states and 2600 transitions. [2022-02-20 22:04:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2600 transitions. [2022-02-20 22:04:05,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:05,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:05,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 1604 states, 1182 states have (on average 1.4027072758037225) internal successors, (1658), 1215 states have internal predecessors, (1658), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) Second operand 1760 states. [2022-02-20 22:04:05,326 INFO L87 Difference]: Start difference. First operand has 1604 states, 1182 states have (on average 1.4027072758037225) internal successors, (1658), 1215 states have internal predecessors, (1658), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) Second operand 1760 states. [2022-02-20 22:04:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:05,441 INFO L93 Difference]: Finished difference Result 1760 states and 2600 transitions. [2022-02-20 22:04:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2600 transitions. [2022-02-20 22:04:05,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:05,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:05,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:04:05,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:04:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1182 states have (on average 1.4027072758037225) internal successors, (1658), 1215 states have internal predecessors, (1658), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2323 transitions. [2022-02-20 22:04:05,583 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2323 transitions. Word has length 63 [2022-02-20 22:04:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:04:05,584 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2323 transitions. [2022-02-20 22:04:05,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:04:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2323 transitions. [2022-02-20 22:04:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 22:04:05,591 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:04:05,592 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:04:05,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:04:05,592 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:04:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:04:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1548414277, now seen corresponding path program 1 times [2022-02-20 22:04:05,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:04:05,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280865017] [2022-02-20 22:04:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:04:05,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:04:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:04:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2846#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:04:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2848#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:04:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2850#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:04:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2852#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:04:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2854#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 22:04:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2856#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:04:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2858#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 22:04:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:04:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {10907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {10857#true} is VALID [2022-02-20 22:04:05,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10857#true} #2776#return; {10857#true} is VALID [2022-02-20 22:04:05,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {10907#(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~ret31#1.base, __kmalloc_#t~ret31#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {10857#true} is VALID [2022-02-20 22:04:05,875 INFO L272 TraceCheckUtils]: 1: Hoare triple {10857#true} call __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset := ldv_malloc(__kmalloc_~size#1); {10907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {10907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {10857#true} is VALID [2022-02-20 22:04:05,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {10857#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,878 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10857#true} {10857#true} #2776#return; {10857#true} is VALID [2022-02-20 22:04:05,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {10857#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset;havoc __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset; {10857#true} is VALID [2022-02-20 22:04:05,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {10857#true} #t~ret32#1.base, #t~ret32#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~ret32#1.base, #t~ret32#1.offset;havoc #t~ret32#1.base, #t~ret32#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {10857#true} is VALID [2022-02-20 22:04:05,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,881 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10857#true} {10858#false} #2950#return; {10858#false} is VALID [2022-02-20 22:04:05,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-02-20 22:04:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10858#false} #2954#return; {10858#false} is VALID [2022-02-20 22:04:05,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-02-20 22:04:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:05,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10857#true} {10858#false} #2956#return; {10858#false} is VALID [2022-02-20 22:04:05,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {10857#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(74, 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(5, 16);call write~init~int(115, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(0, 16, 4, 1);call #Ultimate.allocInit(79, 17);call #Ultimate.allocInit(22, 18);call #Ultimate.allocInit(72, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(37, 23);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(62, 25);~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_state_2~0 := 0;~ldv_state_variable_0~0 := 0;~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2~0.base, ~ldv_timer_list_2~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~sl_netdev_ops_group1~0.base, ~sl_netdev_ops_group1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 26, 0;call #Ultimate.allocInit(280, 26);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 := 27, 0;call #Ultimate.allocInit(144, 27);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(16, 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_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~ret495#1.base, main_#t~ret495#1.offset, main_#t~nondet496#1, main_#t~ret497#1.base, main_#t~ret497#1.offset, main_#t~nondet498#1, main_#t~nondet499#1, main_#t~ret500#1.base, main_#t~ret500#1.offset, main_#t~nondet501#1, main_#t~nondet502#1, main_#t~nondet503#1, main_#t~nondet504#1, main_#t~ret505#1.base, main_#t~ret505#1.offset, main_#t~ret506#1.base, main_#t~ret506#1.offset, main_#t~ret507#1.base, main_#t~ret507#1.offset, main_#t~nondet508#1, main_#t~switch509#1, main_#t~nondet510#1, main_#t~switch511#1, main_#t~ret512#1, main_#t~ret513#1, main_#t~ret514#1, main_#t~ret515#1, main_#t~ret516#1, main_#t~ret517#1, main_#t~ret518#1, main_#t~ret519#1, main_#t~ret520#1.base, main_#t~ret520#1.offset, main_#t~ret521#1.base, main_#t~ret521#1.offset, main_#t~ret522#1.base, main_#t~ret522#1.offset, main_#t~ret523#1, main_#t~nondet524#1, main_#t~switch525#1, main_#t~ret526#1, main_#t~nondet527#1, main_#t~switch528#1, main_#t~ret529#1, main_#t~ret530#1, main_#t~ret531#1, main_#t~ret532#1, main_#t~ret533#1, main_#t~ret534#1, main_#t~ret535#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~44#1.base, main_~tmp~44#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset, main_~ldvarg3~0#1, main_~tmp___1~13#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset, main_~ldvarg2~0#1, main_~tmp___3~4#1, main_~ldvarg11~0#1, main_~tmp___4~3#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~ldvarg12~0#1, main_~tmp___6~1#1, main_~ldvarg5~0#1, main_~tmp___7~1#1, main_~ldvarg6~0#1, main_~tmp___8~0#1, main_~ldvarg8~0#1, main_~tmp___9~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset, main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset, main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset, main_~tmp___13~0#1, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~44#1.base, main_~tmp~44#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___3~4#1;havoc main_~ldvarg11~0#1;havoc main_~tmp___4~3#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~ldvarg12~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___7~1#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg8~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset;havoc main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset;havoc main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;havoc main_~tmp___13~0#1;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,910 INFO L272 TraceCheckUtils]: 2: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} call main_#t~ret494#1.base, main_#t~ret494#1.offset := ldv_zalloc(240); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,911 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2846#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} main_~tmp~44#1.base, main_~tmp~44#1.offset := main_#t~ret494#1.base, main_#t~ret494#1.offset;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~44#1.base, main_~tmp~44#1.offset; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,912 INFO L272 TraceCheckUtils]: 8: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} call main_#t~ret495#1.base, main_#t~ret495#1.offset := ldv_zalloc(40); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,913 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2848#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset := main_#t~ret495#1.base, main_#t~ret495#1.offset;havoc main_#t~ret495#1.base, main_#t~ret495#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;assume -2147483648 <= main_#t~nondet496#1 && main_#t~nondet496#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet496#1;havoc main_#t~nondet496#1;main_~ldvarg3~0#1 := main_~tmp___1~13#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,914 INFO L272 TraceCheckUtils]: 14: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} call main_#t~ret497#1.base, main_#t~ret497#1.offset := ldv_zalloc(184); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,915 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2850#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset := main_#t~ret497#1.base, main_#t~ret497#1.offset;havoc main_#t~ret497#1.base, main_#t~ret497#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;assume -2147483648 <= main_#t~nondet498#1 && main_#t~nondet498#1 <= 2147483647;main_~tmp___3~4#1 := main_#t~nondet498#1;havoc main_#t~nondet498#1;main_~ldvarg2~0#1 := main_~tmp___3~4#1;main_~tmp___4~3#1 := main_#t~nondet499#1;havoc main_#t~nondet499#1;main_~ldvarg11~0#1 := main_~tmp___4~3#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,916 INFO L272 TraceCheckUtils]: 20: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} call main_#t~ret500#1.base, main_#t~ret500#1.offset := ldv_zalloc(336); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,917 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2852#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret500#1.base, main_#t~ret500#1.offset;havoc main_#t~ret500#1.base, main_#t~ret500#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;main_~tmp___6~1#1 := main_#t~nondet501#1;havoc main_#t~nondet501#1;main_~ldvarg12~0#1 := main_~tmp___6~1#1;main_~tmp___7~1#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1;main_~ldvarg5~0#1 := main_~tmp___7~1#1;main_~tmp___8~0#1 := main_#t~nondet503#1;havoc main_#t~nondet503#1;main_~ldvarg6~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1;main_~ldvarg8~0#1 := main_~tmp___9~0#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,918 INFO L272 TraceCheckUtils]: 26: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} call main_#t~ret505#1.base, main_#t~ret505#1.offset := ldv_zalloc(336); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,919 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2854#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset := main_#t~ret505#1.base, main_#t~ret505#1.offset;havoc main_#t~ret505#1.base, main_#t~ret505#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,921 INFO L272 TraceCheckUtils]: 32: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} call main_#t~ret506#1.base, main_#t~ret506#1.offset := ldv_zalloc(1); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,924 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2856#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset := main_#t~ret506#1.base, main_#t~ret506#1.offset;havoc main_#t~ret506#1.base, main_#t~ret506#1.offset;main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset := main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,926 INFO L272 TraceCheckUtils]: 38: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} call main_#t~ret507#1.base, main_#t~ret507#1.offset := ldv_zalloc(1); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,928 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10857#true} {10859#(<= 256 ~slip_maxdev~0)} #2858#return; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset := main_#t~ret507#1.base, main_#t~ret507#1.offset;havoc main_#t~ret507#1.base, main_#t~ret507#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;assume { :begin_inline_ldv_initialize } true; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume -2147483648 <= main_#t~nondet508#1 && main_#t~nondet508#1 <= 2147483647;main_~tmp___13~0#1 := main_#t~nondet508#1;havoc main_#t~nondet508#1;main_#t~switch509#1 := 0 == main_~tmp___13~0#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 1 == main_~tmp___13~0#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,930 INFO L290 TraceCheckUtils]: 47: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 2 == main_~tmp___13~0#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume main_#t~switch509#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet524#1 && main_#t~nondet524#1 <= 2147483647;main_~tmp___15~0#1 := main_#t~nondet524#1;havoc main_#t~nondet524#1;main_#t~switch525#1 := 0 == main_~tmp___15~0#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,931 INFO L290 TraceCheckUtils]: 50: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume !main_#t~switch525#1;main_#t~switch525#1 := main_#t~switch525#1 || 1 == main_~tmp___15~0#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume main_#t~switch525#1; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,932 INFO L290 TraceCheckUtils]: 52: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet434#1, slip_init_#t~nondet435#1, slip_init_#t~nondet436#1, slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset, slip_init_#t~nondet438#1, slip_init_#t~ret439#1, slip_init_#t~nondet440#1, slip_init_~status~0#1, slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset; {10859#(<= 256 ~slip_maxdev~0)} is VALID [2022-02-20 22:04:05,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {10859#(<= 256 ~slip_maxdev~0)} assume ~slip_maxdev~0 <= 3;~slip_maxdev~0 := 4; {10858#false} is VALID [2022-02-20 22:04:05,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {10858#false} havoc slip_init_#t~nondet434#1;havoc slip_init_#t~nondet435#1;havoc slip_init_#t~nondet436#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~ret33#1.base, kzalloc_#t~ret33#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset; {10858#false} is VALID [2022-02-20 22:04:05,936 INFO L272 TraceCheckUtils]: 55: Hoare triple {10858#false} call kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {10907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {10907#(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~ret31#1.base, __kmalloc_#t~ret31#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {10857#true} is VALID [2022-02-20 22:04:05,937 INFO L272 TraceCheckUtils]: 57: Hoare triple {10857#true} call __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset := ldv_malloc(__kmalloc_~size#1); {10907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {10907#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {10857#true} is VALID [2022-02-20 22:04:05,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {10857#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,937 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10857#true} {10857#true} #2776#return; {10857#true} is VALID [2022-02-20 22:04:05,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {10857#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset;havoc __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset; {10857#true} is VALID [2022-02-20 22:04:05,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {10857#true} #t~ret32#1.base, #t~ret32#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~ret32#1.base, #t~ret32#1.offset;havoc #t~ret32#1.base, #t~ret32#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {10857#true} is VALID [2022-02-20 22:04:05,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,938 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {10857#true} {10858#false} #2950#return; {10858#false} is VALID [2022-02-20 22:04:05,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {10858#false} kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset := kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset;havoc kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset; {10858#false} is VALID [2022-02-20 22:04:05,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {10858#false} slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset := slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset;havoc slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset; {10858#false} is VALID [2022-02-20 22:04:05,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {10858#false} assume 0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616;havoc slip_init_#t~nondet438#1;slip_init_#res#1 := -12; {10858#false} is VALID [2022-02-20 22:04:05,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {10858#false} main_#t~ret526#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret526#1 && main_#t~ret526#1 <= 2147483647;~ldv_retval_2~0 := main_#t~ret526#1;havoc main_#t~ret526#1; {10858#false} is VALID [2022-02-20 22:04:05,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {10858#false} assume !(0 != ~ldv_retval_2~0); {10858#false} is VALID [2022-02-20 22:04:05,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {10858#false} assume 0 == ~ldv_retval_2~0;~ldv_state_variable_0~0 := 2;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_target_type_3 } true;havoc ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset, ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset;havoc ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset; {10858#false} is VALID [2022-02-20 22:04:05,939 INFO L272 TraceCheckUtils]: 72: Hoare triple {10858#false} call ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset := ldv_zalloc(2696); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,940 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10857#true} {10858#false} #2954#return; {10858#false} is VALID [2022-02-20 22:04:05,940 INFO L290 TraceCheckUtils]: 77: Hoare triple {10858#false} ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset := ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset;havoc ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset;~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset := ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset; {10858#false} is VALID [2022-02-20 22:04:05,941 INFO L290 TraceCheckUtils]: 78: Hoare triple {10858#false} assume { :end_inline_ldv_target_type_3 } true;~ldv_state_variable_4~0 := 1;assume { :begin_inline_ldv_net_device_ops_4 } true;havoc ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset, ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset;havoc ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset; {10858#false} is VALID [2022-02-20 22:04:05,941 INFO L272 TraceCheckUtils]: 79: Hoare triple {10858#false} call ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset := ldv_zalloc(2496); {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:05,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {10906#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {10857#true} is VALID [2022-02-20 22:04:05,942 INFO L290 TraceCheckUtils]: 81: Hoare triple {10857#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {10857#true} is VALID [2022-02-20 22:04:05,942 INFO L290 TraceCheckUtils]: 82: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 22:04:05,942 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10857#true} {10858#false} #2956#return; {10858#false} is VALID [2022-02-20 22:04:05,942 INFO L290 TraceCheckUtils]: 84: Hoare triple {10858#false} ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset := ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset;havoc ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset;~sl_netdev_ops_group1~0.base, ~sl_netdev_ops_group1~0.offset := ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset; {10858#false} is VALID [2022-02-20 22:04:05,943 INFO L290 TraceCheckUtils]: 85: Hoare triple {10858#false} assume { :end_inline_ldv_net_device_ops_4 } true; {10858#false} is VALID [2022-02-20 22:04:05,943 INFO L290 TraceCheckUtils]: 86: Hoare triple {10858#false} assume -2147483648 <= main_#t~nondet508#1 && main_#t~nondet508#1 <= 2147483647;main_~tmp___13~0#1 := main_#t~nondet508#1;havoc main_#t~nondet508#1;main_#t~switch509#1 := 0 == main_~tmp___13~0#1; {10858#false} is VALID [2022-02-20 22:04:05,943 INFO L290 TraceCheckUtils]: 87: Hoare triple {10858#false} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 1 == main_~tmp___13~0#1; {10858#false} is VALID [2022-02-20 22:04:05,943 INFO L290 TraceCheckUtils]: 88: Hoare triple {10858#false} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 2 == main_~tmp___13~0#1; {10858#false} is VALID [2022-02-20 22:04:05,943 INFO L290 TraceCheckUtils]: 89: Hoare triple {10858#false} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 3 == main_~tmp___13~0#1; {10858#false} is VALID [2022-02-20 22:04:05,943 INFO L290 TraceCheckUtils]: 90: Hoare triple {10858#false} assume main_#t~switch509#1; {10858#false} is VALID [2022-02-20 22:04:05,943 INFO L290 TraceCheckUtils]: 91: Hoare triple {10858#false} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet527#1 && main_#t~nondet527#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet527#1;havoc main_#t~nondet527#1;main_#t~switch528#1 := 0 == main_~tmp___16~0#1; {10858#false} is VALID [2022-02-20 22:04:05,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {10858#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 1 == main_~tmp___16~0#1; {10858#false} is VALID [2022-02-20 22:04:05,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {10858#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 2 == main_~tmp___16~0#1; {10858#false} is VALID [2022-02-20 22:04:05,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {10858#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 3 == main_~tmp___16~0#1; {10858#false} is VALID [2022-02-20 22:04:05,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {10858#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 4 == main_~tmp___16~0#1; {10858#false} is VALID [2022-02-20 22:04:05,948 INFO L290 TraceCheckUtils]: 96: Hoare triple {10858#false} assume main_#t~switch528#1; {10858#false} is VALID [2022-02-20 22:04:05,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {10858#false} assume 1 == ~ldv_state_variable_3~0;assume { :begin_inline_ldv_slip_open_18 } true;ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset := ~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset;havoc ldv_slip_open_18_#res#1;havoc ldv_slip_open_18_#t~ret555#1, ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset, ldv_slip_open_18_~ldv_func_res~17#1, ldv_slip_open_18_~tmp~62#1;ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset := ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset;havoc ldv_slip_open_18_~ldv_func_res~17#1;havoc ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret305#1, slip_open_#t~mem306#1.base, slip_open_#t~mem306#1.offset, slip_open_#t~mem307#1.base, slip_open_#t~mem307#1.offset, slip_open_#t~mem308#1.base, slip_open_#t~mem308#1.offset, slip_open_#t~mem309#1, slip_open_#t~short310#1, slip_open_#t~ret311#1, slip_open_#t~ret312#1.base, slip_open_#t~ret312#1.offset, slip_open_#t~ret313#1, slip_open_#t~ret314#1.base, slip_open_#t~ret314#1.offset, slip_open_#t~mem315#1, slip_open_#t~ret316#1, slip_open_#t~ret317#1, slip_open_#t~mem318#1.base, slip_open_#t~mem318#1.offset, slip_open_#t~ret319#1, slip_open_#t~mem320#1, slip_open_#t~mem321#1, slip_open_#t~mem322#1, slip_open_#t~mem323#1, slip_open_#t~mem324#1.base, slip_open_#t~mem324#1.offset, slip_open_#t~mem325#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~30#1, slip_open_~tmp___0~12#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~30#1;havoc slip_open_~tmp___0~12#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~nondet558#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet558#1 && capable_#t~nondet558#1 <= 2147483647;capable_#res#1 := capable_#t~nondet558#1;havoc capable_#t~nondet558#1; {10858#false} is VALID [2022-02-20 22:04:05,950 INFO L290 TraceCheckUtils]: 98: Hoare triple {10858#false} slip_open_#t~ret305#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret305#1 && slip_open_#t~ret305#1 <= 2147483647;slip_open_~tmp~30#1 := slip_open_#t~ret305#1;havoc slip_open_#t~ret305#1; {10858#false} is VALID [2022-02-20 22:04:05,951 INFO L290 TraceCheckUtils]: 99: Hoare triple {10858#false} assume 0 == slip_open_~tmp~30#1;slip_open_#res#1 := -1; {10858#false} is VALID [2022-02-20 22:04:05,953 INFO L290 TraceCheckUtils]: 100: Hoare triple {10858#false} ldv_slip_open_18_#t~ret555#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_18_#t~ret555#1 && ldv_slip_open_18_#t~ret555#1 <= 2147483647;ldv_slip_open_18_~tmp~62#1 := ldv_slip_open_18_#t~ret555#1;havoc ldv_slip_open_18_#t~ret555#1;ldv_slip_open_18_~ldv_func_res~17#1 := ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_18_~ldv_func_res~17#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; {10858#false} is VALID [2022-02-20 22:04:05,953 INFO L290 TraceCheckUtils]: 101: Hoare triple {10858#false} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0); {10858#false} is VALID [2022-02-20 22:04:05,953 INFO L272 TraceCheckUtils]: 102: Hoare triple {10858#false} call ldv_error(); {10858#false} is VALID [2022-02-20 22:04:05,953 INFO L290 TraceCheckUtils]: 103: Hoare triple {10858#false} assume !false; {10858#false} is VALID [2022-02-20 22:04:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 22:04:05,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:04:05,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280865017] [2022-02-20 22:04:05,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280865017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:04:05,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:04:05,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:04:05,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712861794] [2022-02-20 22:04:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:04:05,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-02-20 22:04:05,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:04:05,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 22:04:06,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:06,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:04:06,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:04:06,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:04:06,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:04:06,023 INFO L87 Difference]: Start difference. First operand 1604 states and 2323 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 22:04:09,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:04:11,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:04:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:16,429 INFO L93 Difference]: Finished difference Result 3374 states and 4945 transitions. [2022-02-20 22:04:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:04:16,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-02-20 22:04:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:04:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 22:04:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3246 transitions. [2022-02-20 22:04:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 22:04:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3246 transitions. [2022-02-20 22:04:16,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3246 transitions. [2022-02-20 22:04:18,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3246 edges. 3246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:19,131 INFO L225 Difference]: With dead ends: 3374 [2022-02-20 22:04:19,132 INFO L226 Difference]: Without dead ends: 1794 [2022-02-20 22:04:19,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 22:04:19,136 INFO L933 BasicCegarLoop]: 1472 mSDtfsCounter, 1822 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 555 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-02-20 22:04:19,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1954 Valid, 2556 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 764 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-02-20 22:04:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2022-02-20 22:04:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1604. [2022-02-20 22:04:19,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:04:19,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1794 states. Second operand has 1604 states, 1182 states have (on average 1.401015228426396) internal successors, (1656), 1215 states have internal predecessors, (1656), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:19,421 INFO L74 IsIncluded]: Start isIncluded. First operand 1794 states. Second operand has 1604 states, 1182 states have (on average 1.401015228426396) internal successors, (1656), 1215 states have internal predecessors, (1656), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:19,423 INFO L87 Difference]: Start difference. First operand 1794 states. Second operand has 1604 states, 1182 states have (on average 1.401015228426396) internal successors, (1656), 1215 states have internal predecessors, (1656), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:19,528 INFO L93 Difference]: Finished difference Result 1794 states and 2652 transitions. [2022-02-20 22:04:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2652 transitions. [2022-02-20 22:04:19,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:19,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:19,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 1604 states, 1182 states have (on average 1.401015228426396) internal successors, (1656), 1215 states have internal predecessors, (1656), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) Second operand 1794 states. [2022-02-20 22:04:19,553 INFO L87 Difference]: Start difference. First operand has 1604 states, 1182 states have (on average 1.401015228426396) internal successors, (1656), 1215 states have internal predecessors, (1656), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) Second operand 1794 states. [2022-02-20 22:04:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:19,666 INFO L93 Difference]: Finished difference Result 1794 states and 2652 transitions. [2022-02-20 22:04:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2652 transitions. [2022-02-20 22:04:19,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:19,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:19,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:04:19,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:04:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1182 states have (on average 1.401015228426396) internal successors, (1656), 1215 states have internal predecessors, (1656), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2321 transitions. [2022-02-20 22:04:19,803 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2321 transitions. Word has length 104 [2022-02-20 22:04:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:04:19,804 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2321 transitions. [2022-02-20 22:04:19,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 22:04:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2321 transitions. [2022-02-20 22:04:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 22:04:19,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:04:19,808 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:04:19,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:04:19,809 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:04:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:04:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash -480171833, now seen corresponding path program 1 times [2022-02-20 22:04:19,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:04:19,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791567781] [2022-02-20 22:04:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:04:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:04:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:19,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:04:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:19,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:19,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:19,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:19,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2846#return; {21292#true} is VALID [2022-02-20 22:04:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:04:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:19,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:19,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:19,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:19,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2848#return; {21292#true} is VALID [2022-02-20 22:04:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:04:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:19,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:19,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:19,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:19,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2850#return; {21292#true} is VALID [2022-02-20 22:04:19,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:04:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:19,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:19,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:19,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:19,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2852#return; {21292#true} is VALID [2022-02-20 22:04:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:04:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:19,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:19,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:19,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:19,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2854#return; {21292#true} is VALID [2022-02-20 22:04:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 22:04:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:19,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:19,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:19,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:19,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2856#return; {21292#true} is VALID [2022-02-20 22:04:19,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:04:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:20,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2858#return; {21292#true} is VALID [2022-02-20 22:04:20,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 22:04:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:04:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:20,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {21343#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {21292#true} is VALID [2022-02-20 22:04:20,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21292#true} #2776#return; {21292#true} is VALID [2022-02-20 22:04:20,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {21343#(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~ret31#1.base, __kmalloc_#t~ret31#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {21292#true} is VALID [2022-02-20 22:04:20,029 INFO L272 TraceCheckUtils]: 1: Hoare triple {21292#true} call __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset := ldv_malloc(__kmalloc_~size#1); {21343#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {21343#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {21292#true} is VALID [2022-02-20 22:04:20,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {21292#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,030 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21292#true} {21292#true} #2776#return; {21292#true} is VALID [2022-02-20 22:04:20,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {21292#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset;havoc __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {21292#true} #t~ret32#1.base, #t~ret32#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~ret32#1.base, #t~ret32#1.offset;havoc #t~ret32#1.base, #t~ret32#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,030 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {21292#true} {21292#true} #2950#return; {21292#true} is VALID [2022-02-20 22:04:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-02-20 22:04:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:20,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21293#false} #2954#return; {21293#false} is VALID [2022-02-20 22:04:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-02-20 22:04:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:20,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21292#true} {21293#false} #2956#return; {21293#false} is VALID [2022-02-20 22:04:20,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {21292#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(74, 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(5, 16);call write~init~int(115, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(0, 16, 4, 1);call #Ultimate.allocInit(79, 17);call #Ultimate.allocInit(22, 18);call #Ultimate.allocInit(72, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(37, 23);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(62, 25);~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_state_2~0 := 0;~ldv_state_variable_0~0 := 0;~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2~0.base, ~ldv_timer_list_2~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~sl_netdev_ops_group1~0.base, ~sl_netdev_ops_group1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 26, 0;call #Ultimate.allocInit(280, 26);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 := 27, 0;call #Ultimate.allocInit(144, 27);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(16, 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_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0; {21292#true} is VALID [2022-02-20 22:04:20,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {21292#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~ret495#1.base, main_#t~ret495#1.offset, main_#t~nondet496#1, main_#t~ret497#1.base, main_#t~ret497#1.offset, main_#t~nondet498#1, main_#t~nondet499#1, main_#t~ret500#1.base, main_#t~ret500#1.offset, main_#t~nondet501#1, main_#t~nondet502#1, main_#t~nondet503#1, main_#t~nondet504#1, main_#t~ret505#1.base, main_#t~ret505#1.offset, main_#t~ret506#1.base, main_#t~ret506#1.offset, main_#t~ret507#1.base, main_#t~ret507#1.offset, main_#t~nondet508#1, main_#t~switch509#1, main_#t~nondet510#1, main_#t~switch511#1, main_#t~ret512#1, main_#t~ret513#1, main_#t~ret514#1, main_#t~ret515#1, main_#t~ret516#1, main_#t~ret517#1, main_#t~ret518#1, main_#t~ret519#1, main_#t~ret520#1.base, main_#t~ret520#1.offset, main_#t~ret521#1.base, main_#t~ret521#1.offset, main_#t~ret522#1.base, main_#t~ret522#1.offset, main_#t~ret523#1, main_#t~nondet524#1, main_#t~switch525#1, main_#t~ret526#1, main_#t~nondet527#1, main_#t~switch528#1, main_#t~ret529#1, main_#t~ret530#1, main_#t~ret531#1, main_#t~ret532#1, main_#t~ret533#1, main_#t~ret534#1, main_#t~ret535#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~44#1.base, main_~tmp~44#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset, main_~ldvarg3~0#1, main_~tmp___1~13#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset, main_~ldvarg2~0#1, main_~tmp___3~4#1, main_~ldvarg11~0#1, main_~tmp___4~3#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~ldvarg12~0#1, main_~tmp___6~1#1, main_~ldvarg5~0#1, main_~tmp___7~1#1, main_~ldvarg6~0#1, main_~tmp___8~0#1, main_~ldvarg8~0#1, main_~tmp___9~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset, main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset, main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset, main_~tmp___13~0#1, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~44#1.base, main_~tmp~44#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___3~4#1;havoc main_~ldvarg11~0#1;havoc main_~tmp___4~3#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~ldvarg12~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___7~1#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg8~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset;havoc main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset;havoc main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;havoc main_~tmp___13~0#1;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1; {21292#true} is VALID [2022-02-20 22:04:20,049 INFO L272 TraceCheckUtils]: 2: Hoare triple {21292#true} call main_#t~ret494#1.base, main_#t~ret494#1.offset := ldv_zalloc(240); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,050 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {21292#true} {21292#true} #2846#return; {21292#true} is VALID [2022-02-20 22:04:20,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {21292#true} main_~tmp~44#1.base, main_~tmp~44#1.offset := main_#t~ret494#1.base, main_#t~ret494#1.offset;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~44#1.base, main_~tmp~44#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,050 INFO L272 TraceCheckUtils]: 8: Hoare triple {21292#true} call main_#t~ret495#1.base, main_#t~ret495#1.offset := ldv_zalloc(40); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,052 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21292#true} {21292#true} #2848#return; {21292#true} is VALID [2022-02-20 22:04:20,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {21292#true} main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset := main_#t~ret495#1.base, main_#t~ret495#1.offset;havoc main_#t~ret495#1.base, main_#t~ret495#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;assume -2147483648 <= main_#t~nondet496#1 && main_#t~nondet496#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet496#1;havoc main_#t~nondet496#1;main_~ldvarg3~0#1 := main_~tmp___1~13#1; {21292#true} is VALID [2022-02-20 22:04:20,052 INFO L272 TraceCheckUtils]: 14: Hoare triple {21292#true} call main_#t~ret497#1.base, main_#t~ret497#1.offset := ldv_zalloc(184); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,053 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21292#true} {21292#true} #2850#return; {21292#true} is VALID [2022-02-20 22:04:20,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {21292#true} main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset := main_#t~ret497#1.base, main_#t~ret497#1.offset;havoc main_#t~ret497#1.base, main_#t~ret497#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;assume -2147483648 <= main_#t~nondet498#1 && main_#t~nondet498#1 <= 2147483647;main_~tmp___3~4#1 := main_#t~nondet498#1;havoc main_#t~nondet498#1;main_~ldvarg2~0#1 := main_~tmp___3~4#1;main_~tmp___4~3#1 := main_#t~nondet499#1;havoc main_#t~nondet499#1;main_~ldvarg11~0#1 := main_~tmp___4~3#1; {21292#true} is VALID [2022-02-20 22:04:20,054 INFO L272 TraceCheckUtils]: 20: Hoare triple {21292#true} call main_#t~ret500#1.base, main_#t~ret500#1.offset := ldv_zalloc(336); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,054 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21292#true} {21292#true} #2852#return; {21292#true} is VALID [2022-02-20 22:04:20,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {21292#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret500#1.base, main_#t~ret500#1.offset;havoc main_#t~ret500#1.base, main_#t~ret500#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;main_~tmp___6~1#1 := main_#t~nondet501#1;havoc main_#t~nondet501#1;main_~ldvarg12~0#1 := main_~tmp___6~1#1;main_~tmp___7~1#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1;main_~ldvarg5~0#1 := main_~tmp___7~1#1;main_~tmp___8~0#1 := main_#t~nondet503#1;havoc main_#t~nondet503#1;main_~ldvarg6~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1;main_~ldvarg8~0#1 := main_~tmp___9~0#1; {21292#true} is VALID [2022-02-20 22:04:20,055 INFO L272 TraceCheckUtils]: 26: Hoare triple {21292#true} call main_#t~ret505#1.base, main_#t~ret505#1.offset := ldv_zalloc(336); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,059 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21292#true} {21292#true} #2854#return; {21292#true} is VALID [2022-02-20 22:04:20,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {21292#true} main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset := main_#t~ret505#1.base, main_#t~ret505#1.offset;havoc main_#t~ret505#1.base, main_#t~ret505#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,060 INFO L272 TraceCheckUtils]: 32: Hoare triple {21292#true} call main_#t~ret506#1.base, main_#t~ret506#1.offset := ldv_zalloc(1); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,061 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21292#true} {21292#true} #2856#return; {21292#true} is VALID [2022-02-20 22:04:20,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {21292#true} main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset := main_#t~ret506#1.base, main_#t~ret506#1.offset;havoc main_#t~ret506#1.base, main_#t~ret506#1.offset;main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset := main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,062 INFO L272 TraceCheckUtils]: 38: Hoare triple {21292#true} call main_#t~ret507#1.base, main_#t~ret507#1.offset := ldv_zalloc(1); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,062 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21292#true} {21292#true} #2858#return; {21292#true} is VALID [2022-02-20 22:04:20,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {21292#true} main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset := main_#t~ret507#1.base, main_#t~ret507#1.offset;havoc main_#t~ret507#1.base, main_#t~ret507#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;assume { :begin_inline_ldv_initialize } true; {21292#true} is VALID [2022-02-20 22:04:20,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {21292#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {21292#true} is VALID [2022-02-20 22:04:20,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {21292#true} assume -2147483648 <= main_#t~nondet508#1 && main_#t~nondet508#1 <= 2147483647;main_~tmp___13~0#1 := main_#t~nondet508#1;havoc main_#t~nondet508#1;main_#t~switch509#1 := 0 == main_~tmp___13~0#1; {21292#true} is VALID [2022-02-20 22:04:20,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {21292#true} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 1 == main_~tmp___13~0#1; {21292#true} is VALID [2022-02-20 22:04:20,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {21292#true} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 2 == main_~tmp___13~0#1; {21292#true} is VALID [2022-02-20 22:04:20,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {21292#true} assume main_#t~switch509#1; {21292#true} is VALID [2022-02-20 22:04:20,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {21292#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet524#1 && main_#t~nondet524#1 <= 2147483647;main_~tmp___15~0#1 := main_#t~nondet524#1;havoc main_#t~nondet524#1;main_#t~switch525#1 := 0 == main_~tmp___15~0#1; {21292#true} is VALID [2022-02-20 22:04:20,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {21292#true} assume !main_#t~switch525#1;main_#t~switch525#1 := main_#t~switch525#1 || 1 == main_~tmp___15~0#1; {21292#true} is VALID [2022-02-20 22:04:20,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {21292#true} assume main_#t~switch525#1; {21292#true} is VALID [2022-02-20 22:04:20,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {21292#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet434#1, slip_init_#t~nondet435#1, slip_init_#t~nondet436#1, slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset, slip_init_#t~nondet438#1, slip_init_#t~ret439#1, slip_init_#t~nondet440#1, slip_init_~status~0#1, slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {21292#true} assume !(~slip_maxdev~0 <= 3); {21292#true} is VALID [2022-02-20 22:04:20,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {21292#true} havoc slip_init_#t~nondet434#1;havoc slip_init_#t~nondet435#1;havoc slip_init_#t~nondet436#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~ret33#1.base, kzalloc_#t~ret33#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,065 INFO L272 TraceCheckUtils]: 55: Hoare triple {21292#true} call kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {21343#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {21343#(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~ret31#1.base, __kmalloc_#t~ret31#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {21292#true} is VALID [2022-02-20 22:04:20,066 INFO L272 TraceCheckUtils]: 57: Hoare triple {21292#true} call __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset := ldv_malloc(__kmalloc_~size#1); {21343#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {21343#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {21292#true} is VALID [2022-02-20 22:04:20,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {21292#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,066 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21292#true} {21292#true} #2776#return; {21292#true} is VALID [2022-02-20 22:04:20,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {21292#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset;havoc __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {21292#true} #t~ret32#1.base, #t~ret32#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~ret32#1.base, #t~ret32#1.offset;havoc #t~ret32#1.base, #t~ret32#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,067 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {21292#true} {21292#true} #2950#return; {21292#true} is VALID [2022-02-20 22:04:20,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {21292#true} kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset := kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset;havoc kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {21292#true} slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset := slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset;havoc slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset; {21292#true} is VALID [2022-02-20 22:04:20,068 INFO L290 TraceCheckUtils]: 68: Hoare triple {21292#true} assume 0 == (~slip_devs~0.base + ~slip_devs~0.offset) % 18446744073709551616;havoc slip_init_#t~nondet438#1;slip_init_#res#1 := -12; {21332#(<= (+ |ULTIMATE.start_slip_init_#res#1| 12) 0)} is VALID [2022-02-20 22:04:20,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {21332#(<= (+ |ULTIMATE.start_slip_init_#res#1| 12) 0)} main_#t~ret526#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret526#1 && main_#t~ret526#1 <= 2147483647;~ldv_retval_2~0 := main_#t~ret526#1;havoc main_#t~ret526#1; {21333#(<= (+ ~ldv_retval_2~0 12) 0)} is VALID [2022-02-20 22:04:20,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {21333#(<= (+ ~ldv_retval_2~0 12) 0)} assume !(0 != ~ldv_retval_2~0); {21293#false} is VALID [2022-02-20 22:04:20,070 INFO L290 TraceCheckUtils]: 71: Hoare triple {21293#false} assume 0 == ~ldv_retval_2~0;~ldv_state_variable_0~0 := 2;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_target_type_3 } true;havoc ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset, ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset;havoc ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset; {21293#false} is VALID [2022-02-20 22:04:20,073 INFO L272 TraceCheckUtils]: 72: Hoare triple {21293#false} call ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset := ldv_zalloc(2696); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,074 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21292#true} {21293#false} #2954#return; {21293#false} is VALID [2022-02-20 22:04:20,074 INFO L290 TraceCheckUtils]: 77: Hoare triple {21293#false} ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset := ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset;havoc ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset;~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset := ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset; {21293#false} is VALID [2022-02-20 22:04:20,075 INFO L290 TraceCheckUtils]: 78: Hoare triple {21293#false} assume { :end_inline_ldv_target_type_3 } true;~ldv_state_variable_4~0 := 1;assume { :begin_inline_ldv_net_device_ops_4 } true;havoc ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset, ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset;havoc ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset; {21293#false} is VALID [2022-02-20 22:04:20,075 INFO L272 TraceCheckUtils]: 79: Hoare triple {21293#false} call ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset := ldv_zalloc(2496); {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:20,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {21342#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {21292#true} is VALID [2022-02-20 22:04:20,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {21292#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {21292#true} is VALID [2022-02-20 22:04:20,076 INFO L290 TraceCheckUtils]: 82: Hoare triple {21292#true} assume true; {21292#true} is VALID [2022-02-20 22:04:20,076 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {21292#true} {21293#false} #2956#return; {21293#false} is VALID [2022-02-20 22:04:20,076 INFO L290 TraceCheckUtils]: 84: Hoare triple {21293#false} ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset := ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset;havoc ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset;~sl_netdev_ops_group1~0.base, ~sl_netdev_ops_group1~0.offset := ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset; {21293#false} is VALID [2022-02-20 22:04:20,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {21293#false} assume { :end_inline_ldv_net_device_ops_4 } true; {21293#false} is VALID [2022-02-20 22:04:20,077 INFO L290 TraceCheckUtils]: 86: Hoare triple {21293#false} assume -2147483648 <= main_#t~nondet508#1 && main_#t~nondet508#1 <= 2147483647;main_~tmp___13~0#1 := main_#t~nondet508#1;havoc main_#t~nondet508#1;main_#t~switch509#1 := 0 == main_~tmp___13~0#1; {21293#false} is VALID [2022-02-20 22:04:20,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {21293#false} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 1 == main_~tmp___13~0#1; {21293#false} is VALID [2022-02-20 22:04:20,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {21293#false} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 2 == main_~tmp___13~0#1; {21293#false} is VALID [2022-02-20 22:04:20,078 INFO L290 TraceCheckUtils]: 89: Hoare triple {21293#false} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 3 == main_~tmp___13~0#1; {21293#false} is VALID [2022-02-20 22:04:20,078 INFO L290 TraceCheckUtils]: 90: Hoare triple {21293#false} assume main_#t~switch509#1; {21293#false} is VALID [2022-02-20 22:04:20,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {21293#false} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet527#1 && main_#t~nondet527#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet527#1;havoc main_#t~nondet527#1;main_#t~switch528#1 := 0 == main_~tmp___16~0#1; {21293#false} is VALID [2022-02-20 22:04:20,078 INFO L290 TraceCheckUtils]: 92: Hoare triple {21293#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 1 == main_~tmp___16~0#1; {21293#false} is VALID [2022-02-20 22:04:20,078 INFO L290 TraceCheckUtils]: 93: Hoare triple {21293#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 2 == main_~tmp___16~0#1; {21293#false} is VALID [2022-02-20 22:04:20,078 INFO L290 TraceCheckUtils]: 94: Hoare triple {21293#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 3 == main_~tmp___16~0#1; {21293#false} is VALID [2022-02-20 22:04:20,078 INFO L290 TraceCheckUtils]: 95: Hoare triple {21293#false} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 4 == main_~tmp___16~0#1; {21293#false} is VALID [2022-02-20 22:04:20,079 INFO L290 TraceCheckUtils]: 96: Hoare triple {21293#false} assume main_#t~switch528#1; {21293#false} is VALID [2022-02-20 22:04:20,079 INFO L290 TraceCheckUtils]: 97: Hoare triple {21293#false} assume 1 == ~ldv_state_variable_3~0;assume { :begin_inline_ldv_slip_open_18 } true;ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset := ~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset;havoc ldv_slip_open_18_#res#1;havoc ldv_slip_open_18_#t~ret555#1, ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset, ldv_slip_open_18_~ldv_func_res~17#1, ldv_slip_open_18_~tmp~62#1;ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset := ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset;havoc ldv_slip_open_18_~ldv_func_res~17#1;havoc ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret305#1, slip_open_#t~mem306#1.base, slip_open_#t~mem306#1.offset, slip_open_#t~mem307#1.base, slip_open_#t~mem307#1.offset, slip_open_#t~mem308#1.base, slip_open_#t~mem308#1.offset, slip_open_#t~mem309#1, slip_open_#t~short310#1, slip_open_#t~ret311#1, slip_open_#t~ret312#1.base, slip_open_#t~ret312#1.offset, slip_open_#t~ret313#1, slip_open_#t~ret314#1.base, slip_open_#t~ret314#1.offset, slip_open_#t~mem315#1, slip_open_#t~ret316#1, slip_open_#t~ret317#1, slip_open_#t~mem318#1.base, slip_open_#t~mem318#1.offset, slip_open_#t~ret319#1, slip_open_#t~mem320#1, slip_open_#t~mem321#1, slip_open_#t~mem322#1, slip_open_#t~mem323#1, slip_open_#t~mem324#1.base, slip_open_#t~mem324#1.offset, slip_open_#t~mem325#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~30#1, slip_open_~tmp___0~12#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~30#1;havoc slip_open_~tmp___0~12#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~nondet558#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet558#1 && capable_#t~nondet558#1 <= 2147483647;capable_#res#1 := capable_#t~nondet558#1;havoc capable_#t~nondet558#1; {21293#false} is VALID [2022-02-20 22:04:20,079 INFO L290 TraceCheckUtils]: 98: Hoare triple {21293#false} slip_open_#t~ret305#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret305#1 && slip_open_#t~ret305#1 <= 2147483647;slip_open_~tmp~30#1 := slip_open_#t~ret305#1;havoc slip_open_#t~ret305#1; {21293#false} is VALID [2022-02-20 22:04:20,079 INFO L290 TraceCheckUtils]: 99: Hoare triple {21293#false} assume 0 == slip_open_~tmp~30#1;slip_open_#res#1 := -1; {21293#false} is VALID [2022-02-20 22:04:20,079 INFO L290 TraceCheckUtils]: 100: Hoare triple {21293#false} ldv_slip_open_18_#t~ret555#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_18_#t~ret555#1 && ldv_slip_open_18_#t~ret555#1 <= 2147483647;ldv_slip_open_18_~tmp~62#1 := ldv_slip_open_18_#t~ret555#1;havoc ldv_slip_open_18_#t~ret555#1;ldv_slip_open_18_~ldv_func_res~17#1 := ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_18_~ldv_func_res~17#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; {21293#false} is VALID [2022-02-20 22:04:20,079 INFO L290 TraceCheckUtils]: 101: Hoare triple {21293#false} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0); {21293#false} is VALID [2022-02-20 22:04:20,079 INFO L272 TraceCheckUtils]: 102: Hoare triple {21293#false} call ldv_error(); {21293#false} is VALID [2022-02-20 22:04:20,080 INFO L290 TraceCheckUtils]: 103: Hoare triple {21293#false} assume !false; {21293#false} is VALID [2022-02-20 22:04:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 22:04:20,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:04:20,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791567781] [2022-02-20 22:04:20,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791567781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:04:20,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:04:20,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:04:20,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453700807] [2022-02-20 22:04:20,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:04:20,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-02-20 22:04:20,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:04:20,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-20 22:04:20,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:20,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:04:20,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:04:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:04:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:04:20,135 INFO L87 Difference]: Start difference. First operand 1604 states and 2321 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-20 22:04:28,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:04:29,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:04:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:36,248 INFO L93 Difference]: Finished difference Result 3378 states and 4945 transitions. [2022-02-20 22:04:36,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 22:04:36,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-02-20 22:04:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:04:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-20 22:04:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3246 transitions. [2022-02-20 22:04:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-20 22:04:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3246 transitions. [2022-02-20 22:04:36,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 3246 transitions. [2022-02-20 22:04:38,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3246 edges. 3246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:38,718 INFO L225 Difference]: With dead ends: 3378 [2022-02-20 22:04:38,718 INFO L226 Difference]: Without dead ends: 1794 [2022-02-20 22:04:38,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 22:04:38,723 INFO L933 BasicCegarLoop]: 1485 mSDtfsCounter, 558 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 4376 SdHoareTripleChecker+Invalid, 2477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-02-20 22:04:38,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 4376 Invalid, 2477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-02-20 22:04:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2022-02-20 22:04:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1604. [2022-02-20 22:04:39,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:04:39,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1794 states. Second operand has 1604 states, 1182 states have (on average 1.3993231810490694) internal successors, (1654), 1215 states have internal predecessors, (1654), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:39,070 INFO L74 IsIncluded]: Start isIncluded. First operand 1794 states. Second operand has 1604 states, 1182 states have (on average 1.3993231810490694) internal successors, (1654), 1215 states have internal predecessors, (1654), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:39,072 INFO L87 Difference]: Start difference. First operand 1794 states. Second operand has 1604 states, 1182 states have (on average 1.3993231810490694) internal successors, (1654), 1215 states have internal predecessors, (1654), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:39,178 INFO L93 Difference]: Finished difference Result 1794 states and 2650 transitions. [2022-02-20 22:04:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2650 transitions. [2022-02-20 22:04:39,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:39,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:39,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 1604 states, 1182 states have (on average 1.3993231810490694) internal successors, (1654), 1215 states have internal predecessors, (1654), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) Second operand 1794 states. [2022-02-20 22:04:39,191 INFO L87 Difference]: Start difference. First operand has 1604 states, 1182 states have (on average 1.3993231810490694) internal successors, (1654), 1215 states have internal predecessors, (1654), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) Second operand 1794 states. [2022-02-20 22:04:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:39,325 INFO L93 Difference]: Finished difference Result 1794 states and 2650 transitions. [2022-02-20 22:04:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2650 transitions. [2022-02-20 22:04:39,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:39,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:39,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:04:39,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:04:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1182 states have (on average 1.3993231810490694) internal successors, (1654), 1215 states have internal predecessors, (1654), 333 states have call successors, (333), 89 states have call predecessors, (333), 88 states have return successors, (332), 329 states have call predecessors, (332), 332 states have call successors, (332) [2022-02-20 22:04:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2319 transitions. [2022-02-20 22:04:39,449 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2319 transitions. Word has length 104 [2022-02-20 22:04:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:04:39,450 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2319 transitions. [2022-02-20 22:04:39,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-20 22:04:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2319 transitions. [2022-02-20 22:04:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-20 22:04:39,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:04:39,455 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:04:39,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:04:39,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:04:39,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:04:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash -899814917, now seen corresponding path program 1 times [2022-02-20 22:04:39,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:04:39,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077150537] [2022-02-20 22:04:39,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:04:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:04:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:04:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2846#return; {31731#true} is VALID [2022-02-20 22:04:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:04:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2848#return; {31731#true} is VALID [2022-02-20 22:04:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:04:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2850#return; {31731#true} is VALID [2022-02-20 22:04:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:04:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2852#return; {31731#true} is VALID [2022-02-20 22:04:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:04:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2854#return; {31731#true} is VALID [2022-02-20 22:04:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 22:04:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2856#return; {31731#true} is VALID [2022-02-20 22:04:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:04:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2858#return; {31731#true} is VALID [2022-02-20 22:04:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 22:04:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:04:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {31782#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {31731#true} is VALID [2022-02-20 22:04:39,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2776#return; {31731#true} is VALID [2022-02-20 22:04:39,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {31782#(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~ret31#1.base, __kmalloc_#t~ret31#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {31731#true} is VALID [2022-02-20 22:04:39,642 INFO L272 TraceCheckUtils]: 1: Hoare triple {31731#true} call __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset := ldv_malloc(__kmalloc_~size#1); {31782#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {31782#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {31731#true} is VALID [2022-02-20 22:04:39,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {31731#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,643 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31731#true} {31731#true} #2776#return; {31731#true} is VALID [2022-02-20 22:04:39,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {31731#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset;havoc __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {31731#true} #t~ret32#1.base, #t~ret32#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~ret32#1.base, #t~ret32#1.offset;havoc #t~ret32#1.base, #t~ret32#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,644 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {31731#true} {31731#true} #2950#return; {31731#true} is VALID [2022-02-20 22:04:39,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-02-20 22:04:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2954#return; {31731#true} is VALID [2022-02-20 22:04:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-20 22:04:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:39,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #2956#return; {31731#true} is VALID [2022-02-20 22:04:39,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {31731#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(74, 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(5, 16);call write~init~int(115, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(0, 16, 4, 1);call #Ultimate.allocInit(79, 17);call #Ultimate.allocInit(22, 18);call #Ultimate.allocInit(72, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(37, 23);call #Ultimate.allocInit(54, 24);call #Ultimate.allocInit(62, 25);~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_state_2~0 := 0;~ldv_state_variable_0~0 := 0;~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2~0.base, ~ldv_timer_list_2~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~sl_netdev_ops_group1~0.base, ~sl_netdev_ops_group1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~slip_devs~0.base, ~slip_devs~0.offset := 0, 0;~slip_maxdev~0 := 256;~#sl_netdev_ops~0.base, ~#sl_netdev_ops~0.offset := 26, 0;call #Ultimate.allocInit(280, 26);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 := 27, 0;call #Ultimate.allocInit(144, 27);call write~init~int(21507, ~#sl_ldisc~0.base, ~#sl_ldisc~0.offset, 4);call write~init~$Pointer$(16, 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_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0; {31731#true} is VALID [2022-02-20 22:04:39,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {31731#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset, main_#t~ret495#1.base, main_#t~ret495#1.offset, main_#t~nondet496#1, main_#t~ret497#1.base, main_#t~ret497#1.offset, main_#t~nondet498#1, main_#t~nondet499#1, main_#t~ret500#1.base, main_#t~ret500#1.offset, main_#t~nondet501#1, main_#t~nondet502#1, main_#t~nondet503#1, main_#t~nondet504#1, main_#t~ret505#1.base, main_#t~ret505#1.offset, main_#t~ret506#1.base, main_#t~ret506#1.offset, main_#t~ret507#1.base, main_#t~ret507#1.offset, main_#t~nondet508#1, main_#t~switch509#1, main_#t~nondet510#1, main_#t~switch511#1, main_#t~ret512#1, main_#t~ret513#1, main_#t~ret514#1, main_#t~ret515#1, main_#t~ret516#1, main_#t~ret517#1, main_#t~ret518#1, main_#t~ret519#1, main_#t~ret520#1.base, main_#t~ret520#1.offset, main_#t~ret521#1.base, main_#t~ret521#1.offset, main_#t~ret522#1.base, main_#t~ret522#1.offset, main_#t~ret523#1, main_#t~nondet524#1, main_#t~switch525#1, main_#t~ret526#1, main_#t~nondet527#1, main_#t~switch528#1, main_#t~ret529#1, main_#t~ret530#1, main_#t~ret531#1, main_#t~ret532#1, main_#t~ret533#1, main_#t~ret534#1, main_#t~ret535#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~44#1.base, main_~tmp~44#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset, main_~ldvarg3~0#1, main_~tmp___1~13#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset, main_~ldvarg2~0#1, main_~tmp___3~4#1, main_~ldvarg11~0#1, main_~tmp___4~3#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~ldvarg12~0#1, main_~tmp___6~1#1, main_~ldvarg5~0#1, main_~tmp___7~1#1, main_~ldvarg6~0#1, main_~tmp___8~0#1, main_~ldvarg8~0#1, main_~tmp___9~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset, main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset, main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset, main_~tmp___13~0#1, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~44#1.base, main_~tmp~44#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___3~4#1;havoc main_~ldvarg11~0#1;havoc main_~tmp___4~3#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~ldvarg12~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___7~1#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg8~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset;havoc main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset;havoc main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;havoc main_~tmp___13~0#1;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1; {31731#true} is VALID [2022-02-20 22:04:39,657 INFO L272 TraceCheckUtils]: 2: Hoare triple {31731#true} call main_#t~ret494#1.base, main_#t~ret494#1.offset := ldv_zalloc(240); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,658 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31731#true} {31731#true} #2846#return; {31731#true} is VALID [2022-02-20 22:04:39,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {31731#true} main_~tmp~44#1.base, main_~tmp~44#1.offset := main_#t~ret494#1.base, main_#t~ret494#1.offset;havoc main_#t~ret494#1.base, main_#t~ret494#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~44#1.base, main_~tmp~44#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,659 INFO L272 TraceCheckUtils]: 8: Hoare triple {31731#true} call main_#t~ret495#1.base, main_#t~ret495#1.offset := ldv_zalloc(40); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,659 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {31731#true} {31731#true} #2848#return; {31731#true} is VALID [2022-02-20 22:04:39,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {31731#true} main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset := main_#t~ret495#1.base, main_#t~ret495#1.offset;havoc main_#t~ret495#1.base, main_#t~ret495#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~22#1.base, main_~tmp___0~22#1.offset;assume -2147483648 <= main_#t~nondet496#1 && main_#t~nondet496#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet496#1;havoc main_#t~nondet496#1;main_~ldvarg3~0#1 := main_~tmp___1~13#1; {31731#true} is VALID [2022-02-20 22:04:39,660 INFO L272 TraceCheckUtils]: 14: Hoare triple {31731#true} call main_#t~ret497#1.base, main_#t~ret497#1.offset := ldv_zalloc(184); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,660 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31731#true} {31731#true} #2850#return; {31731#true} is VALID [2022-02-20 22:04:39,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {31731#true} main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset := main_#t~ret497#1.base, main_#t~ret497#1.offset;havoc main_#t~ret497#1.base, main_#t~ret497#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___2~9#1.base, main_~tmp___2~9#1.offset;assume -2147483648 <= main_#t~nondet498#1 && main_#t~nondet498#1 <= 2147483647;main_~tmp___3~4#1 := main_#t~nondet498#1;havoc main_#t~nondet498#1;main_~ldvarg2~0#1 := main_~tmp___3~4#1;main_~tmp___4~3#1 := main_#t~nondet499#1;havoc main_#t~nondet499#1;main_~ldvarg11~0#1 := main_~tmp___4~3#1; {31731#true} is VALID [2022-02-20 22:04:39,661 INFO L272 TraceCheckUtils]: 20: Hoare triple {31731#true} call main_#t~ret500#1.base, main_#t~ret500#1.offset := ldv_zalloc(336); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,662 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {31731#true} {31731#true} #2852#return; {31731#true} is VALID [2022-02-20 22:04:39,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {31731#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret500#1.base, main_#t~ret500#1.offset;havoc main_#t~ret500#1.base, main_#t~ret500#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;main_~tmp___6~1#1 := main_#t~nondet501#1;havoc main_#t~nondet501#1;main_~ldvarg12~0#1 := main_~tmp___6~1#1;main_~tmp___7~1#1 := main_#t~nondet502#1;havoc main_#t~nondet502#1;main_~ldvarg5~0#1 := main_~tmp___7~1#1;main_~tmp___8~0#1 := main_#t~nondet503#1;havoc main_#t~nondet503#1;main_~ldvarg6~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet504#1 && main_#t~nondet504#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet504#1;havoc main_#t~nondet504#1;main_~ldvarg8~0#1 := main_~tmp___9~0#1; {31731#true} is VALID [2022-02-20 22:04:39,662 INFO L272 TraceCheckUtils]: 26: Hoare triple {31731#true} call main_#t~ret505#1.base, main_#t~ret505#1.offset := ldv_zalloc(336); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,663 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {31731#true} {31731#true} #2854#return; {31731#true} is VALID [2022-02-20 22:04:39,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {31731#true} main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset := main_#t~ret505#1.base, main_#t~ret505#1.offset;havoc main_#t~ret505#1.base, main_#t~ret505#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___10~0#1.base, main_~tmp___10~0#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,663 INFO L272 TraceCheckUtils]: 32: Hoare triple {31731#true} call main_#t~ret506#1.base, main_#t~ret506#1.offset := ldv_zalloc(1); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,664 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31731#true} {31731#true} #2856#return; {31731#true} is VALID [2022-02-20 22:04:39,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {31731#true} main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset := main_#t~ret506#1.base, main_#t~ret506#1.offset;havoc main_#t~ret506#1.base, main_#t~ret506#1.offset;main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset := main_~tmp___11~0#1.base, main_~tmp___11~0#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,665 INFO L272 TraceCheckUtils]: 38: Hoare triple {31731#true} call main_#t~ret507#1.base, main_#t~ret507#1.offset := ldv_zalloc(1); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,665 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {31731#true} {31731#true} #2858#return; {31731#true} is VALID [2022-02-20 22:04:39,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {31731#true} main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset := main_#t~ret507#1.base, main_#t~ret507#1.offset;havoc main_#t~ret507#1.base, main_#t~ret507#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___12~0#1.base, main_~tmp___12~0#1.offset;assume { :begin_inline_ldv_initialize } true; {31731#true} is VALID [2022-02-20 22:04:39,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {31731#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {31731#true} is VALID [2022-02-20 22:04:39,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {31731#true} assume -2147483648 <= main_#t~nondet508#1 && main_#t~nondet508#1 <= 2147483647;main_~tmp___13~0#1 := main_#t~nondet508#1;havoc main_#t~nondet508#1;main_#t~switch509#1 := 0 == main_~tmp___13~0#1; {31731#true} is VALID [2022-02-20 22:04:39,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {31731#true} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 1 == main_~tmp___13~0#1; {31731#true} is VALID [2022-02-20 22:04:39,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {31731#true} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 2 == main_~tmp___13~0#1; {31731#true} is VALID [2022-02-20 22:04:39,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {31731#true} assume main_#t~switch509#1; {31731#true} is VALID [2022-02-20 22:04:39,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {31731#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet524#1 && main_#t~nondet524#1 <= 2147483647;main_~tmp___15~0#1 := main_#t~nondet524#1;havoc main_#t~nondet524#1;main_#t~switch525#1 := 0 == main_~tmp___15~0#1; {31731#true} is VALID [2022-02-20 22:04:39,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {31731#true} assume !main_#t~switch525#1;main_#t~switch525#1 := main_#t~switch525#1 || 1 == main_~tmp___15~0#1; {31731#true} is VALID [2022-02-20 22:04:39,666 INFO L290 TraceCheckUtils]: 51: Hoare triple {31731#true} assume main_#t~switch525#1; {31731#true} is VALID [2022-02-20 22:04:39,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {31731#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_slip_init } true;havoc slip_init_#res#1;havoc slip_init_#t~nondet434#1, slip_init_#t~nondet435#1, slip_init_#t~nondet436#1, slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset, slip_init_#t~nondet438#1, slip_init_#t~ret439#1, slip_init_#t~nondet440#1, slip_init_~status~0#1, slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset;havoc slip_init_~status~0#1;havoc slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {31731#true} assume !(~slip_maxdev~0 <= 3); {31731#true} is VALID [2022-02-20 22:04:39,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {31731#true} havoc slip_init_#t~nondet434#1;havoc slip_init_#t~nondet435#1;havoc slip_init_#t~nondet436#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~ret33#1.base, kzalloc_#t~ret33#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,668 INFO L272 TraceCheckUtils]: 55: Hoare triple {31731#true} call kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset := kmalloc(kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768)); {31782#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {31782#(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~ret31#1.base, __kmalloc_#t~ret31#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {31731#true} is VALID [2022-02-20 22:04:39,668 INFO L272 TraceCheckUtils]: 57: Hoare triple {31731#true} call __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset := ldv_malloc(__kmalloc_~size#1); {31782#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {31782#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~tmp___0~0 := #t~nondet7;havoc #t~nondet7; {31731#true} is VALID [2022-02-20 22:04:39,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {31731#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,669 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {31731#true} {31731#true} #2776#return; {31731#true} is VALID [2022-02-20 22:04:39,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {31731#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset;havoc __kmalloc_#t~ret31#1.base, __kmalloc_#t~ret31#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {31731#true} #t~ret32#1.base, #t~ret32#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~ret32#1.base, #t~ret32#1.offset;havoc #t~ret32#1.base, #t~ret32#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,670 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {31731#true} {31731#true} #2950#return; {31731#true} is VALID [2022-02-20 22:04:39,670 INFO L290 TraceCheckUtils]: 66: Hoare triple {31731#true} kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset := kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset;havoc kzalloc_#t~ret33#1.base, kzalloc_#t~ret33#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~5#1.base, kzalloc_~tmp~5#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,670 INFO L290 TraceCheckUtils]: 67: Hoare triple {31731#true} slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset := slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset;havoc slip_init_#t~ret437#1.base, slip_init_#t~ret437#1.offset;~slip_devs~0.base, ~slip_devs~0.offset := slip_init_~tmp~38#1.base, slip_init_~tmp~38#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {31731#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~nondet580#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~nondet580#1 && tty_register_ldisc_#t~nondet580#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet580#1;havoc tty_register_ldisc_#t~nondet580#1; {31731#true} is VALID [2022-02-20 22:04:39,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {31731#true} slip_init_#t~ret439#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= slip_init_#t~ret439#1 && slip_init_#t~ret439#1 <= 2147483647;slip_init_~status~0#1 := slip_init_#t~ret439#1;havoc slip_init_#t~ret439#1; {31731#true} is VALID [2022-02-20 22:04:39,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {31731#true} assume !(0 != slip_init_~status~0#1); {31731#true} is VALID [2022-02-20 22:04:39,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {31731#true} slip_init_#res#1 := slip_init_~status~0#1; {31731#true} is VALID [2022-02-20 22:04:39,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {31731#true} main_#t~ret526#1 := slip_init_#res#1;assume { :end_inline_slip_init } true;assume -2147483648 <= main_#t~ret526#1 && main_#t~ret526#1 <= 2147483647;~ldv_retval_2~0 := main_#t~ret526#1;havoc main_#t~ret526#1; {31731#true} is VALID [2022-02-20 22:04:39,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {31731#true} assume !(0 != ~ldv_retval_2~0); {31731#true} is VALID [2022-02-20 22:04:39,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {31731#true} assume 0 == ~ldv_retval_2~0;~ldv_state_variable_0~0 := 2;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_target_type_3 } true;havoc ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset, ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset;havoc ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,671 INFO L272 TraceCheckUtils]: 75: Hoare triple {31731#true} call ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset := ldv_zalloc(2696); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,672 INFO L290 TraceCheckUtils]: 78: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,672 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31731#true} {31731#true} #2954#return; {31731#true} is VALID [2022-02-20 22:04:39,672 INFO L290 TraceCheckUtils]: 80: Hoare triple {31731#true} ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset := ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset;havoc ldv_target_type_3_#t~ret482#1.base, ldv_target_type_3_#t~ret482#1.offset;~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset := ldv_target_type_3_~tmp~42#1.base, ldv_target_type_3_~tmp~42#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,672 INFO L290 TraceCheckUtils]: 81: Hoare triple {31731#true} assume { :end_inline_ldv_target_type_3 } true;~ldv_state_variable_4~0 := 1;assume { :begin_inline_ldv_net_device_ops_4 } true;havoc ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset, ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset;havoc ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,673 INFO L272 TraceCheckUtils]: 82: Hoare triple {31731#true} call ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset := ldv_zalloc(2496); {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:39,673 INFO L290 TraceCheckUtils]: 83: Hoare triple {31781#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet9#1 && #t~nondet9#1 <= 2147483647;~tmp___0~1#1 := #t~nondet9#1;havoc #t~nondet9#1; {31731#true} is VALID [2022-02-20 22:04:39,673 INFO L290 TraceCheckUtils]: 84: Hoare triple {31731#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {31731#true} is VALID [2022-02-20 22:04:39,673 INFO L290 TraceCheckUtils]: 85: Hoare triple {31731#true} assume true; {31731#true} is VALID [2022-02-20 22:04:39,673 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {31731#true} {31731#true} #2956#return; {31731#true} is VALID [2022-02-20 22:04:39,674 INFO L290 TraceCheckUtils]: 87: Hoare triple {31731#true} ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset := ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset;havoc ldv_net_device_ops_4_#t~ret483#1.base, ldv_net_device_ops_4_#t~ret483#1.offset;~sl_netdev_ops_group1~0.base, ~sl_netdev_ops_group1~0.offset := ldv_net_device_ops_4_~tmp~43#1.base, ldv_net_device_ops_4_~tmp~43#1.offset; {31731#true} is VALID [2022-02-20 22:04:39,674 INFO L290 TraceCheckUtils]: 88: Hoare triple {31731#true} assume { :end_inline_ldv_net_device_ops_4 } true; {31731#true} is VALID [2022-02-20 22:04:39,674 INFO L290 TraceCheckUtils]: 89: Hoare triple {31731#true} assume -2147483648 <= main_#t~nondet508#1 && main_#t~nondet508#1 <= 2147483647;main_~tmp___13~0#1 := main_#t~nondet508#1;havoc main_#t~nondet508#1;main_#t~switch509#1 := 0 == main_~tmp___13~0#1; {31731#true} is VALID [2022-02-20 22:04:39,674 INFO L290 TraceCheckUtils]: 90: Hoare triple {31731#true} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 1 == main_~tmp___13~0#1; {31731#true} is VALID [2022-02-20 22:04:39,674 INFO L290 TraceCheckUtils]: 91: Hoare triple {31731#true} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 2 == main_~tmp___13~0#1; {31731#true} is VALID [2022-02-20 22:04:39,674 INFO L290 TraceCheckUtils]: 92: Hoare triple {31731#true} assume !main_#t~switch509#1;main_#t~switch509#1 := main_#t~switch509#1 || 3 == main_~tmp___13~0#1; {31731#true} is VALID [2022-02-20 22:04:39,674 INFO L290 TraceCheckUtils]: 93: Hoare triple {31731#true} assume main_#t~switch509#1; {31731#true} is VALID [2022-02-20 22:04:39,675 INFO L290 TraceCheckUtils]: 94: Hoare triple {31731#true} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet527#1 && main_#t~nondet527#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet527#1;havoc main_#t~nondet527#1;main_#t~switch528#1 := 0 == main_~tmp___16~0#1; {31731#true} is VALID [2022-02-20 22:04:39,675 INFO L290 TraceCheckUtils]: 95: Hoare triple {31731#true} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 1 == main_~tmp___16~0#1; {31731#true} is VALID [2022-02-20 22:04:39,675 INFO L290 TraceCheckUtils]: 96: Hoare triple {31731#true} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 2 == main_~tmp___16~0#1; {31731#true} is VALID [2022-02-20 22:04:39,675 INFO L290 TraceCheckUtils]: 97: Hoare triple {31731#true} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 3 == main_~tmp___16~0#1; {31731#true} is VALID [2022-02-20 22:04:39,675 INFO L290 TraceCheckUtils]: 98: Hoare triple {31731#true} assume !main_#t~switch528#1;main_#t~switch528#1 := main_#t~switch528#1 || 4 == main_~tmp___16~0#1; {31731#true} is VALID [2022-02-20 22:04:39,675 INFO L290 TraceCheckUtils]: 99: Hoare triple {31731#true} assume main_#t~switch528#1; {31731#true} is VALID [2022-02-20 22:04:39,675 INFO L290 TraceCheckUtils]: 100: Hoare triple {31731#true} assume 1 == ~ldv_state_variable_3~0;assume { :begin_inline_ldv_slip_open_18 } true;ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset := ~sl_ldisc_group1~0.base, ~sl_ldisc_group1~0.offset;havoc ldv_slip_open_18_#res#1;havoc ldv_slip_open_18_#t~ret555#1, ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset, ldv_slip_open_18_~ldv_func_res~17#1, ldv_slip_open_18_~tmp~62#1;ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset := ldv_slip_open_18_#in~tty#1.base, ldv_slip_open_18_#in~tty#1.offset;havoc ldv_slip_open_18_~ldv_func_res~17#1;havoc ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_slip_open } true;slip_open_#in~tty#1.base, slip_open_#in~tty#1.offset := ldv_slip_open_18_~tty#1.base, ldv_slip_open_18_~tty#1.offset;havoc slip_open_#res#1;havoc slip_open_#t~ret305#1, slip_open_#t~mem306#1.base, slip_open_#t~mem306#1.offset, slip_open_#t~mem307#1.base, slip_open_#t~mem307#1.offset, slip_open_#t~mem308#1.base, slip_open_#t~mem308#1.offset, slip_open_#t~mem309#1, slip_open_#t~short310#1, slip_open_#t~ret311#1, slip_open_#t~ret312#1.base, slip_open_#t~ret312#1.offset, slip_open_#t~ret313#1, slip_open_#t~ret314#1.base, slip_open_#t~ret314#1.offset, slip_open_#t~mem315#1, slip_open_#t~ret316#1, slip_open_#t~ret317#1, slip_open_#t~mem318#1.base, slip_open_#t~mem318#1.offset, slip_open_#t~ret319#1, slip_open_#t~mem320#1, slip_open_#t~mem321#1, slip_open_#t~mem322#1, slip_open_#t~mem323#1, slip_open_#t~mem324#1.base, slip_open_#t~mem324#1.offset, slip_open_#t~mem325#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~30#1, slip_open_~tmp___0~12#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~30#1;havoc slip_open_~tmp___0~12#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~nondet558#1, capable_~arg0#1;capable_~arg0#1 := capable_#in~arg0#1;assume -2147483648 <= capable_#t~nondet558#1 && capable_#t~nondet558#1 <= 2147483647;capable_#res#1 := capable_#t~nondet558#1;havoc capable_#t~nondet558#1; {31731#true} is VALID [2022-02-20 22:04:39,676 INFO L290 TraceCheckUtils]: 101: Hoare triple {31731#true} slip_open_#t~ret305#1 := capable_#res#1;assume { :end_inline_capable } true;assume -2147483648 <= slip_open_#t~ret305#1 && slip_open_#t~ret305#1 <= 2147483647;slip_open_~tmp~30#1 := slip_open_#t~ret305#1;havoc slip_open_#t~ret305#1; {31731#true} is VALID [2022-02-20 22:04:39,676 INFO L290 TraceCheckUtils]: 102: Hoare triple {31731#true} assume 0 == slip_open_~tmp~30#1;slip_open_#res#1 := -1; {31779#(<= (+ |ULTIMATE.start_slip_open_#res#1| 1) 0)} is VALID [2022-02-20 22:04:39,676 INFO L290 TraceCheckUtils]: 103: Hoare triple {31779#(<= (+ |ULTIMATE.start_slip_open_#res#1| 1) 0)} ldv_slip_open_18_#t~ret555#1 := slip_open_#res#1;assume { :end_inline_slip_open } true;assume -2147483648 <= ldv_slip_open_18_#t~ret555#1 && ldv_slip_open_18_#t~ret555#1 <= 2147483647;ldv_slip_open_18_~tmp~62#1 := ldv_slip_open_18_#t~ret555#1;havoc ldv_slip_open_18_#t~ret555#1;ldv_slip_open_18_~ldv_func_res~17#1 := ldv_slip_open_18_~tmp~62#1;assume { :begin_inline_ldv_check_callback_ret_val } true;ldv_check_callback_ret_val_#in~ret_val#1 := ldv_slip_open_18_~ldv_func_res~17#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; {31780#(<= (+ |ULTIMATE.start_ldv_check_callback_ret_val_~ret_val#1| 1) 0)} is VALID [2022-02-20 22:04:39,677 INFO L290 TraceCheckUtils]: 104: Hoare triple {31780#(<= (+ |ULTIMATE.start_ldv_check_callback_ret_val_~ret_val#1| 1) 0)} assume !(ldv_check_callback_ret_val_~ret_val#1 <= 0); {31732#false} is VALID [2022-02-20 22:04:39,677 INFO L272 TraceCheckUtils]: 105: Hoare triple {31732#false} call ldv_error(); {31732#false} is VALID [2022-02-20 22:04:39,677 INFO L290 TraceCheckUtils]: 106: Hoare triple {31732#false} assume !false; {31732#false} is VALID [2022-02-20 22:04:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-02-20 22:04:39,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:04:39,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077150537] [2022-02-20 22:04:39,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077150537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:04:39,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:04:39,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:04:39,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424790744] [2022-02-20 22:04:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:04:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2022-02-20 22:04:39,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:04:39,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 22:04:39,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:39,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:04:39,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:04:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:04:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:04:39,736 INFO L87 Difference]: Start difference. First operand 1604 states and 2319 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 22:04:43,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []