./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.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 92cb918a49bd861dcff82a05c4e06551bd9d0c0cbb9eb8fadf6410a0f7818165 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:57:50,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:57:50,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:57:50,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:57:50,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:57:50,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:57:50,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:57:50,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:57:50,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:57:50,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:57:50,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:57:50,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:57:50,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:57:50,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:57:50,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:57:50,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:57:50,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:57:50,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:57:50,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:57:50,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:57:50,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:57:50,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:57:50,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:57:50,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:57:50,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:57:50,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:57:50,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:57:50,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:57:50,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:57:50,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:57:50,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:57:50,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:57:50,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:57:50,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:57:50,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:57:50,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:57:50,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:57:50,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:57:50,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:57:50,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:57:50,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:57:50,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:57:50,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:57:50,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:57:50,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:57:50,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:57:50,312 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:57:50,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:57:50,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:57:50,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:57:50,313 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:57:50,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:57:50,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:57:50,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:57:50,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:57:50,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:57:50,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:57:50,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:57:50,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:57:50,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:57:50,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:57:50,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:57:50,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:57:50,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:57:50,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:57:50,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:57:50,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:57:50,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:57:50,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:57:50,316 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:57:50,316 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:57:50,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:57:50,317 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 -> 92cb918a49bd861dcff82a05c4e06551bd9d0c0cbb9eb8fadf6410a0f7818165 [2022-02-20 21:57:50,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:57:50,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:57:50,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:57:50,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:57:50,530 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:57:50,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i [2022-02-20 21:57:50,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee07d09f/61f9e6b29ad44bc18d834b068cc53cad/FLAGfff562883 [2022-02-20 21:57:51,182 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:57:51,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i [2022-02-20 21:57:51,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee07d09f/61f9e6b29ad44bc18d834b068cc53cad/FLAGfff562883 [2022-02-20 21:57:51,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee07d09f/61f9e6b29ad44bc18d834b068cc53cad [2022-02-20 21:57:51,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:57:51,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:57:51,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:57:51,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:57:51,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:57:51,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:57:51" (1/1) ... [2022-02-20 21:57:51,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fbd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:51, skipping insertion in model container [2022-02-20 21:57:51,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:57:51" (1/1) ... [2022-02-20 21:57:51,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:57:51,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:57:51,993 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3714] [2022-02-20 21:57:51,993 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3715-3716] [2022-02-20 21:57:52,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i[111905,111918] [2022-02-20 21:57:52,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:57:52,614 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:57:52,669 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3714] [2022-02-20 21:57:52,670 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3715-3716] [2022-02-20 21:57:52,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i[111905,111918] [2022-02-20 21:57:52,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:57:52,931 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:57:52,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52 WrapperNode [2022-02-20 21:57:52,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:57:52,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:57:52,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:57:52,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:57:52,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:52,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,079 INFO L137 Inliner]: procedures = 170, calls = 1019, calls flagged for inlining = 80, calls inlined = 51, statements flattened = 1557 [2022-02-20 21:57:53,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:57:53,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:57:53,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:57:53,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:57:53,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:57:53,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:57:53,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:57:53,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:57:53,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (1/1) ... [2022-02-20 21:57:53,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:57:53,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:57:53,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:57:53,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:57:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_map_urb_for_dma [2022-02-20 21:57:53,282 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_map_urb_for_dma [2022-02-20 21:57:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-02-20 21:57:53,282 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-02-20 21:57:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure wake_up_process [2022-02-20 21:57:53,282 INFO L138 BoogieDeclarations]: Found implementation of procedure wake_up_process [2022-02-20 21:57:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:57:53,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-02-20 21:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-02-20 21:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-02-20 21:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-02-20 21:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_hub_control [2022-02-20 21:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_hub_control [2022-02-20 21:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_urb_dequeue [2022-02-20 21:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_urb_dequeue [2022-02-20 21:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-02-20 21:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-02-20 21:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_endpoint_disable [2022-02-20 21:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_endpoint_disable [2022-02-20 21:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u16 [2022-02-20 21:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:57:53,286 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:57:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_reset [2022-02-20 21:57:53,286 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_reset [2022-02-20 21:57:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_urb_enqueue [2022-02-20 21:57:53,286 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_urb_enqueue [2022-02-20 21:57:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:57:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:57:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:57:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_bus_resume [2022-02-20 21:57:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_bus_resume [2022-02-20 21:57:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:57:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_gpout_set_value [2022-02-20 21:57:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_gpout_set_value [2022-02-20 21:57:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:57:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:57:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 21:57:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 21:57:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-02-20 21:57:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-02-20 21:57:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_stop [2022-02-20 21:57:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_stop [2022-02-20 21:57:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:57:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 21:57:53,290 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 21:57:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:57:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:57:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_unmap_urb_for_dma [2022-02-20 21:57:53,291 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_unmap_urb_for_dma [2022-02-20 21:57:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:57:53,291 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:57:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure to_spi_device [2022-02-20 21:57:53,291 INFO L138 BoogieDeclarations]: Found implementation of procedure to_spi_device [2022-02-20 21:57:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:57:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_hcd [2022-02-20 21:57:53,292 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_hcd [2022-02-20 21:57:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_bus_suspend [2022-02-20 21:57:53,292 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_bus_suspend [2022-02-20 21:57:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_get_frame_number [2022-02-20 21:57:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_get_frame_number [2022-02-20 21:57:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:57:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:57:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:57:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:57:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_hub_status_data [2022-02-20 21:57:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_hub_status_data [2022-02-20 21:57:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_max3421 [2022-02-20 21:57:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_max3421 [2022-02-20 21:57:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 21:57:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 21:57:53,647 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:57:53,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:57:54,071 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:57:54,673 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:57:54,683 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:57:54,683 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:57:54,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:57:54 BoogieIcfgContainer [2022-02-20 21:57:54,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:57:54,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:57:54,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:57:54,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:57:54,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:57:51" (1/3) ... [2022-02-20 21:57:54,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a6a28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:57:54, skipping insertion in model container [2022-02-20 21:57:54,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:57:52" (2/3) ... [2022-02-20 21:57:54,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a6a28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:57:54, skipping insertion in model container [2022-02-20 21:57:54,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:57:54" (3/3) ... [2022-02-20 21:57:54,690 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i [2022-02-20 21:57:54,694 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:57:54,694 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:57:54,726 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:57:54,730 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:57:54,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:57:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 535 states, 395 states have (on average 1.379746835443038) internal successors, (545), 405 states have internal predecessors, (545), 105 states have call successors, (105), 34 states have call predecessors, (105), 33 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-02-20 21:57:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 21:57:54,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:57:54,768 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:57:54,768 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:57:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:57:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1403727082, now seen corresponding path program 1 times [2022-02-20 21:57:54,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:57:54,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224925935] [2022-02-20 21:57:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:57:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:57:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:57:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:55,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:57:55,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #1333#return; {538#true} is VALID [2022-02-20 21:57:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:57:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:55,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:57:55,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #1335#return; {538#true} is VALID [2022-02-20 21:57:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:57:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:55,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:57:55,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #1337#return; {538#true} is VALID [2022-02-20 21:57:55,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 21:57:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:55,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___0~0 := #t~nondet34;havoc #t~nondet34; {538#true} is VALID [2022-02-20 21:57:55,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {539#false} #1407#return; {539#false} is VALID [2022-02-20 21:57:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 21:57:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:55,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {538#true} is VALID [2022-02-20 21:57:55,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {539#false} #1409#return; {539#false} is VALID [2022-02-20 21:57:55,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 21:57:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:57:55,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~list.base, ~list.offset := #in~list.base, #in~list.offset;call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 8);call write~$Pointer$(~list.base, ~list.offset, ~list.base, 8 + ~list.offset, 8); {538#true} is VALID [2022-02-20 21:57:55,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {539#false} #1411#return; {539#false} is VALID [2022-02-20 21:57:55,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#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(101, 2);call #Ultimate.allocInit(20, 3);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(50, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(29, 8);call #Ultimate.allocInit(221, 9);call #Ultimate.allocInit(23, 10);call #Ultimate.allocInit(23, 11);call #Ultimate.allocInit(29, 12);call #Ultimate.allocInit(12, 13);call #Ultimate.allocInit(21, 14);call #Ultimate.allocInit(221, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(23, 17);call #Ultimate.allocInit(21, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(21, 20);call #Ultimate.allocInit(221, 21);call #Ultimate.allocInit(33, 22);call #Ultimate.allocInit(33, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(21, 26);call #Ultimate.allocInit(221, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(33, 29);call #Ultimate.allocInit(21, 30);call #Ultimate.allocInit(12, 31);call #Ultimate.allocInit(21, 32);call #Ultimate.allocInit(221, 33);call #Ultimate.allocInit(33, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(21, 36);call #Ultimate.allocInit(50, 37);call #Ultimate.allocInit(25, 38);call #Ultimate.allocInit(31, 39);call #Ultimate.allocInit(20, 40);call #Ultimate.allocInit(10, 41);call #Ultimate.allocInit(20, 42);call #Ultimate.allocInit(12, 43);call #Ultimate.allocInit(20, 44);call #Ultimate.allocInit(43, 45);call #Ultimate.allocInit(221, 46);call #Ultimate.allocInit(15, 47);call #Ultimate.allocInit(40, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(29, 50);call #Ultimate.allocInit(50, 51);call #Ultimate.allocInit(20, 52);call #Ultimate.allocInit(12, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(221, 55);call #Ultimate.allocInit(32, 56);call #Ultimate.allocInit(32, 57);call #Ultimate.allocInit(12, 58);call #Ultimate.allocInit(20, 59);call #Ultimate.allocInit(221, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(11, 62);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(20, 64);call #Ultimate.allocInit(221, 65);call #Ultimate.allocInit(10, 66);call #Ultimate.allocInit(10, 67);call #Ultimate.allocInit(12, 68);call #Ultimate.allocInit(20, 69);call #Ultimate.allocInit(221, 70);call #Ultimate.allocInit(37, 71);call #Ultimate.allocInit(37, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(35, 74);call #Ultimate.allocInit(24, 75);call #Ultimate.allocInit(32, 76);call #Ultimate.allocInit(29, 77);call #Ultimate.allocInit(29, 78);call #Ultimate.allocInit(19, 79);call #Ultimate.allocInit(45, 80);call #Ultimate.allocInit(19, 81);call #Ultimate.allocInit(8, 82);call #Ultimate.allocInit(26, 83);call #Ultimate.allocInit(40, 84);call #Ultimate.allocInit(12, 85);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset := 86, 0;call #Ultimate.allocInit(8, 86);call write~init~$Pointer$(0, 0, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8);~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset := 87, 0;call #Ultimate.allocInit(64, 87);call write~init~int(0, ~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 4 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 8 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 12 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-11, ~#hrsl_to_error~0.base, 16 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-32, ~#hrsl_to_error~0.base, 20 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 24 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 28 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-121, ~#hrsl_to_error~0.base, 32 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 36 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 40 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 44 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 48 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 52 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-62, ~#hrsl_to_error~0.base, 56 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-75, ~#hrsl_to_error~0.base, 60 + ~#hrsl_to_error~0.offset, 4);~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset := 88, 0;call #Ultimate.allocInit(340, 88);call write~init~$Pointer$(73, 0, ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(74, 0, ~#max3421_hcd_desc~0.base, 8 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(192, ~#max3421_hcd_desc~0.base, 16 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 24 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(16, ~#max3421_hcd_desc~0.base, 32 + ~#max3421_hcd_desc~0.offset, 4);call write~init~$Pointer$(#funAddr~max3421_reset.base, #funAddr~max3421_reset.offset, ~#max3421_hcd_desc~0.base, 36 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_start.base, #funAddr~max3421_start.offset, ~#max3421_hcd_desc~0.base, 44 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 52 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 60 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_stop.base, #funAddr~max3421_stop.offset, ~#max3421_hcd_desc~0.base, 68 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 76 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_get_frame_number.base, #funAddr~max3421_get_frame_number.offset, ~#max3421_hcd_desc~0.base, 84 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_enqueue.base, #funAddr~max3421_urb_enqueue.offset, ~#max3421_hcd_desc~0.base, 92 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_dequeue.base, #funAddr~max3421_urb_dequeue.offset, ~#max3421_hcd_desc~0.base, 100 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_map_urb_for_dma.base, #funAddr~max3421_map_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 108 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_unmap_urb_for_dma.base, #funAddr~max3421_unmap_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 116 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_endpoint_disable.base, #funAddr~max3421_endpoint_disable.offset, ~#max3421_hcd_desc~0.base, 124 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 132 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_status_data.base, #funAddr~max3421_hub_status_data.offset, ~#max3421_hcd_desc~0.base, 140 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_control.base, #funAddr~max3421_hub_control.offset, ~#max3421_hcd_desc~0.base, 148 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_suspend.base, #funAddr~max3421_bus_suspend.offset, ~#max3421_hcd_desc~0.base, 156 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_resume.base, #funAddr~max3421_bus_resume.offset, ~#max3421_hcd_desc~0.base, 164 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 172 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 180 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 188 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 196 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 204 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 212 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 220 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 228 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 236 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 244 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 252 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 260 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 268 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 276 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 284 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 292 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 300 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 308 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 316 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 324 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 332 + ~#max3421_hcd_desc~0.offset, 8);~#max3421_driver~0.base, ~#max3421_driver~0.offset := 89, 0;call #Ultimate.allocInit(161, 89);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_probe.base, #funAddr~max3421_probe.offset, ~#max3421_driver~0.base, 8 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_remove.base, #funAddr~max3421_remove.offset, ~#max3421_driver~0.base, 16 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 24 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 32 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 40 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(85, 0, ~#max3421_driver~0.base, 48 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 56 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#max3421_driver~0.base, 64 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 72 + ~#max3421_driver~0.offset, 8);call write~init~int(0, ~#max3421_driver~0.base, 80 + ~#max3421_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 81 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 89 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 97 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 105 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 113 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 121 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 129 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 137 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 145 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 153 + ~#max3421_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_spin~0 := 0; {538#true} is VALID [2022-02-20 21:57:55,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset, main_#t~ret574#1, main_#t~ret575#1, main_#t~ret576#1.base, main_#t~ret576#1.offset, main_#t~ret577#1, main_#t~ret578#1.base, main_#t~ret578#1.offset, main_#t~nondet579#1, main_#t~ret580#1, main_#t~nondet581#1, main_#t~nondet582#1, main_#t~nondet583#1, main_#t~switch584#1, main_#t~nondet585#1, main_#t~switch586#1, main_#t~ret587#1, main_#t~nondet588#1, main_#t~switch589#1, main_#t~ret590#1, main_#t~ret591#1, main_#t~ret592#1, main_#t~ret593#1, main_#t~ret594#1, main_#t~ret595#1, main_#t~ret596#1, main_#t~ret597#1, main_#t~ret598#1, main_#t~ret599#1, main_#t~ret600#1, main_#t~ret601#1, main_#t~ret602#1, main_#t~ret603#1, main_#t~ret604#1, main_#t~ret605#1, main_#t~ret606#1, main_#t~ret607#1, main_#t~ret608#1, main_#t~nondet609#1, main_#t~switch610#1, main_#t~ret611#1, main_#t~ret612#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~ldvarg3~0#1, main_~tmp___0~25#1, main_~ldvarg0~0#1, main_~tmp___1~13#1, main_~ldvarg5~0#1, main_~ldvarg6~0#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~ldvarg1~0#1, main_~tmp___3~5#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset, main_~ldvarg9~0#1, main_~tmp___5~4#1, main_~ldvarg2~0#1, main_~tmp___6~4#1, main_~tmp___7~3#1, main_~tmp___8~3#1, main_~tmp___9~2#1, main_~tmp___10~1#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~25#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg5~0#1;havoc main_~ldvarg6~0#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___3~5#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;havoc main_~ldvarg9~0#1;havoc main_~tmp___5~4#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___6~4#1;havoc main_~tmp___7~3#1;havoc main_~tmp___8~3#1;havoc main_~tmp___9~2#1;havoc main_~tmp___10~1#1; {538#true} is VALID [2022-02-20 21:57:55,200 INFO L272 TraceCheckUtils]: 2: Hoare triple {538#true} call main_#t~ret573#1.base, main_#t~ret573#1.offset := ldv_zalloc(1); {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:57:55,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:57:55,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {538#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,201 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {538#true} {538#true} #1333#return; {538#true} is VALID [2022-02-20 21:57:55,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret573#1.base, main_#t~ret573#1.offset;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_#t~ret574#1 := __VERIFIER_nondet_u16();main_~tmp___0~25#1 := main_#t~ret574#1;havoc main_#t~ret574#1;main_~ldvarg3~0#1 := main_~tmp___0~25#1;call main_#t~ret575#1 := __VERIFIER_nondet_u16();main_~tmp___1~13#1 := main_#t~ret575#1;havoc main_#t~ret575#1;main_~ldvarg0~0#1 := main_~tmp___1~13#1; {538#true} is VALID [2022-02-20 21:57:55,202 INFO L272 TraceCheckUtils]: 8: Hoare triple {538#true} call main_#t~ret576#1.base, main_#t~ret576#1.offset := ldv_zalloc(72); {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:57:55,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:57:55,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,203 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {538#true} {538#true} #1335#return; {538#true} is VALID [2022-02-20 21:57:55,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {538#true} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret576#1.base, main_#t~ret576#1.offset;havoc main_#t~ret576#1.base, main_#t~ret576#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;call main_#t~ret577#1 := __VERIFIER_nondet_u16();main_~tmp___3~5#1 := main_#t~ret577#1;havoc main_#t~ret577#1;main_~ldvarg1~0#1 := main_~tmp___3~5#1; {538#true} is VALID [2022-02-20 21:57:55,209 INFO L272 TraceCheckUtils]: 14: Hoare triple {538#true} call main_#t~ret578#1.base, main_#t~ret578#1.offset := ldv_zalloc(1); {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:57:55,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {563#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:57:55,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,210 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {538#true} {538#true} #1337#return; {538#true} is VALID [2022-02-20 21:57:55,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {538#true} main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset := main_#t~ret578#1.base, main_#t~ret578#1.offset;havoc main_#t~ret578#1.base, main_#t~ret578#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;assume -2147483648 <= main_#t~nondet579#1 && main_#t~nondet579#1 <= 2147483647;main_~tmp___5~4#1 := main_#t~nondet579#1;havoc main_#t~nondet579#1;main_~ldvarg9~0#1 := main_~tmp___5~4#1;call main_#t~ret580#1 := __VERIFIER_nondet_u16();main_~tmp___6~4#1 := main_#t~ret580#1;havoc main_#t~ret580#1;main_~ldvarg2~0#1 := main_~tmp___6~4#1;assume { :begin_inline_ldv_initialize } true; {538#true} is VALID [2022-02-20 21:57:55,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {538#true} assume { :end_inline_ldv_initialize } true;assume -2147483648 <= main_#t~nondet581#1 && main_#t~nondet581#1 <= 2147483647;main_~ldvarg5~0#1 := main_#t~nondet581#1;havoc main_#t~nondet581#1;assume -2147483648 <= main_#t~nondet582#1 && main_#t~nondet582#1 <= 2147483647;main_~ldvarg6~0#1 := main_#t~nondet582#1;havoc main_#t~nondet582#1;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {552#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:57:55,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {552#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {552#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:57:55,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {552#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {552#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:57:55,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {552#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 2 == main_~tmp___7~3#1; {552#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:57:55,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {552#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 3 == main_~tmp___7~3#1; {552#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:57:55,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {552#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch584#1; {552#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:57:55,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {552#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet609#1 && main_#t~nondet609#1 <= 2147483647;main_~tmp___10~1#1 := main_#t~nondet609#1;havoc main_#t~nondet609#1;main_#t~switch610#1 := 0 == main_~tmp___10~1#1; {539#false} is VALID [2022-02-20 21:57:55,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {539#false} assume main_#t~switch610#1; {539#false} is VALID [2022-02-20 21:57:55,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {539#false} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_max3421_probe } true;max3421_probe_#in~spi#1.base, max3421_probe_#in~spi#1.offset := ~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset;havoc max3421_probe_#res#1;havoc max3421_probe_#t~ret520#1, max3421_probe_#t~nondet521#1, max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset, max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset, max3421_probe_#t~nondet524#1, max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset, max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset, max3421_probe_#t~ret527#1.base, max3421_probe_#t~ret527#1.offset, max3421_probe_#t~mem528#1.base, max3421_probe_#t~mem528#1.offset, max3421_probe_#t~nondet529#1, max3421_probe_#t~ret530#1.base, max3421_probe_#t~ret530#1.offset, max3421_probe_#t~mem531#1.base, max3421_probe_#t~mem531#1.offset, max3421_probe_#t~nondet532#1, max3421_probe_#t~nondet533#1.base, max3421_probe_#t~nondet533#1.offset, max3421_probe_#t~ret534#1, max3421_probe_#t~ret535#1, max3421_probe_#t~ret536#1.base, max3421_probe_#t~ret536#1.offset, max3421_probe_#t~mem537#1.base, max3421_probe_#t~mem537#1.offset, max3421_probe_#t~nondet538#1, max3421_probe_#t~ret539#1, max3421_probe_#t~nondet540#1, max3421_probe_#t~mem541#1, max3421_probe_#t~ret542#1, max3421_probe_#t~nondet543#1, max3421_probe_#t~mem544#1, max3421_probe_#t~mem545#1.base, max3421_probe_#t~mem545#1.offset, max3421_probe_#t~mem546#1.base, max3421_probe_#t~mem546#1.offset, max3421_probe_#t~mem547#1.base, max3421_probe_#t~mem547#1.offset, max3421_probe_#t~mem548#1.base, max3421_probe_#t~mem548#1.offset, max3421_probe_#t~ret549#1, max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset, max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset, max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset, max3421_probe_~retval~5#1, max3421_probe_~tmp~42#1, max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset, max3421_probe_~tmp___1~12#1.base, max3421_probe_~tmp___1~12#1.offset, max3421_probe_~tmp___2~5#1.base, max3421_probe_~tmp___2~5#1.offset, max3421_probe_~__k~0#1.base, max3421_probe_~__k~0#1.offset, max3421_probe_~tmp___3~4#1.base, max3421_probe_~tmp___3~4#1.offset, max3421_probe_~tmp___4~3#1, max3421_probe_~tmp___5~3#1, max3421_probe_~tmp___6~3#1.base, max3421_probe_~tmp___6~3#1.offset;max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset := max3421_probe_#in~spi#1.base, max3421_probe_#in~spi#1.offset;havoc max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset;havoc max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset;havoc max3421_probe_~retval~5#1;havoc max3421_probe_~tmp~42#1;havoc max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset;havoc max3421_probe_~tmp___1~12#1.base, max3421_probe_~tmp___1~12#1.offset;havoc max3421_probe_~tmp___2~5#1.base, max3421_probe_~tmp___2~5#1.offset;havoc max3421_probe_~__k~0#1.base, max3421_probe_~__k~0#1.offset;havoc max3421_probe_~tmp___3~4#1.base, max3421_probe_~tmp___3~4#1.offset;havoc max3421_probe_~tmp___4~3#1;havoc max3421_probe_~tmp___5~3#1;havoc max3421_probe_~tmp___6~3#1.base, max3421_probe_~tmp___6~3#1.offset;max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset := 0, 0;max3421_probe_~retval~5#1 := -12;assume { :begin_inline_spi_setup } true;spi_setup_#in~arg0#1.base, spi_setup_#in~arg0#1.offset := max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset;havoc spi_setup_#res#1;havoc spi_setup_#t~nondet630#1, spi_setup_~arg0#1.base, spi_setup_~arg0#1.offset;spi_setup_~arg0#1.base, spi_setup_~arg0#1.offset := spi_setup_#in~arg0#1.base, spi_setup_#in~arg0#1.offset;assume -2147483648 <= spi_setup_#t~nondet630#1 && spi_setup_#t~nondet630#1 <= 2147483647;spi_setup_#res#1 := spi_setup_#t~nondet630#1;havoc spi_setup_#t~nondet630#1; {539#false} is VALID [2022-02-20 21:57:55,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {539#false} max3421_probe_#t~ret520#1 := spi_setup_#res#1;assume { :end_inline_spi_setup } true;assume -2147483648 <= max3421_probe_#t~ret520#1 && max3421_probe_#t~ret520#1 <= 2147483647;max3421_probe_~tmp~42#1 := max3421_probe_#t~ret520#1;havoc max3421_probe_#t~ret520#1; {539#false} is VALID [2022-02-20 21:57:55,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {539#false} assume !(max3421_probe_~tmp~42#1 < 0);assume { :begin_inline_dev_name } true;dev_name_#in~dev#1.base, dev_name_#in~dev#1.offset := max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset;havoc dev_name_#res#1.base, dev_name_#res#1.offset;havoc dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset, dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset, dev_name_#t~ret45#1.base, dev_name_#t~ret45#1.offset, dev_name_~dev#1.base, dev_name_~dev#1.offset, dev_name_~tmp~5#1.base, dev_name_~tmp~5#1.offset;dev_name_~dev#1.base, dev_name_~dev#1.offset := dev_name_#in~dev#1.base, dev_name_#in~dev#1.offset;havoc dev_name_~tmp~5#1.base, dev_name_~tmp~5#1.offset;call dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset := read~$Pointer$(dev_name_~dev#1.base, 293 + dev_name_~dev#1.offset, 8); {539#false} is VALID [2022-02-20 21:57:55,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {539#false} assume 0 != (dev_name_#t~mem43#1.base + dev_name_#t~mem43#1.offset) % 18446744073709551616;havoc dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset;call dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset := read~$Pointer$(dev_name_~dev#1.base, 293 + dev_name_~dev#1.offset, 8);dev_name_#res#1.base, dev_name_#res#1.offset := dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset;havoc dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset; {539#false} is VALID [2022-02-20 21:57:55,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {539#false} max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset := dev_name_#res#1.base, dev_name_#res#1.offset;assume { :end_inline_dev_name } true;max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset := max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset;havoc max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset;assume { :begin_inline_usb_create_hcd } true;usb_create_hcd_#in~arg0#1.base, usb_create_hcd_#in~arg0#1.offset, usb_create_hcd_#in~arg1#1.base, usb_create_hcd_#in~arg1#1.offset, usb_create_hcd_#in~arg2#1.base, usb_create_hcd_#in~arg2#1.offset := ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset, max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset;havoc usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset;havoc usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset, usb_create_hcd_~arg0#1.base, usb_create_hcd_~arg0#1.offset, usb_create_hcd_~arg1#1.base, usb_create_hcd_~arg1#1.offset, usb_create_hcd_~arg2#1.base, usb_create_hcd_~arg2#1.offset;usb_create_hcd_~arg0#1.base, usb_create_hcd_~arg0#1.offset := usb_create_hcd_#in~arg0#1.base, usb_create_hcd_#in~arg0#1.offset;usb_create_hcd_~arg1#1.base, usb_create_hcd_~arg1#1.offset := usb_create_hcd_#in~arg1#1.base, usb_create_hcd_#in~arg1#1.offset;usb_create_hcd_~arg2#1.base, usb_create_hcd_~arg2#1.offset := usb_create_hcd_#in~arg2#1.base, usb_create_hcd_#in~arg2#1.offset; {539#false} is VALID [2022-02-20 21:57:55,215 INFO L272 TraceCheckUtils]: 33: Hoare triple {539#false} call usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset := ldv_malloc(899); {564#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:57:55,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {564#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___0~0 := #t~nondet34;havoc #t~nondet34; {538#true} is VALID [2022-02-20 21:57:55,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {538#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {538#true} is VALID [2022-02-20 21:57:55,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,215 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {538#true} {539#false} #1407#return; {539#false} is VALID [2022-02-20 21:57:55,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {539#false} usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset := usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset;havoc usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset; {539#false} is VALID [2022-02-20 21:57:55,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {539#false} max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset := usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset;assume { :end_inline_usb_create_hcd } true;max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset := max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset;havoc max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset; {539#false} is VALID [2022-02-20 21:57:55,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {539#false} assume !(0 == (max3421_probe_~hcd~2#1.base + max3421_probe_~hcd~2#1.offset) % 18446744073709551616);assume { :begin_inline_set_bit } true;set_bit_#in~nr#1, set_bit_#in~addr#1.base, set_bit_#in~addr#1.offset := 2, max3421_probe_~hcd~2#1.base, 531 + max3421_probe_~hcd~2#1.offset;havoc set_bit_~nr#1, set_bit_~addr#1.base, set_bit_~addr#1.offset;set_bit_~nr#1 := set_bit_#in~nr#1;set_bit_~addr#1.base, set_bit_~addr#1.offset := set_bit_#in~addr#1.base, set_bit_#in~addr#1.offset; {539#false} is VALID [2022-02-20 21:57:55,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {539#false} assume { :end_inline_set_bit } true; {539#false} is VALID [2022-02-20 21:57:55,216 INFO L272 TraceCheckUtils]: 42: Hoare triple {539#false} call max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset := hcd_to_max3421(max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset); {538#true} is VALID [2022-02-20 21:57:55,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {538#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {538#true} is VALID [2022-02-20 21:57:55,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,217 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {538#true} {539#false} #1409#return; {539#false} is VALID [2022-02-20 21:57:55,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {539#false} max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset := max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset;havoc max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset;call max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset := read~$Pointer$(~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8);call write~$Pointer$(max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset, max3421_probe_~max3421_hcd~33#1.base, 76 + max3421_probe_~max3421_hcd~33#1.offset, 8);havoc max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset;call write~$Pointer$(max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8); {539#false} is VALID [2022-02-20 21:57:55,217 INFO L272 TraceCheckUtils]: 47: Hoare triple {539#false} call INIT_LIST_HEAD(max3421_probe_~max3421_hcd~33#1.base, 93 + max3421_probe_~max3421_hcd~33#1.offset); {565#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:57:55,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {565#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~list.base, ~list.offset := #in~list.base, #in~list.offset;call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 8);call write~$Pointer$(~list.base, ~list.offset, ~list.base, 8 + ~list.offset, 8); {538#true} is VALID [2022-02-20 21:57:55,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:57:55,218 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {538#true} {539#false} #1411#return; {539#false} is VALID [2022-02-20 21:57:55,218 INFO L272 TraceCheckUtils]: 51: Hoare triple {539#false} call max3421_probe_#t~ret527#1.base, max3421_probe_#t~ret527#1.offset := kmalloc(2, 208); {539#false} is VALID [2022-02-20 21:57:55,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {539#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {539#false} is VALID [2022-02-20 21:57:55,218 INFO L272 TraceCheckUtils]: 53: Hoare triple {539#false} call ldv_check_alloc_flags(~flags#1); {539#false} is VALID [2022-02-20 21:57:55,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {539#false} ~flags := #in~flags; {539#false} is VALID [2022-02-20 21:57:55,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {539#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {539#false} is VALID [2022-02-20 21:57:55,219 INFO L272 TraceCheckUtils]: 56: Hoare triple {539#false} call ldv_error(); {539#false} is VALID [2022-02-20 21:57:55,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-02-20 21:57:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 21:57:55,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:57:55,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224925935] [2022-02-20 21:57:55,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224925935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:57:55,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:57:55,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:57:55,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925053570] [2022-02-20 21:57:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:57:55,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-02-20 21:57:55,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:57:55,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:57:55,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:57:55,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:57:55,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:57:55,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:57:55,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:57:55,312 INFO L87 Difference]: Start difference. First operand has 535 states, 395 states have (on average 1.379746835443038) internal successors, (545), 405 states have internal predecessors, (545), 105 states have call successors, (105), 34 states have call predecessors, (105), 33 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:01,392 INFO L93 Difference]: Finished difference Result 1566 states and 2222 transitions. [2022-02-20 21:58:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:58:01,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-02-20 21:58:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2222 transitions. [2022-02-20 21:58:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2222 transitions. [2022-02-20 21:58:01,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2222 transitions. [2022-02-20 21:58:03,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2222 edges. 2222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:03,221 INFO L225 Difference]: With dead ends: 1566 [2022-02-20 21:58:03,222 INFO L226 Difference]: Without dead ends: 1003 [2022-02-20 21:58:03,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:58:03,237 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 1174 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:03,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1244 Valid, 2156 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 21:58:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-02-20 21:58:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 907. [2022-02-20 21:58:03,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:03,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 907 states, 675 states have (on average 1.3644444444444443) internal successors, (921), 678 states have internal predecessors, (921), 171 states have call successors, (171), 61 states have call predecessors, (171), 60 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2022-02-20 21:58:03,311 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 907 states, 675 states have (on average 1.3644444444444443) internal successors, (921), 678 states have internal predecessors, (921), 171 states have call successors, (171), 61 states have call predecessors, (171), 60 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2022-02-20 21:58:03,313 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 907 states, 675 states have (on average 1.3644444444444443) internal successors, (921), 678 states have internal predecessors, (921), 171 states have call successors, (171), 61 states have call predecessors, (171), 60 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2022-02-20 21:58:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:03,382 INFO L93 Difference]: Finished difference Result 1003 states and 1401 transitions. [2022-02-20 21:58:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1401 transitions. [2022-02-20 21:58:03,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:03,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:03,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 675 states have (on average 1.3644444444444443) internal successors, (921), 678 states have internal predecessors, (921), 171 states have call successors, (171), 61 states have call predecessors, (171), 60 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) Second operand 1003 states. [2022-02-20 21:58:03,392 INFO L87 Difference]: Start difference. First operand has 907 states, 675 states have (on average 1.3644444444444443) internal successors, (921), 678 states have internal predecessors, (921), 171 states have call successors, (171), 61 states have call predecessors, (171), 60 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) Second operand 1003 states. [2022-02-20 21:58:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:03,438 INFO L93 Difference]: Finished difference Result 1003 states and 1401 transitions. [2022-02-20 21:58:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1401 transitions. [2022-02-20 21:58:03,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:03,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:03,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:03,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 675 states have (on average 1.3644444444444443) internal successors, (921), 678 states have internal predecessors, (921), 171 states have call successors, (171), 61 states have call predecessors, (171), 60 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2022-02-20 21:58:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1262 transitions. [2022-02-20 21:58:03,498 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1262 transitions. Word has length 58 [2022-02-20 21:58:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:03,499 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 1262 transitions. [2022-02-20 21:58:03,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1262 transitions. [2022-02-20 21:58:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 21:58:03,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:03,504 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:58:03,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:58:03,504 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1087134040, now seen corresponding path program 1 times [2022-02-20 21:58:03,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:03,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886808133] [2022-02-20 21:58:03,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:03,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:58:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:03,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {5917#true} is VALID [2022-02-20 21:58:03,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {5917#true} is VALID [2022-02-20 21:58:03,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #1333#return; {5917#true} is VALID [2022-02-20 21:58:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:58:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:03,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {5917#true} is VALID [2022-02-20 21:58:03,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {5917#true} is VALID [2022-02-20 21:58:03,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #1335#return; {5917#true} is VALID [2022-02-20 21:58:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:58:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:03,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {5917#true} is VALID [2022-02-20 21:58:03,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {5917#true} is VALID [2022-02-20 21:58:03,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #1337#return; {5917#true} is VALID [2022-02-20 21:58:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:58:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:03,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {5917#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~__mptr~0.base, ~__mptr~0.offset;havoc ~tmp~6.base, ~tmp~6.offset; {5917#true} is VALID [2022-02-20 21:58:03,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume 0 != (~dev.base + ~dev.offset) % 18446744073709551616;~__mptr~0.base, ~__mptr~0.offset := ~dev.base, ~dev.offset;~tmp~6.base, ~tmp~6.offset := ~__mptr~0.base, ~__mptr~0.offset; {5917#true} is VALID [2022-02-20 21:58:03,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} #res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {5917#true} is VALID [2022-02-20 21:58:03,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,614 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5917#true} {5918#false} #1305#return; {5918#false} is VALID [2022-02-20 21:58:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 21:58:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:03,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {5917#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {5917#true} is VALID [2022-02-20 21:58:03,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5917#true} {5918#false} #1307#return; {5918#false} is VALID [2022-02-20 21:58:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 21:58:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:03,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {5944#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {5917#true} is VALID [2022-02-20 21:58:03,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5917#true} {5918#false} #1309#return; {5918#false} is VALID [2022-02-20 21:58:03,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {5917#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(101, 2);call #Ultimate.allocInit(20, 3);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(50, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(29, 8);call #Ultimate.allocInit(221, 9);call #Ultimate.allocInit(23, 10);call #Ultimate.allocInit(23, 11);call #Ultimate.allocInit(29, 12);call #Ultimate.allocInit(12, 13);call #Ultimate.allocInit(21, 14);call #Ultimate.allocInit(221, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(23, 17);call #Ultimate.allocInit(21, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(21, 20);call #Ultimate.allocInit(221, 21);call #Ultimate.allocInit(33, 22);call #Ultimate.allocInit(33, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(21, 26);call #Ultimate.allocInit(221, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(33, 29);call #Ultimate.allocInit(21, 30);call #Ultimate.allocInit(12, 31);call #Ultimate.allocInit(21, 32);call #Ultimate.allocInit(221, 33);call #Ultimate.allocInit(33, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(21, 36);call #Ultimate.allocInit(50, 37);call #Ultimate.allocInit(25, 38);call #Ultimate.allocInit(31, 39);call #Ultimate.allocInit(20, 40);call #Ultimate.allocInit(10, 41);call #Ultimate.allocInit(20, 42);call #Ultimate.allocInit(12, 43);call #Ultimate.allocInit(20, 44);call #Ultimate.allocInit(43, 45);call #Ultimate.allocInit(221, 46);call #Ultimate.allocInit(15, 47);call #Ultimate.allocInit(40, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(29, 50);call #Ultimate.allocInit(50, 51);call #Ultimate.allocInit(20, 52);call #Ultimate.allocInit(12, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(221, 55);call #Ultimate.allocInit(32, 56);call #Ultimate.allocInit(32, 57);call #Ultimate.allocInit(12, 58);call #Ultimate.allocInit(20, 59);call #Ultimate.allocInit(221, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(11, 62);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(20, 64);call #Ultimate.allocInit(221, 65);call #Ultimate.allocInit(10, 66);call #Ultimate.allocInit(10, 67);call #Ultimate.allocInit(12, 68);call #Ultimate.allocInit(20, 69);call #Ultimate.allocInit(221, 70);call #Ultimate.allocInit(37, 71);call #Ultimate.allocInit(37, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(35, 74);call #Ultimate.allocInit(24, 75);call #Ultimate.allocInit(32, 76);call #Ultimate.allocInit(29, 77);call #Ultimate.allocInit(29, 78);call #Ultimate.allocInit(19, 79);call #Ultimate.allocInit(45, 80);call #Ultimate.allocInit(19, 81);call #Ultimate.allocInit(8, 82);call #Ultimate.allocInit(26, 83);call #Ultimate.allocInit(40, 84);call #Ultimate.allocInit(12, 85);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset := 86, 0;call #Ultimate.allocInit(8, 86);call write~init~$Pointer$(0, 0, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8);~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset := 87, 0;call #Ultimate.allocInit(64, 87);call write~init~int(0, ~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 4 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 8 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 12 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-11, ~#hrsl_to_error~0.base, 16 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-32, ~#hrsl_to_error~0.base, 20 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 24 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 28 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-121, ~#hrsl_to_error~0.base, 32 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 36 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 40 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 44 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 48 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 52 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-62, ~#hrsl_to_error~0.base, 56 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-75, ~#hrsl_to_error~0.base, 60 + ~#hrsl_to_error~0.offset, 4);~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset := 88, 0;call #Ultimate.allocInit(340, 88);call write~init~$Pointer$(73, 0, ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(74, 0, ~#max3421_hcd_desc~0.base, 8 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(192, ~#max3421_hcd_desc~0.base, 16 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 24 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(16, ~#max3421_hcd_desc~0.base, 32 + ~#max3421_hcd_desc~0.offset, 4);call write~init~$Pointer$(#funAddr~max3421_reset.base, #funAddr~max3421_reset.offset, ~#max3421_hcd_desc~0.base, 36 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_start.base, #funAddr~max3421_start.offset, ~#max3421_hcd_desc~0.base, 44 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 52 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 60 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_stop.base, #funAddr~max3421_stop.offset, ~#max3421_hcd_desc~0.base, 68 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 76 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_get_frame_number.base, #funAddr~max3421_get_frame_number.offset, ~#max3421_hcd_desc~0.base, 84 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_enqueue.base, #funAddr~max3421_urb_enqueue.offset, ~#max3421_hcd_desc~0.base, 92 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_dequeue.base, #funAddr~max3421_urb_dequeue.offset, ~#max3421_hcd_desc~0.base, 100 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_map_urb_for_dma.base, #funAddr~max3421_map_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 108 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_unmap_urb_for_dma.base, #funAddr~max3421_unmap_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 116 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_endpoint_disable.base, #funAddr~max3421_endpoint_disable.offset, ~#max3421_hcd_desc~0.base, 124 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 132 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_status_data.base, #funAddr~max3421_hub_status_data.offset, ~#max3421_hcd_desc~0.base, 140 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_control.base, #funAddr~max3421_hub_control.offset, ~#max3421_hcd_desc~0.base, 148 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_suspend.base, #funAddr~max3421_bus_suspend.offset, ~#max3421_hcd_desc~0.base, 156 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_resume.base, #funAddr~max3421_bus_resume.offset, ~#max3421_hcd_desc~0.base, 164 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 172 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 180 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 188 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 196 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 204 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 212 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 220 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 228 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 236 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 244 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 252 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 260 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 268 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 276 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 284 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 292 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 300 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 308 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 316 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 324 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 332 + ~#max3421_hcd_desc~0.offset, 8);~#max3421_driver~0.base, ~#max3421_driver~0.offset := 89, 0;call #Ultimate.allocInit(161, 89);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_probe.base, #funAddr~max3421_probe.offset, ~#max3421_driver~0.base, 8 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_remove.base, #funAddr~max3421_remove.offset, ~#max3421_driver~0.base, 16 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 24 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 32 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 40 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(85, 0, ~#max3421_driver~0.base, 48 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 56 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#max3421_driver~0.base, 64 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 72 + ~#max3421_driver~0.offset, 8);call write~init~int(0, ~#max3421_driver~0.base, 80 + ~#max3421_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 81 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 89 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 97 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 105 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 113 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 121 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 129 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 137 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 145 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 153 + ~#max3421_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_spin~0 := 0; {5917#true} is VALID [2022-02-20 21:58:03,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset, main_#t~ret574#1, main_#t~ret575#1, main_#t~ret576#1.base, main_#t~ret576#1.offset, main_#t~ret577#1, main_#t~ret578#1.base, main_#t~ret578#1.offset, main_#t~nondet579#1, main_#t~ret580#1, main_#t~nondet581#1, main_#t~nondet582#1, main_#t~nondet583#1, main_#t~switch584#1, main_#t~nondet585#1, main_#t~switch586#1, main_#t~ret587#1, main_#t~nondet588#1, main_#t~switch589#1, main_#t~ret590#1, main_#t~ret591#1, main_#t~ret592#1, main_#t~ret593#1, main_#t~ret594#1, main_#t~ret595#1, main_#t~ret596#1, main_#t~ret597#1, main_#t~ret598#1, main_#t~ret599#1, main_#t~ret600#1, main_#t~ret601#1, main_#t~ret602#1, main_#t~ret603#1, main_#t~ret604#1, main_#t~ret605#1, main_#t~ret606#1, main_#t~ret607#1, main_#t~ret608#1, main_#t~nondet609#1, main_#t~switch610#1, main_#t~ret611#1, main_#t~ret612#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~ldvarg3~0#1, main_~tmp___0~25#1, main_~ldvarg0~0#1, main_~tmp___1~13#1, main_~ldvarg5~0#1, main_~ldvarg6~0#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~ldvarg1~0#1, main_~tmp___3~5#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset, main_~ldvarg9~0#1, main_~tmp___5~4#1, main_~ldvarg2~0#1, main_~tmp___6~4#1, main_~tmp___7~3#1, main_~tmp___8~3#1, main_~tmp___9~2#1, main_~tmp___10~1#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~25#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg5~0#1;havoc main_~ldvarg6~0#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___3~5#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;havoc main_~ldvarg9~0#1;havoc main_~tmp___5~4#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___6~4#1;havoc main_~tmp___7~3#1;havoc main_~tmp___8~3#1;havoc main_~tmp___9~2#1;havoc main_~tmp___10~1#1; {5917#true} is VALID [2022-02-20 21:58:03,632 INFO L272 TraceCheckUtils]: 2: Hoare triple {5917#true} call main_#t~ret573#1.base, main_#t~ret573#1.offset := ldv_zalloc(1); {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:03,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {5917#true} is VALID [2022-02-20 21:58:03,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {5917#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {5917#true} is VALID [2022-02-20 21:58:03,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,632 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5917#true} {5917#true} #1333#return; {5917#true} is VALID [2022-02-20 21:58:03,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret573#1.base, main_#t~ret573#1.offset;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_#t~ret574#1 := __VERIFIER_nondet_u16();main_~tmp___0~25#1 := main_#t~ret574#1;havoc main_#t~ret574#1;main_~ldvarg3~0#1 := main_~tmp___0~25#1;call main_#t~ret575#1 := __VERIFIER_nondet_u16();main_~tmp___1~13#1 := main_#t~ret575#1;havoc main_#t~ret575#1;main_~ldvarg0~0#1 := main_~tmp___1~13#1; {5917#true} is VALID [2022-02-20 21:58:03,633 INFO L272 TraceCheckUtils]: 8: Hoare triple {5917#true} call main_#t~ret576#1.base, main_#t~ret576#1.offset := ldv_zalloc(72); {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:03,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {5917#true} is VALID [2022-02-20 21:58:03,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {5917#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {5917#true} is VALID [2022-02-20 21:58:03,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,634 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5917#true} {5917#true} #1335#return; {5917#true} is VALID [2022-02-20 21:58:03,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#true} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret576#1.base, main_#t~ret576#1.offset;havoc main_#t~ret576#1.base, main_#t~ret576#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;call main_#t~ret577#1 := __VERIFIER_nondet_u16();main_~tmp___3~5#1 := main_#t~ret577#1;havoc main_#t~ret577#1;main_~ldvarg1~0#1 := main_~tmp___3~5#1; {5917#true} is VALID [2022-02-20 21:58:03,641 INFO L272 TraceCheckUtils]: 14: Hoare triple {5917#true} call main_#t~ret578#1.base, main_#t~ret578#1.offset := ldv_zalloc(1); {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:03,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {5943#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {5917#true} is VALID [2022-02-20 21:58:03,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {5917#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {5917#true} is VALID [2022-02-20 21:58:03,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,642 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5917#true} {5917#true} #1337#return; {5917#true} is VALID [2022-02-20 21:58:03,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {5917#true} main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset := main_#t~ret578#1.base, main_#t~ret578#1.offset;havoc main_#t~ret578#1.base, main_#t~ret578#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;assume -2147483648 <= main_#t~nondet579#1 && main_#t~nondet579#1 <= 2147483647;main_~tmp___5~4#1 := main_#t~nondet579#1;havoc main_#t~nondet579#1;main_~ldvarg9~0#1 := main_~tmp___5~4#1;call main_#t~ret580#1 := __VERIFIER_nondet_u16();main_~tmp___6~4#1 := main_#t~ret580#1;havoc main_#t~ret580#1;main_~ldvarg2~0#1 := main_~tmp___6~4#1;assume { :begin_inline_ldv_initialize } true; {5917#true} is VALID [2022-02-20 21:58:03,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {5917#true} assume { :end_inline_ldv_initialize } true;assume -2147483648 <= main_#t~nondet581#1 && main_#t~nondet581#1 <= 2147483647;main_~ldvarg5~0#1 := main_#t~nondet581#1;havoc main_#t~nondet581#1;assume -2147483648 <= main_#t~nondet582#1 && main_#t~nondet582#1 <= 2147483647;main_~ldvarg6~0#1 := main_#t~nondet582#1;havoc main_#t~nondet582#1;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {5931#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:58:03,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {5931#(= ~ldv_state_variable_3~0 0)} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {5931#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:58:03,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {5931#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {5931#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:58:03,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {5931#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 2 == main_~tmp___7~3#1; {5931#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:58:03,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {5931#(= ~ldv_state_variable_3~0 0)} assume main_#t~switch584#1; {5931#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:58:03,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {5931#(= ~ldv_state_variable_3~0 0)} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet588#1 && main_#t~nondet588#1 <= 2147483647;main_~tmp___9~2#1 := main_#t~nondet588#1;havoc main_#t~nondet588#1;main_#t~switch589#1 := 0 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 1 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 2 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 3 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 4 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 5 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 6 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 7 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 8 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 9 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {5918#false} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 10 == main_~tmp___9~2#1; {5918#false} is VALID [2022-02-20 21:58:03,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {5918#false} assume main_#t~switch589#1; {5918#false} is VALID [2022-02-20 21:58:03,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {5918#false} assume !(1 == ~ldv_state_variable_3~0); {5918#false} is VALID [2022-02-20 21:58:03,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {5918#false} assume 2 == ~ldv_state_variable_3~0; {5918#false} is VALID [2022-02-20 21:58:03,646 INFO L272 TraceCheckUtils]: 39: Hoare triple {5918#false} call main_#t~ret604#1 := max3421_urb_enqueue(~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset, ~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset, main_~ldvarg5~0#1); {5918#false} is VALID [2022-02-20 21:58:03,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {5918#false} ~hcd#1.base, ~hcd#1.offset := #in~hcd#1.base, #in~hcd#1.offset;~urb#1.base, ~urb#1.offset := #in~urb#1.base, #in~urb#1.offset;~mem_flags#1 := #in~mem_flags#1;havoc ~spi~12#1.base, ~spi~12#1.offset;havoc ~tmp~35#1.base, ~tmp~35#1.offset;havoc ~max3421_hcd~26#1.base, ~max3421_hcd~26#1.offset;havoc ~tmp___0~19#1.base, ~tmp___0~19#1.offset;havoc ~max3421_ep~6#1.base, ~max3421_ep~6#1.offset;havoc ~flags~5#1;havoc ~retval~1#1;havoc ~tmp___1~10#1.base, ~tmp___1~10#1.offset;call #t~mem446#1.base, #t~mem446#1.offset := read~$Pointer$(~hcd#1.base, ~hcd#1.offset, 8); {5918#false} is VALID [2022-02-20 21:58:03,647 INFO L272 TraceCheckUtils]: 41: Hoare triple {5918#false} call #t~ret447#1.base, #t~ret447#1.offset := to_spi_device(#t~mem446#1.base, #t~mem446#1.offset); {5917#true} is VALID [2022-02-20 21:58:03,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {5917#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~__mptr~0.base, ~__mptr~0.offset;havoc ~tmp~6.base, ~tmp~6.offset; {5917#true} is VALID [2022-02-20 21:58:03,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {5917#true} assume 0 != (~dev.base + ~dev.offset) % 18446744073709551616;~__mptr~0.base, ~__mptr~0.offset := ~dev.base, ~dev.offset;~tmp~6.base, ~tmp~6.offset := ~__mptr~0.base, ~__mptr~0.offset; {5917#true} is VALID [2022-02-20 21:58:03,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {5917#true} #res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {5917#true} is VALID [2022-02-20 21:58:03,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,647 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5917#true} {5918#false} #1305#return; {5918#false} is VALID [2022-02-20 21:58:03,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {5918#false} ~tmp~35#1.base, ~tmp~35#1.offset := #t~ret447#1.base, #t~ret447#1.offset;havoc #t~mem446#1.base, #t~mem446#1.offset;havoc #t~ret447#1.base, #t~ret447#1.offset;~spi~12#1.base, ~spi~12#1.offset := ~tmp~35#1.base, ~tmp~35#1.offset; {5918#false} is VALID [2022-02-20 21:58:03,648 INFO L272 TraceCheckUtils]: 48: Hoare triple {5918#false} call #t~ret448#1.base, #t~ret448#1.offset := hcd_to_max3421(~hcd#1.base, ~hcd#1.offset); {5917#true} is VALID [2022-02-20 21:58:03,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {5917#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {5917#true} is VALID [2022-02-20 21:58:03,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,648 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5917#true} {5918#false} #1307#return; {5918#false} is VALID [2022-02-20 21:58:03,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {5918#false} ~tmp___0~19#1.base, ~tmp___0~19#1.offset := #t~ret448#1.base, #t~ret448#1.offset;havoc #t~ret448#1.base, #t~ret448#1.offset;~max3421_hcd~26#1.base, ~max3421_hcd~26#1.offset := ~tmp___0~19#1.base, ~tmp___0~19#1.offset;call #t~mem449#1 := read~int(~urb#1.base, 80 + ~urb#1.offset, 4);#t~switch450#1 := 1 == #t~mem449#1 / 1073741824; {5918#false} is VALID [2022-02-20 21:58:03,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {5918#false} assume #t~switch450#1; {5918#false} is VALID [2022-02-20 21:58:03,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {5918#false} #t~switch450#1 := #t~switch450#1 || 0 == #t~mem449#1 / 1073741824; {5918#false} is VALID [2022-02-20 21:58:03,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {5918#false} assume !#t~switch450#1; {5918#false} is VALID [2022-02-20 21:58:03,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {5918#false} #t~switch450#1 := true; {5918#false} is VALID [2022-02-20 21:58:03,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {5918#false} assume #t~switch450#1; {5918#false} is VALID [2022-02-20 21:58:03,649 INFO L272 TraceCheckUtils]: 58: Hoare triple {5918#false} call ldv_spin_lock(); {5944#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 21:58:03,650 INFO L290 TraceCheckUtils]: 59: Hoare triple {5944#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {5917#true} is VALID [2022-02-20 21:58:03,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-02-20 21:58:03,650 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5917#true} {5918#false} #1309#return; {5918#false} is VALID [2022-02-20 21:58:03,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {5918#false} call #t~mem454#1.base, #t~mem454#1.offset := read~$Pointer$(~urb#1.base, 72 + ~urb#1.offset, 8);call #t~mem455#1.base, #t~mem455#1.offset := read~$Pointer$(#t~mem454#1.base, 31 + #t~mem454#1.offset, 8);~max3421_ep~6#1.base, ~max3421_ep~6#1.offset := #t~mem455#1.base, #t~mem455#1.offset;havoc #t~mem454#1.base, #t~mem454#1.offset;havoc #t~mem455#1.base, #t~mem455#1.offset; {5918#false} is VALID [2022-02-20 21:58:03,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {5918#false} assume 0 == (~max3421_ep~6#1.base + ~max3421_ep~6#1.offset) % 18446744073709551616;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 40, ~mem_flags#1;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_~size#1, kzalloc_~flags#1;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1; {5918#false} is VALID [2022-02-20 21:58:03,651 INFO L272 TraceCheckUtils]: 64: Hoare triple {5918#false} call ldv_check_alloc_flags(kzalloc_~flags#1); {5918#false} is VALID [2022-02-20 21:58:03,651 INFO L290 TraceCheckUtils]: 65: Hoare triple {5918#false} ~flags := #in~flags; {5918#false} is VALID [2022-02-20 21:58:03,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {5918#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {5918#false} is VALID [2022-02-20 21:58:03,651 INFO L272 TraceCheckUtils]: 67: Hoare triple {5918#false} call ldv_error(); {5918#false} is VALID [2022-02-20 21:58:03,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {5918#false} assume !false; {5918#false} is VALID [2022-02-20 21:58:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 21:58:03,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:03,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886808133] [2022-02-20 21:58:03,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886808133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:03,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:03,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:58:03,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055815719] [2022-02-20 21:58:03,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2022-02-20 21:58:03,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:03,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:03,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:03,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:58:03,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:03,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:58:03,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:58:03,697 INFO L87 Difference]: Start difference. First operand 907 states and 1262 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:07,425 INFO L93 Difference]: Finished difference Result 2159 states and 2998 transitions. [2022-02-20 21:58:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:58:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2022-02-20 21:58:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1794 transitions. [2022-02-20 21:58:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1794 transitions. [2022-02-20 21:58:07,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 1794 transitions. [2022-02-20 21:58:08,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1794 edges. 1794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:08,769 INFO L225 Difference]: With dead ends: 2159 [2022-02-20 21:58:08,769 INFO L226 Difference]: Without dead ends: 1279 [2022-02-20 21:58:08,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:58:08,776 INFO L933 BasicCegarLoop]: 822 mSDtfsCounter, 630 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:08,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [679 Valid, 2064 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 21:58:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2022-02-20 21:58:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1196. [2022-02-20 21:58:08,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:08,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1279 states. Second operand has 1196 states, 903 states have (on average 1.3565891472868217) internal successors, (1225), 908 states have internal predecessors, (1225), 210 states have call successors, (210), 83 states have call predecessors, (210), 82 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:08,837 INFO L74 IsIncluded]: Start isIncluded. First operand 1279 states. Second operand has 1196 states, 903 states have (on average 1.3565891472868217) internal successors, (1225), 908 states have internal predecessors, (1225), 210 states have call successors, (210), 83 states have call predecessors, (210), 82 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:08,839 INFO L87 Difference]: Start difference. First operand 1279 states. Second operand has 1196 states, 903 states have (on average 1.3565891472868217) internal successors, (1225), 908 states have internal predecessors, (1225), 210 states have call successors, (210), 83 states have call predecessors, (210), 82 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:08,901 INFO L93 Difference]: Finished difference Result 1279 states and 1766 transitions. [2022-02-20 21:58:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1766 transitions. [2022-02-20 21:58:08,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:08,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:08,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 1196 states, 903 states have (on average 1.3565891472868217) internal successors, (1225), 908 states have internal predecessors, (1225), 210 states have call successors, (210), 83 states have call predecessors, (210), 82 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) Second operand 1279 states. [2022-02-20 21:58:08,910 INFO L87 Difference]: Start difference. First operand has 1196 states, 903 states have (on average 1.3565891472868217) internal successors, (1225), 908 states have internal predecessors, (1225), 210 states have call successors, (210), 83 states have call predecessors, (210), 82 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) Second operand 1279 states. [2022-02-20 21:58:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:08,977 INFO L93 Difference]: Finished difference Result 1279 states and 1766 transitions. [2022-02-20 21:58:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1766 transitions. [2022-02-20 21:58:08,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:08,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:08,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:08,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 903 states have (on average 1.3565891472868217) internal successors, (1225), 908 states have internal predecessors, (1225), 210 states have call successors, (210), 83 states have call predecessors, (210), 82 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1644 transitions. [2022-02-20 21:58:09,054 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1644 transitions. Word has length 69 [2022-02-20 21:58:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:09,055 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 1644 transitions. [2022-02-20 21:58:09,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1644 transitions. [2022-02-20 21:58:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 21:58:09,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:09,058 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2022-02-20 21:58:09,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:58:09,059 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1198872686, now seen corresponding path program 1 times [2022-02-20 21:58:09,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:09,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803048604] [2022-02-20 21:58:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:58:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1333#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:58:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1335#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:58:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1337#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 21:58:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1349#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:58:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1351#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:58:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1353#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 21:58:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {13050#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___0~0 := #t~nondet34;havoc #t~nondet34; {13012#true} is VALID [2022-02-20 21:58:09,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1407#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 21:58:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {13012#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {13012#true} is VALID [2022-02-20 21:58:09,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1409#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 21:58:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:09,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {13051#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~list.base, ~list.offset := #in~list.base, #in~list.offset;call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 8);call write~$Pointer$(~list.base, ~list.offset, ~list.base, 8 + ~list.offset, 8); {13012#true} is VALID [2022-02-20 21:58:09,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1411#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {13012#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(101, 2);call #Ultimate.allocInit(20, 3);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(50, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(29, 8);call #Ultimate.allocInit(221, 9);call #Ultimate.allocInit(23, 10);call #Ultimate.allocInit(23, 11);call #Ultimate.allocInit(29, 12);call #Ultimate.allocInit(12, 13);call #Ultimate.allocInit(21, 14);call #Ultimate.allocInit(221, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(23, 17);call #Ultimate.allocInit(21, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(21, 20);call #Ultimate.allocInit(221, 21);call #Ultimate.allocInit(33, 22);call #Ultimate.allocInit(33, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(21, 26);call #Ultimate.allocInit(221, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(33, 29);call #Ultimate.allocInit(21, 30);call #Ultimate.allocInit(12, 31);call #Ultimate.allocInit(21, 32);call #Ultimate.allocInit(221, 33);call #Ultimate.allocInit(33, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(21, 36);call #Ultimate.allocInit(50, 37);call #Ultimate.allocInit(25, 38);call #Ultimate.allocInit(31, 39);call #Ultimate.allocInit(20, 40);call #Ultimate.allocInit(10, 41);call #Ultimate.allocInit(20, 42);call #Ultimate.allocInit(12, 43);call #Ultimate.allocInit(20, 44);call #Ultimate.allocInit(43, 45);call #Ultimate.allocInit(221, 46);call #Ultimate.allocInit(15, 47);call #Ultimate.allocInit(40, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(29, 50);call #Ultimate.allocInit(50, 51);call #Ultimate.allocInit(20, 52);call #Ultimate.allocInit(12, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(221, 55);call #Ultimate.allocInit(32, 56);call #Ultimate.allocInit(32, 57);call #Ultimate.allocInit(12, 58);call #Ultimate.allocInit(20, 59);call #Ultimate.allocInit(221, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(11, 62);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(20, 64);call #Ultimate.allocInit(221, 65);call #Ultimate.allocInit(10, 66);call #Ultimate.allocInit(10, 67);call #Ultimate.allocInit(12, 68);call #Ultimate.allocInit(20, 69);call #Ultimate.allocInit(221, 70);call #Ultimate.allocInit(37, 71);call #Ultimate.allocInit(37, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(35, 74);call #Ultimate.allocInit(24, 75);call #Ultimate.allocInit(32, 76);call #Ultimate.allocInit(29, 77);call #Ultimate.allocInit(29, 78);call #Ultimate.allocInit(19, 79);call #Ultimate.allocInit(45, 80);call #Ultimate.allocInit(19, 81);call #Ultimate.allocInit(8, 82);call #Ultimate.allocInit(26, 83);call #Ultimate.allocInit(40, 84);call #Ultimate.allocInit(12, 85);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset := 86, 0;call #Ultimate.allocInit(8, 86);call write~init~$Pointer$(0, 0, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8);~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset := 87, 0;call #Ultimate.allocInit(64, 87);call write~init~int(0, ~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 4 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 8 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 12 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-11, ~#hrsl_to_error~0.base, 16 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-32, ~#hrsl_to_error~0.base, 20 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 24 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 28 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-121, ~#hrsl_to_error~0.base, 32 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 36 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 40 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 44 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 48 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 52 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-62, ~#hrsl_to_error~0.base, 56 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-75, ~#hrsl_to_error~0.base, 60 + ~#hrsl_to_error~0.offset, 4);~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset := 88, 0;call #Ultimate.allocInit(340, 88);call write~init~$Pointer$(73, 0, ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(74, 0, ~#max3421_hcd_desc~0.base, 8 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(192, ~#max3421_hcd_desc~0.base, 16 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 24 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(16, ~#max3421_hcd_desc~0.base, 32 + ~#max3421_hcd_desc~0.offset, 4);call write~init~$Pointer$(#funAddr~max3421_reset.base, #funAddr~max3421_reset.offset, ~#max3421_hcd_desc~0.base, 36 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_start.base, #funAddr~max3421_start.offset, ~#max3421_hcd_desc~0.base, 44 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 52 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 60 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_stop.base, #funAddr~max3421_stop.offset, ~#max3421_hcd_desc~0.base, 68 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 76 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_get_frame_number.base, #funAddr~max3421_get_frame_number.offset, ~#max3421_hcd_desc~0.base, 84 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_enqueue.base, #funAddr~max3421_urb_enqueue.offset, ~#max3421_hcd_desc~0.base, 92 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_dequeue.base, #funAddr~max3421_urb_dequeue.offset, ~#max3421_hcd_desc~0.base, 100 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_map_urb_for_dma.base, #funAddr~max3421_map_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 108 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_unmap_urb_for_dma.base, #funAddr~max3421_unmap_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 116 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_endpoint_disable.base, #funAddr~max3421_endpoint_disable.offset, ~#max3421_hcd_desc~0.base, 124 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 132 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_status_data.base, #funAddr~max3421_hub_status_data.offset, ~#max3421_hcd_desc~0.base, 140 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_control.base, #funAddr~max3421_hub_control.offset, ~#max3421_hcd_desc~0.base, 148 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_suspend.base, #funAddr~max3421_bus_suspend.offset, ~#max3421_hcd_desc~0.base, 156 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_resume.base, #funAddr~max3421_bus_resume.offset, ~#max3421_hcd_desc~0.base, 164 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 172 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 180 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 188 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 196 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 204 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 212 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 220 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 228 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 236 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 244 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 252 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 260 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 268 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 276 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 284 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 292 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 300 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 308 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 316 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 324 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 332 + ~#max3421_hcd_desc~0.offset, 8);~#max3421_driver~0.base, ~#max3421_driver~0.offset := 89, 0;call #Ultimate.allocInit(161, 89);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_probe.base, #funAddr~max3421_probe.offset, ~#max3421_driver~0.base, 8 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_remove.base, #funAddr~max3421_remove.offset, ~#max3421_driver~0.base, 16 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 24 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 32 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 40 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(85, 0, ~#max3421_driver~0.base, 48 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 56 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#max3421_driver~0.base, 64 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 72 + ~#max3421_driver~0.offset, 8);call write~init~int(0, ~#max3421_driver~0.base, 80 + ~#max3421_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 81 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 89 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 97 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 105 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 113 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 121 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 129 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 137 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 145 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 153 + ~#max3421_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_spin~0 := 0; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {13014#(= ~ldv_spin~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset, main_#t~ret574#1, main_#t~ret575#1, main_#t~ret576#1.base, main_#t~ret576#1.offset, main_#t~ret577#1, main_#t~ret578#1.base, main_#t~ret578#1.offset, main_#t~nondet579#1, main_#t~ret580#1, main_#t~nondet581#1, main_#t~nondet582#1, main_#t~nondet583#1, main_#t~switch584#1, main_#t~nondet585#1, main_#t~switch586#1, main_#t~ret587#1, main_#t~nondet588#1, main_#t~switch589#1, main_#t~ret590#1, main_#t~ret591#1, main_#t~ret592#1, main_#t~ret593#1, main_#t~ret594#1, main_#t~ret595#1, main_#t~ret596#1, main_#t~ret597#1, main_#t~ret598#1, main_#t~ret599#1, main_#t~ret600#1, main_#t~ret601#1, main_#t~ret602#1, main_#t~ret603#1, main_#t~ret604#1, main_#t~ret605#1, main_#t~ret606#1, main_#t~ret607#1, main_#t~ret608#1, main_#t~nondet609#1, main_#t~switch610#1, main_#t~ret611#1, main_#t~ret612#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~ldvarg3~0#1, main_~tmp___0~25#1, main_~ldvarg0~0#1, main_~tmp___1~13#1, main_~ldvarg5~0#1, main_~ldvarg6~0#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~ldvarg1~0#1, main_~tmp___3~5#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset, main_~ldvarg9~0#1, main_~tmp___5~4#1, main_~ldvarg2~0#1, main_~tmp___6~4#1, main_~tmp___7~3#1, main_~tmp___8~3#1, main_~tmp___9~2#1, main_~tmp___10~1#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~25#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg5~0#1;havoc main_~ldvarg6~0#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___3~5#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;havoc main_~ldvarg9~0#1;havoc main_~tmp___5~4#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___6~4#1;havoc main_~tmp___7~3#1;havoc main_~tmp___8~3#1;havoc main_~tmp___9~2#1;havoc main_~tmp___10~1#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,375 INFO L272 TraceCheckUtils]: 2: Hoare triple {13014#(= ~ldv_spin~0 0)} call main_#t~ret573#1.base, main_#t~ret573#1.offset := ldv_zalloc(1); {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:09,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,376 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1333#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {13014#(= ~ldv_spin~0 0)} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret573#1.base, main_#t~ret573#1.offset;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_#t~ret574#1 := __VERIFIER_nondet_u16();main_~tmp___0~25#1 := main_#t~ret574#1;havoc main_#t~ret574#1;main_~ldvarg3~0#1 := main_~tmp___0~25#1;call main_#t~ret575#1 := __VERIFIER_nondet_u16();main_~tmp___1~13#1 := main_#t~ret575#1;havoc main_#t~ret575#1;main_~ldvarg0~0#1 := main_~tmp___1~13#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,376 INFO L272 TraceCheckUtils]: 8: Hoare triple {13014#(= ~ldv_spin~0 0)} call main_#t~ret576#1.base, main_#t~ret576#1.offset := ldv_zalloc(72); {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:09,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,381 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1335#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {13014#(= ~ldv_spin~0 0)} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret576#1.base, main_#t~ret576#1.offset;havoc main_#t~ret576#1.base, main_#t~ret576#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;call main_#t~ret577#1 := __VERIFIER_nondet_u16();main_~tmp___3~5#1 := main_#t~ret577#1;havoc main_#t~ret577#1;main_~ldvarg1~0#1 := main_~tmp___3~5#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,382 INFO L272 TraceCheckUtils]: 14: Hoare triple {13014#(= ~ldv_spin~0 0)} call main_#t~ret578#1.base, main_#t~ret578#1.offset := ldv_zalloc(1); {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:09,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,383 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1337#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {13014#(= ~ldv_spin~0 0)} main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset := main_#t~ret578#1.base, main_#t~ret578#1.offset;havoc main_#t~ret578#1.base, main_#t~ret578#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;assume -2147483648 <= main_#t~nondet579#1 && main_#t~nondet579#1 <= 2147483647;main_~tmp___5~4#1 := main_#t~nondet579#1;havoc main_#t~nondet579#1;main_~ldvarg9~0#1 := main_~tmp___5~4#1;call main_#t~ret580#1 := __VERIFIER_nondet_u16();main_~tmp___6~4#1 := main_#t~ret580#1;havoc main_#t~ret580#1;main_~ldvarg2~0#1 := main_~tmp___6~4#1;assume { :begin_inline_ldv_initialize } true; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {13014#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_initialize } true;assume -2147483648 <= main_#t~nondet581#1 && main_#t~nondet581#1 <= 2147483647;main_~ldvarg5~0#1 := main_#t~nondet581#1;havoc main_#t~nondet581#1;assume -2147483648 <= main_#t~nondet582#1 && main_#t~nondet582#1 <= 2147483647;main_~ldvarg6~0#1 := main_#t~nondet582#1;havoc main_#t~nondet582#1;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {13014#(= ~ldv_spin~0 0)} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {13014#(= ~ldv_spin~0 0)} assume main_#t~switch584#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {13014#(= ~ldv_spin~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet585#1 && main_#t~nondet585#1 <= 2147483647;main_~tmp___8~3#1 := main_#t~nondet585#1;havoc main_#t~nondet585#1;main_#t~switch586#1 := 0 == main_~tmp___8~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !main_#t~switch586#1;main_#t~switch586#1 := main_#t~switch586#1 || 1 == main_~tmp___8~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {13014#(= ~ldv_spin~0 0)} assume main_#t~switch586#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {13014#(= ~ldv_spin~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_max3421_driver_init } true;havoc max3421_driver_init_#res#1;havoc max3421_driver_init_#t~ret560#1, max3421_driver_init_~tmp~43#1;havoc max3421_driver_init_~tmp~43#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#max3421_driver~0.base, ~#max3421_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet629#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet629#1 && spi_register_driver_#t~nondet629#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet629#1;havoc spi_register_driver_#t~nondet629#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {13014#(= ~ldv_spin~0 0)} max3421_driver_init_#t~ret560#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= max3421_driver_init_#t~ret560#1 && max3421_driver_init_#t~ret560#1 <= 2147483647;max3421_driver_init_~tmp~43#1 := max3421_driver_init_#t~ret560#1;havoc max3421_driver_init_#t~ret560#1;max3421_driver_init_#res#1 := max3421_driver_init_~tmp~43#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {13014#(= ~ldv_spin~0 0)} main_#t~ret587#1 := max3421_driver_init_#res#1;assume { :end_inline_max3421_driver_init } true;assume -2147483648 <= main_#t~ret587#1 && main_#t~ret587#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret587#1;havoc main_#t~ret587#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {13014#(= ~ldv_spin~0 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_spi_driver_2 } true;havoc ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset, ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset;havoc ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,396 INFO L272 TraceCheckUtils]: 31: Hoare triple {13014#(= ~ldv_spin~0 0)} call ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset := ldv_zalloc(1496); {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:09,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,397 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1349#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {13014#(= ~ldv_spin~0 0)} ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset := ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset;havoc ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {13014#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_initialize_spi_driver_2 } true;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_initialize_hc_driver_3 } true;havoc ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset, ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset, ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset, ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset;havoc ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset;havoc ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,399 INFO L272 TraceCheckUtils]: 38: Hoare triple {13014#(= ~ldv_spin~0 0)} call ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset := ldv_zalloc(192); {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:09,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,400 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1351#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {13014#(= ~ldv_spin~0 0)} ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset := ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset;havoc ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,400 INFO L272 TraceCheckUtils]: 44: Hoare triple {13014#(= ~ldv_spin~0 0)} call ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset := ldv_zalloc(968); {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:09,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {13049#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {13012#true} is VALID [2022-02-20 21:58:09,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {13012#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,401 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1353#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {13014#(= ~ldv_spin~0 0)} ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset := ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset;havoc ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {13014#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_initialize_hc_driver_3 } true; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !(0 != ~ldv_retval_0~0); {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {13014#(= ~ldv_spin~0 0)} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 2 == main_~tmp___7~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 3 == main_~tmp___7~3#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {13014#(= ~ldv_spin~0 0)} assume main_#t~switch584#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,410 INFO L290 TraceCheckUtils]: 57: Hoare triple {13014#(= ~ldv_spin~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet609#1 && main_#t~nondet609#1 <= 2147483647;main_~tmp___10~1#1 := main_#t~nondet609#1;havoc main_#t~nondet609#1;main_#t~switch610#1 := 0 == main_~tmp___10~1#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {13014#(= ~ldv_spin~0 0)} assume main_#t~switch610#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {13014#(= ~ldv_spin~0 0)} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_max3421_probe } true;max3421_probe_#in~spi#1.base, max3421_probe_#in~spi#1.offset := ~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset;havoc max3421_probe_#res#1;havoc max3421_probe_#t~ret520#1, max3421_probe_#t~nondet521#1, max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset, max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset, max3421_probe_#t~nondet524#1, max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset, max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset, max3421_probe_#t~ret527#1.base, max3421_probe_#t~ret527#1.offset, max3421_probe_#t~mem528#1.base, max3421_probe_#t~mem528#1.offset, max3421_probe_#t~nondet529#1, max3421_probe_#t~ret530#1.base, max3421_probe_#t~ret530#1.offset, max3421_probe_#t~mem531#1.base, max3421_probe_#t~mem531#1.offset, max3421_probe_#t~nondet532#1, max3421_probe_#t~nondet533#1.base, max3421_probe_#t~nondet533#1.offset, max3421_probe_#t~ret534#1, max3421_probe_#t~ret535#1, max3421_probe_#t~ret536#1.base, max3421_probe_#t~ret536#1.offset, max3421_probe_#t~mem537#1.base, max3421_probe_#t~mem537#1.offset, max3421_probe_#t~nondet538#1, max3421_probe_#t~ret539#1, max3421_probe_#t~nondet540#1, max3421_probe_#t~mem541#1, max3421_probe_#t~ret542#1, max3421_probe_#t~nondet543#1, max3421_probe_#t~mem544#1, max3421_probe_#t~mem545#1.base, max3421_probe_#t~mem545#1.offset, max3421_probe_#t~mem546#1.base, max3421_probe_#t~mem546#1.offset, max3421_probe_#t~mem547#1.base, max3421_probe_#t~mem547#1.offset, max3421_probe_#t~mem548#1.base, max3421_probe_#t~mem548#1.offset, max3421_probe_#t~ret549#1, max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset, max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset, max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset, max3421_probe_~retval~5#1, max3421_probe_~tmp~42#1, max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset, max3421_probe_~tmp___1~12#1.base, max3421_probe_~tmp___1~12#1.offset, max3421_probe_~tmp___2~5#1.base, max3421_probe_~tmp___2~5#1.offset, max3421_probe_~__k~0#1.base, max3421_probe_~__k~0#1.offset, max3421_probe_~tmp___3~4#1.base, max3421_probe_~tmp___3~4#1.offset, max3421_probe_~tmp___4~3#1, max3421_probe_~tmp___5~3#1, max3421_probe_~tmp___6~3#1.base, max3421_probe_~tmp___6~3#1.offset;max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset := max3421_probe_#in~spi#1.base, max3421_probe_#in~spi#1.offset;havoc max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset;havoc max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset;havoc max3421_probe_~retval~5#1;havoc max3421_probe_~tmp~42#1;havoc max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset;havoc max3421_probe_~tmp___1~12#1.base, max3421_probe_~tmp___1~12#1.offset;havoc max3421_probe_~tmp___2~5#1.base, max3421_probe_~tmp___2~5#1.offset;havoc max3421_probe_~__k~0#1.base, max3421_probe_~__k~0#1.offset;havoc max3421_probe_~tmp___3~4#1.base, max3421_probe_~tmp___3~4#1.offset;havoc max3421_probe_~tmp___4~3#1;havoc max3421_probe_~tmp___5~3#1;havoc max3421_probe_~tmp___6~3#1.base, max3421_probe_~tmp___6~3#1.offset;max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset := 0, 0;max3421_probe_~retval~5#1 := -12;assume { :begin_inline_spi_setup } true;spi_setup_#in~arg0#1.base, spi_setup_#in~arg0#1.offset := max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset;havoc spi_setup_#res#1;havoc spi_setup_#t~nondet630#1, spi_setup_~arg0#1.base, spi_setup_~arg0#1.offset;spi_setup_~arg0#1.base, spi_setup_~arg0#1.offset := spi_setup_#in~arg0#1.base, spi_setup_#in~arg0#1.offset;assume -2147483648 <= spi_setup_#t~nondet630#1 && spi_setup_#t~nondet630#1 <= 2147483647;spi_setup_#res#1 := spi_setup_#t~nondet630#1;havoc spi_setup_#t~nondet630#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,411 INFO L290 TraceCheckUtils]: 60: Hoare triple {13014#(= ~ldv_spin~0 0)} max3421_probe_#t~ret520#1 := spi_setup_#res#1;assume { :end_inline_spi_setup } true;assume -2147483648 <= max3421_probe_#t~ret520#1 && max3421_probe_#t~ret520#1 <= 2147483647;max3421_probe_~tmp~42#1 := max3421_probe_#t~ret520#1;havoc max3421_probe_#t~ret520#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !(max3421_probe_~tmp~42#1 < 0);assume { :begin_inline_dev_name } true;dev_name_#in~dev#1.base, dev_name_#in~dev#1.offset := max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset;havoc dev_name_#res#1.base, dev_name_#res#1.offset;havoc dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset, dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset, dev_name_#t~ret45#1.base, dev_name_#t~ret45#1.offset, dev_name_~dev#1.base, dev_name_~dev#1.offset, dev_name_~tmp~5#1.base, dev_name_~tmp~5#1.offset;dev_name_~dev#1.base, dev_name_~dev#1.offset := dev_name_#in~dev#1.base, dev_name_#in~dev#1.offset;havoc dev_name_~tmp~5#1.base, dev_name_~tmp~5#1.offset;call dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset := read~$Pointer$(dev_name_~dev#1.base, 293 + dev_name_~dev#1.offset, 8); {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {13014#(= ~ldv_spin~0 0)} assume 0 != (dev_name_#t~mem43#1.base + dev_name_#t~mem43#1.offset) % 18446744073709551616;havoc dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset;call dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset := read~$Pointer$(dev_name_~dev#1.base, 293 + dev_name_~dev#1.offset, 8);dev_name_#res#1.base, dev_name_#res#1.offset := dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset;havoc dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {13014#(= ~ldv_spin~0 0)} max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset := dev_name_#res#1.base, dev_name_#res#1.offset;assume { :end_inline_dev_name } true;max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset := max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset;havoc max3421_probe_#t~ret522#1.base, max3421_probe_#t~ret522#1.offset;assume { :begin_inline_usb_create_hcd } true;usb_create_hcd_#in~arg0#1.base, usb_create_hcd_#in~arg0#1.offset, usb_create_hcd_#in~arg1#1.base, usb_create_hcd_#in~arg1#1.offset, usb_create_hcd_#in~arg2#1.base, usb_create_hcd_#in~arg2#1.offset := ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset, max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset;havoc usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset;havoc usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset, usb_create_hcd_~arg0#1.base, usb_create_hcd_~arg0#1.offset, usb_create_hcd_~arg1#1.base, usb_create_hcd_~arg1#1.offset, usb_create_hcd_~arg2#1.base, usb_create_hcd_~arg2#1.offset;usb_create_hcd_~arg0#1.base, usb_create_hcd_~arg0#1.offset := usb_create_hcd_#in~arg0#1.base, usb_create_hcd_#in~arg0#1.offset;usb_create_hcd_~arg1#1.base, usb_create_hcd_~arg1#1.offset := usb_create_hcd_#in~arg1#1.base, usb_create_hcd_#in~arg1#1.offset;usb_create_hcd_~arg2#1.base, usb_create_hcd_~arg2#1.offset := usb_create_hcd_#in~arg2#1.base, usb_create_hcd_#in~arg2#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,413 INFO L272 TraceCheckUtils]: 64: Hoare triple {13014#(= ~ldv_spin~0 0)} call usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset := ldv_malloc(899); {13050#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:09,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {13050#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___0~0 := #t~nondet34;havoc #t~nondet34; {13012#true} is VALID [2022-02-20 21:58:09,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {13012#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {13012#true} is VALID [2022-02-20 21:58:09,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,414 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1407#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,414 INFO L290 TraceCheckUtils]: 69: Hoare triple {13014#(= ~ldv_spin~0 0)} usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset := usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset;havoc usb_create_hcd_#t~ret633#1.base, usb_create_hcd_#t~ret633#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {13014#(= ~ldv_spin~0 0)} max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset := usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset;assume { :end_inline_usb_create_hcd } true;max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset := max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset;havoc max3421_probe_#t~ret523#1.base, max3421_probe_#t~ret523#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,415 INFO L290 TraceCheckUtils]: 71: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !(0 == (max3421_probe_~hcd~2#1.base + max3421_probe_~hcd~2#1.offset) % 18446744073709551616);assume { :begin_inline_set_bit } true;set_bit_#in~nr#1, set_bit_#in~addr#1.base, set_bit_#in~addr#1.offset := 2, max3421_probe_~hcd~2#1.base, 531 + max3421_probe_~hcd~2#1.offset;havoc set_bit_~nr#1, set_bit_~addr#1.base, set_bit_~addr#1.offset;set_bit_~nr#1 := set_bit_#in~nr#1;set_bit_~addr#1.base, set_bit_~addr#1.offset := set_bit_#in~addr#1.base, set_bit_#in~addr#1.offset; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,415 INFO L290 TraceCheckUtils]: 72: Hoare triple {13014#(= ~ldv_spin~0 0)} assume { :end_inline_set_bit } true; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,415 INFO L272 TraceCheckUtils]: 73: Hoare triple {13014#(= ~ldv_spin~0 0)} call max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset := hcd_to_max3421(max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset); {13012#true} is VALID [2022-02-20 21:58:09,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {13012#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {13012#true} is VALID [2022-02-20 21:58:09,416 INFO L290 TraceCheckUtils]: 75: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,416 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1409#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,417 INFO L290 TraceCheckUtils]: 77: Hoare triple {13014#(= ~ldv_spin~0 0)} max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset := max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset;havoc max3421_probe_#t~ret525#1.base, max3421_probe_#t~ret525#1.offset;call max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset := read~$Pointer$(~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8);call write~$Pointer$(max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset, max3421_probe_~max3421_hcd~33#1.base, 76 + max3421_probe_~max3421_hcd~33#1.offset, 8);havoc max3421_probe_#t~mem526#1.base, max3421_probe_#t~mem526#1.offset;call write~$Pointer$(max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8); {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,417 INFO L272 TraceCheckUtils]: 78: Hoare triple {13014#(= ~ldv_spin~0 0)} call INIT_LIST_HEAD(max3421_probe_~max3421_hcd~33#1.base, 93 + max3421_probe_~max3421_hcd~33#1.offset); {13051#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:58:09,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {13051#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~list.base, ~list.offset := #in~list.base, #in~list.offset;call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 8);call write~$Pointer$(~list.base, ~list.offset, ~list.base, 8 + ~list.offset, 8); {13012#true} is VALID [2022-02-20 21:58:09,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {13012#true} assume true; {13012#true} is VALID [2022-02-20 21:58:09,418 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13012#true} {13014#(= ~ldv_spin~0 0)} #1411#return; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,419 INFO L272 TraceCheckUtils]: 82: Hoare triple {13014#(= ~ldv_spin~0 0)} call max3421_probe_#t~ret527#1.base, max3421_probe_#t~ret527#1.offset := kmalloc(2, 208); {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,419 INFO L290 TraceCheckUtils]: 83: Hoare triple {13014#(= ~ldv_spin~0 0)} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,419 INFO L272 TraceCheckUtils]: 84: Hoare triple {13014#(= ~ldv_spin~0 0)} call ldv_check_alloc_flags(~flags#1); {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {13014#(= ~ldv_spin~0 0)} ~flags := #in~flags; {13014#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:09,420 INFO L290 TraceCheckUtils]: 86: Hoare triple {13014#(= ~ldv_spin~0 0)} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {13013#false} is VALID [2022-02-20 21:58:09,420 INFO L272 TraceCheckUtils]: 87: Hoare triple {13013#false} call ldv_error(); {13013#false} is VALID [2022-02-20 21:58:09,420 INFO L290 TraceCheckUtils]: 88: Hoare triple {13013#false} assume !false; {13013#false} is VALID [2022-02-20 21:58:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-02-20 21:58:09,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:09,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803048604] [2022-02-20 21:58:09,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803048604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:09,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:09,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:58:09,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840877084] [2022-02-20 21:58:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2022-02-20 21:58:09,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:09,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-02-20 21:58:09,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:09,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:58:09,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:58:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:58:09,477 INFO L87 Difference]: Start difference. First operand 1196 states and 1644 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-02-20 21:58:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:13,362 INFO L93 Difference]: Finished difference Result 1337 states and 1828 transitions. [2022-02-20 21:58:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:58:13,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2022-02-20 21:58:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-02-20 21:58:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 813 transitions. [2022-02-20 21:58:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-02-20 21:58:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 813 transitions. [2022-02-20 21:58:13,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 813 transitions. [2022-02-20 21:58:14,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 813 edges. 813 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:14,132 INFO L225 Difference]: With dead ends: 1337 [2022-02-20 21:58:14,133 INFO L226 Difference]: Without dead ends: 1334 [2022-02-20 21:58:14,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:58:14,134 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 787 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:14,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [831 Valid, 1700 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 21:58:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-02-20 21:58:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1224. [2022-02-20 21:58:14,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:14,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1334 states. Second operand has 1224 states, 922 states have (on average 1.3481561822125814) internal successors, (1243), 927 states have internal predecessors, (1243), 210 states have call successors, (210), 92 states have call predecessors, (210), 91 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:14,168 INFO L74 IsIncluded]: Start isIncluded. First operand 1334 states. Second operand has 1224 states, 922 states have (on average 1.3481561822125814) internal successors, (1243), 927 states have internal predecessors, (1243), 210 states have call successors, (210), 92 states have call predecessors, (210), 91 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:14,170 INFO L87 Difference]: Start difference. First operand 1334 states. Second operand has 1224 states, 922 states have (on average 1.3481561822125814) internal successors, (1243), 927 states have internal predecessors, (1243), 210 states have call successors, (210), 92 states have call predecessors, (210), 91 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:14,232 INFO L93 Difference]: Finished difference Result 1334 states and 1824 transitions. [2022-02-20 21:58:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1824 transitions. [2022-02-20 21:58:14,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:14,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:14,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 1224 states, 922 states have (on average 1.3481561822125814) internal successors, (1243), 927 states have internal predecessors, (1243), 210 states have call successors, (210), 92 states have call predecessors, (210), 91 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) Second operand 1334 states. [2022-02-20 21:58:14,241 INFO L87 Difference]: Start difference. First operand has 1224 states, 922 states have (on average 1.3481561822125814) internal successors, (1243), 927 states have internal predecessors, (1243), 210 states have call successors, (210), 92 states have call predecessors, (210), 91 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) Second operand 1334 states. [2022-02-20 21:58:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:14,303 INFO L93 Difference]: Finished difference Result 1334 states and 1824 transitions. [2022-02-20 21:58:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1824 transitions. [2022-02-20 21:58:14,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:14,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:14,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:14,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 922 states have (on average 1.3481561822125814) internal successors, (1243), 927 states have internal predecessors, (1243), 210 states have call successors, (210), 92 states have call predecessors, (210), 91 states have return successors, (209), 208 states have call predecessors, (209), 209 states have call successors, (209) [2022-02-20 21:58:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1662 transitions. [2022-02-20 21:58:14,382 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1662 transitions. Word has length 89 [2022-02-20 21:58:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:14,382 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 1662 transitions. [2022-02-20 21:58:14,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-02-20 21:58:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1662 transitions. [2022-02-20 21:58:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 21:58:14,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:14,387 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:58:14,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:58:14,387 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -535897520, now seen corresponding path program 1 times [2022-02-20 21:58:14,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:14,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291764471] [2022-02-20 21:58:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:58:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19161#true} {19161#true} #1333#return; {19161#true} is VALID [2022-02-20 21:58:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:58:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19161#true} {19161#true} #1335#return; {19161#true} is VALID [2022-02-20 21:58:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:58:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19161#true} {19161#true} #1337#return; {19161#true} is VALID [2022-02-20 21:58:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 21:58:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19161#true} {19161#true} #1349#return; {19161#true} is VALID [2022-02-20 21:58:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:58:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19161#true} {19179#(= ~ldv_state_variable_3~0 1)} #1351#return; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:58:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19161#true} {19179#(= ~ldv_state_variable_3~0 1)} #1353#return; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-02-20 21:58:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {19161#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~__mptr~0.base, ~__mptr~0.offset;havoc ~tmp~6.base, ~tmp~6.offset; {19161#true} is VALID [2022-02-20 21:58:14,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume 0 != (~dev.base + ~dev.offset) % 18446744073709551616;~__mptr~0.base, ~__mptr~0.offset := ~dev.base, ~dev.offset;~tmp~6.base, ~tmp~6.offset := ~__mptr~0.base, ~__mptr~0.offset; {19161#true} is VALID [2022-02-20 21:58:14,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {19161#true} #res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {19161#true} is VALID [2022-02-20 21:58:14,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,573 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19161#true} {19162#false} #1305#return; {19162#false} is VALID [2022-02-20 21:58:14,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-02-20 21:58:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {19161#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {19161#true} is VALID [2022-02-20 21:58:14,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19161#true} {19162#false} #1307#return; {19162#false} is VALID [2022-02-20 21:58:14,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-02-20 21:58:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:14,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {19200#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {19161#true} is VALID [2022-02-20 21:58:14,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19161#true} {19162#false} #1309#return; {19162#false} is VALID [2022-02-20 21:58:14,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {19161#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(101, 2);call #Ultimate.allocInit(20, 3);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(50, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(29, 8);call #Ultimate.allocInit(221, 9);call #Ultimate.allocInit(23, 10);call #Ultimate.allocInit(23, 11);call #Ultimate.allocInit(29, 12);call #Ultimate.allocInit(12, 13);call #Ultimate.allocInit(21, 14);call #Ultimate.allocInit(221, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(23, 17);call #Ultimate.allocInit(21, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(21, 20);call #Ultimate.allocInit(221, 21);call #Ultimate.allocInit(33, 22);call #Ultimate.allocInit(33, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(21, 26);call #Ultimate.allocInit(221, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(33, 29);call #Ultimate.allocInit(21, 30);call #Ultimate.allocInit(12, 31);call #Ultimate.allocInit(21, 32);call #Ultimate.allocInit(221, 33);call #Ultimate.allocInit(33, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(21, 36);call #Ultimate.allocInit(50, 37);call #Ultimate.allocInit(25, 38);call #Ultimate.allocInit(31, 39);call #Ultimate.allocInit(20, 40);call #Ultimate.allocInit(10, 41);call #Ultimate.allocInit(20, 42);call #Ultimate.allocInit(12, 43);call #Ultimate.allocInit(20, 44);call #Ultimate.allocInit(43, 45);call #Ultimate.allocInit(221, 46);call #Ultimate.allocInit(15, 47);call #Ultimate.allocInit(40, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(29, 50);call #Ultimate.allocInit(50, 51);call #Ultimate.allocInit(20, 52);call #Ultimate.allocInit(12, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(221, 55);call #Ultimate.allocInit(32, 56);call #Ultimate.allocInit(32, 57);call #Ultimate.allocInit(12, 58);call #Ultimate.allocInit(20, 59);call #Ultimate.allocInit(221, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(11, 62);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(20, 64);call #Ultimate.allocInit(221, 65);call #Ultimate.allocInit(10, 66);call #Ultimate.allocInit(10, 67);call #Ultimate.allocInit(12, 68);call #Ultimate.allocInit(20, 69);call #Ultimate.allocInit(221, 70);call #Ultimate.allocInit(37, 71);call #Ultimate.allocInit(37, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(35, 74);call #Ultimate.allocInit(24, 75);call #Ultimate.allocInit(32, 76);call #Ultimate.allocInit(29, 77);call #Ultimate.allocInit(29, 78);call #Ultimate.allocInit(19, 79);call #Ultimate.allocInit(45, 80);call #Ultimate.allocInit(19, 81);call #Ultimate.allocInit(8, 82);call #Ultimate.allocInit(26, 83);call #Ultimate.allocInit(40, 84);call #Ultimate.allocInit(12, 85);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset := 86, 0;call #Ultimate.allocInit(8, 86);call write~init~$Pointer$(0, 0, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8);~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset := 87, 0;call #Ultimate.allocInit(64, 87);call write~init~int(0, ~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 4 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 8 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 12 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-11, ~#hrsl_to_error~0.base, 16 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-32, ~#hrsl_to_error~0.base, 20 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 24 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 28 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-121, ~#hrsl_to_error~0.base, 32 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 36 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 40 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 44 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 48 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 52 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-62, ~#hrsl_to_error~0.base, 56 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-75, ~#hrsl_to_error~0.base, 60 + ~#hrsl_to_error~0.offset, 4);~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset := 88, 0;call #Ultimate.allocInit(340, 88);call write~init~$Pointer$(73, 0, ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(74, 0, ~#max3421_hcd_desc~0.base, 8 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(192, ~#max3421_hcd_desc~0.base, 16 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 24 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(16, ~#max3421_hcd_desc~0.base, 32 + ~#max3421_hcd_desc~0.offset, 4);call write~init~$Pointer$(#funAddr~max3421_reset.base, #funAddr~max3421_reset.offset, ~#max3421_hcd_desc~0.base, 36 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_start.base, #funAddr~max3421_start.offset, ~#max3421_hcd_desc~0.base, 44 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 52 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 60 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_stop.base, #funAddr~max3421_stop.offset, ~#max3421_hcd_desc~0.base, 68 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 76 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_get_frame_number.base, #funAddr~max3421_get_frame_number.offset, ~#max3421_hcd_desc~0.base, 84 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_enqueue.base, #funAddr~max3421_urb_enqueue.offset, ~#max3421_hcd_desc~0.base, 92 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_dequeue.base, #funAddr~max3421_urb_dequeue.offset, ~#max3421_hcd_desc~0.base, 100 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_map_urb_for_dma.base, #funAddr~max3421_map_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 108 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_unmap_urb_for_dma.base, #funAddr~max3421_unmap_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 116 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_endpoint_disable.base, #funAddr~max3421_endpoint_disable.offset, ~#max3421_hcd_desc~0.base, 124 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 132 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_status_data.base, #funAddr~max3421_hub_status_data.offset, ~#max3421_hcd_desc~0.base, 140 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_control.base, #funAddr~max3421_hub_control.offset, ~#max3421_hcd_desc~0.base, 148 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_suspend.base, #funAddr~max3421_bus_suspend.offset, ~#max3421_hcd_desc~0.base, 156 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_resume.base, #funAddr~max3421_bus_resume.offset, ~#max3421_hcd_desc~0.base, 164 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 172 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 180 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 188 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 196 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 204 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 212 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 220 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 228 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 236 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 244 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 252 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 260 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 268 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 276 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 284 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 292 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 300 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 308 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 316 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 324 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 332 + ~#max3421_hcd_desc~0.offset, 8);~#max3421_driver~0.base, ~#max3421_driver~0.offset := 89, 0;call #Ultimate.allocInit(161, 89);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_probe.base, #funAddr~max3421_probe.offset, ~#max3421_driver~0.base, 8 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_remove.base, #funAddr~max3421_remove.offset, ~#max3421_driver~0.base, 16 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 24 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 32 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 40 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(85, 0, ~#max3421_driver~0.base, 48 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 56 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#max3421_driver~0.base, 64 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 72 + ~#max3421_driver~0.offset, 8);call write~init~int(0, ~#max3421_driver~0.base, 80 + ~#max3421_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 81 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 89 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 97 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 105 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 113 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 121 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 129 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 137 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 145 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 153 + ~#max3421_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_spin~0 := 0; {19161#true} is VALID [2022-02-20 21:58:14,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {19161#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset, main_#t~ret574#1, main_#t~ret575#1, main_#t~ret576#1.base, main_#t~ret576#1.offset, main_#t~ret577#1, main_#t~ret578#1.base, main_#t~ret578#1.offset, main_#t~nondet579#1, main_#t~ret580#1, main_#t~nondet581#1, main_#t~nondet582#1, main_#t~nondet583#1, main_#t~switch584#1, main_#t~nondet585#1, main_#t~switch586#1, main_#t~ret587#1, main_#t~nondet588#1, main_#t~switch589#1, main_#t~ret590#1, main_#t~ret591#1, main_#t~ret592#1, main_#t~ret593#1, main_#t~ret594#1, main_#t~ret595#1, main_#t~ret596#1, main_#t~ret597#1, main_#t~ret598#1, main_#t~ret599#1, main_#t~ret600#1, main_#t~ret601#1, main_#t~ret602#1, main_#t~ret603#1, main_#t~ret604#1, main_#t~ret605#1, main_#t~ret606#1, main_#t~ret607#1, main_#t~ret608#1, main_#t~nondet609#1, main_#t~switch610#1, main_#t~ret611#1, main_#t~ret612#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~ldvarg3~0#1, main_~tmp___0~25#1, main_~ldvarg0~0#1, main_~tmp___1~13#1, main_~ldvarg5~0#1, main_~ldvarg6~0#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~ldvarg1~0#1, main_~tmp___3~5#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset, main_~ldvarg9~0#1, main_~tmp___5~4#1, main_~ldvarg2~0#1, main_~tmp___6~4#1, main_~tmp___7~3#1, main_~tmp___8~3#1, main_~tmp___9~2#1, main_~tmp___10~1#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~25#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg5~0#1;havoc main_~ldvarg6~0#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___3~5#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;havoc main_~ldvarg9~0#1;havoc main_~tmp___5~4#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___6~4#1;havoc main_~tmp___7~3#1;havoc main_~tmp___8~3#1;havoc main_~tmp___9~2#1;havoc main_~tmp___10~1#1; {19161#true} is VALID [2022-02-20 21:58:14,596 INFO L272 TraceCheckUtils]: 2: Hoare triple {19161#true} call main_#t~ret573#1.base, main_#t~ret573#1.offset := ldv_zalloc(1); {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:14,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,598 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {19161#true} {19161#true} #1333#return; {19161#true} is VALID [2022-02-20 21:58:14,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {19161#true} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret573#1.base, main_#t~ret573#1.offset;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_#t~ret574#1 := __VERIFIER_nondet_u16();main_~tmp___0~25#1 := main_#t~ret574#1;havoc main_#t~ret574#1;main_~ldvarg3~0#1 := main_~tmp___0~25#1;call main_#t~ret575#1 := __VERIFIER_nondet_u16();main_~tmp___1~13#1 := main_#t~ret575#1;havoc main_#t~ret575#1;main_~ldvarg0~0#1 := main_~tmp___1~13#1; {19161#true} is VALID [2022-02-20 21:58:14,599 INFO L272 TraceCheckUtils]: 8: Hoare triple {19161#true} call main_#t~ret576#1.base, main_#t~ret576#1.offset := ldv_zalloc(72); {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:14,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,599 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {19161#true} {19161#true} #1335#return; {19161#true} is VALID [2022-02-20 21:58:14,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {19161#true} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret576#1.base, main_#t~ret576#1.offset;havoc main_#t~ret576#1.base, main_#t~ret576#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;call main_#t~ret577#1 := __VERIFIER_nondet_u16();main_~tmp___3~5#1 := main_#t~ret577#1;havoc main_#t~ret577#1;main_~ldvarg1~0#1 := main_~tmp___3~5#1; {19161#true} is VALID [2022-02-20 21:58:14,600 INFO L272 TraceCheckUtils]: 14: Hoare triple {19161#true} call main_#t~ret578#1.base, main_#t~ret578#1.offset := ldv_zalloc(1); {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:14,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,600 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19161#true} {19161#true} #1337#return; {19161#true} is VALID [2022-02-20 21:58:14,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {19161#true} main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset := main_#t~ret578#1.base, main_#t~ret578#1.offset;havoc main_#t~ret578#1.base, main_#t~ret578#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;assume -2147483648 <= main_#t~nondet579#1 && main_#t~nondet579#1 <= 2147483647;main_~tmp___5~4#1 := main_#t~nondet579#1;havoc main_#t~nondet579#1;main_~ldvarg9~0#1 := main_~tmp___5~4#1;call main_#t~ret580#1 := __VERIFIER_nondet_u16();main_~tmp___6~4#1 := main_#t~ret580#1;havoc main_#t~ret580#1;main_~ldvarg2~0#1 := main_~tmp___6~4#1;assume { :begin_inline_ldv_initialize } true; {19161#true} is VALID [2022-02-20 21:58:14,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {19161#true} assume { :end_inline_ldv_initialize } true;assume -2147483648 <= main_#t~nondet581#1 && main_#t~nondet581#1 <= 2147483647;main_~ldvarg5~0#1 := main_#t~nondet581#1;havoc main_#t~nondet581#1;assume -2147483648 <= main_#t~nondet582#1 && main_#t~nondet582#1 <= 2147483647;main_~ldvarg6~0#1 := main_#t~nondet582#1;havoc main_#t~nondet582#1;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {19161#true} is VALID [2022-02-20 21:58:14,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {19161#true} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {19161#true} is VALID [2022-02-20 21:58:14,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {19161#true} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {19161#true} is VALID [2022-02-20 21:58:14,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {19161#true} assume main_#t~switch584#1; {19161#true} is VALID [2022-02-20 21:58:14,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {19161#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet585#1 && main_#t~nondet585#1 <= 2147483647;main_~tmp___8~3#1 := main_#t~nondet585#1;havoc main_#t~nondet585#1;main_#t~switch586#1 := 0 == main_~tmp___8~3#1; {19161#true} is VALID [2022-02-20 21:58:14,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {19161#true} assume !main_#t~switch586#1;main_#t~switch586#1 := main_#t~switch586#1 || 1 == main_~tmp___8~3#1; {19161#true} is VALID [2022-02-20 21:58:14,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {19161#true} assume main_#t~switch586#1; {19161#true} is VALID [2022-02-20 21:58:14,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {19161#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_max3421_driver_init } true;havoc max3421_driver_init_#res#1;havoc max3421_driver_init_#t~ret560#1, max3421_driver_init_~tmp~43#1;havoc max3421_driver_init_~tmp~43#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#max3421_driver~0.base, ~#max3421_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet629#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet629#1 && spi_register_driver_#t~nondet629#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet629#1;havoc spi_register_driver_#t~nondet629#1; {19161#true} is VALID [2022-02-20 21:58:14,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {19161#true} max3421_driver_init_#t~ret560#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= max3421_driver_init_#t~ret560#1 && max3421_driver_init_#t~ret560#1 <= 2147483647;max3421_driver_init_~tmp~43#1 := max3421_driver_init_#t~ret560#1;havoc max3421_driver_init_#t~ret560#1;max3421_driver_init_#res#1 := max3421_driver_init_~tmp~43#1; {19161#true} is VALID [2022-02-20 21:58:14,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {19161#true} main_#t~ret587#1 := max3421_driver_init_#res#1;assume { :end_inline_max3421_driver_init } true;assume -2147483648 <= main_#t~ret587#1 && main_#t~ret587#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret587#1;havoc main_#t~ret587#1; {19161#true} is VALID [2022-02-20 21:58:14,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {19161#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_spi_driver_2 } true;havoc ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset, ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset;havoc ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset; {19161#true} is VALID [2022-02-20 21:58:14,604 INFO L272 TraceCheckUtils]: 31: Hoare triple {19161#true} call ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset := ldv_zalloc(1496); {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:14,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,605 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19161#true} {19161#true} #1349#return; {19161#true} is VALID [2022-02-20 21:58:14,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {19161#true} ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset := ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset;havoc ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset; {19161#true} is VALID [2022-02-20 21:58:14,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {19161#true} assume { :end_inline_ldv_initialize_spi_driver_2 } true;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_initialize_hc_driver_3 } true;havoc ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset, ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset, ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset, ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset;havoc ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset;havoc ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,606 INFO L272 TraceCheckUtils]: 38: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} call ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset := ldv_zalloc(192); {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:14,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,611 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {19161#true} {19179#(= ~ldv_state_variable_3~0 1)} #1351#return; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset := ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset;havoc ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,613 INFO L272 TraceCheckUtils]: 44: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} call ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset := ldv_zalloc(968); {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:14,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {19199#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {19161#true} is VALID [2022-02-20 21:58:14,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {19161#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {19161#true} is VALID [2022-02-20 21:58:14,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,615 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {19161#true} {19179#(= ~ldv_state_variable_3~0 1)} #1353#return; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset := ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset;havoc ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume { :end_inline_ldv_initialize_hc_driver_3 } true; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !(0 != ~ldv_retval_0~0); {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 2 == main_~tmp___7~3#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume main_#t~switch584#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet588#1 && main_#t~nondet588#1 <= 2147483647;main_~tmp___9~2#1 := main_#t~nondet588#1;havoc main_#t~nondet588#1;main_#t~switch589#1 := 0 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 1 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 2 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 3 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 4 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 5 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 6 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 7 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 8 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 9 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 10 == main_~tmp___9~2#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,624 INFO L290 TraceCheckUtils]: 67: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume main_#t~switch589#1; {19179#(= ~ldv_state_variable_3~0 1)} is VALID [2022-02-20 21:58:14,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {19179#(= ~ldv_state_variable_3~0 1)} assume !(1 == ~ldv_state_variable_3~0); {19162#false} is VALID [2022-02-20 21:58:14,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {19162#false} assume 2 == ~ldv_state_variable_3~0; {19162#false} is VALID [2022-02-20 21:58:14,625 INFO L272 TraceCheckUtils]: 70: Hoare triple {19162#false} call main_#t~ret604#1 := max3421_urb_enqueue(~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset, ~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset, main_~ldvarg5~0#1); {19162#false} is VALID [2022-02-20 21:58:14,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {19162#false} ~hcd#1.base, ~hcd#1.offset := #in~hcd#1.base, #in~hcd#1.offset;~urb#1.base, ~urb#1.offset := #in~urb#1.base, #in~urb#1.offset;~mem_flags#1 := #in~mem_flags#1;havoc ~spi~12#1.base, ~spi~12#1.offset;havoc ~tmp~35#1.base, ~tmp~35#1.offset;havoc ~max3421_hcd~26#1.base, ~max3421_hcd~26#1.offset;havoc ~tmp___0~19#1.base, ~tmp___0~19#1.offset;havoc ~max3421_ep~6#1.base, ~max3421_ep~6#1.offset;havoc ~flags~5#1;havoc ~retval~1#1;havoc ~tmp___1~10#1.base, ~tmp___1~10#1.offset;call #t~mem446#1.base, #t~mem446#1.offset := read~$Pointer$(~hcd#1.base, ~hcd#1.offset, 8); {19162#false} is VALID [2022-02-20 21:58:14,625 INFO L272 TraceCheckUtils]: 72: Hoare triple {19162#false} call #t~ret447#1.base, #t~ret447#1.offset := to_spi_device(#t~mem446#1.base, #t~mem446#1.offset); {19161#true} is VALID [2022-02-20 21:58:14,625 INFO L290 TraceCheckUtils]: 73: Hoare triple {19161#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~__mptr~0.base, ~__mptr~0.offset;havoc ~tmp~6.base, ~tmp~6.offset; {19161#true} is VALID [2022-02-20 21:58:14,625 INFO L290 TraceCheckUtils]: 74: Hoare triple {19161#true} assume 0 != (~dev.base + ~dev.offset) % 18446744073709551616;~__mptr~0.base, ~__mptr~0.offset := ~dev.base, ~dev.offset;~tmp~6.base, ~tmp~6.offset := ~__mptr~0.base, ~__mptr~0.offset; {19161#true} is VALID [2022-02-20 21:58:14,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {19161#true} #res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {19161#true} is VALID [2022-02-20 21:58:14,626 INFO L290 TraceCheckUtils]: 76: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,626 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19161#true} {19162#false} #1305#return; {19162#false} is VALID [2022-02-20 21:58:14,626 INFO L290 TraceCheckUtils]: 78: Hoare triple {19162#false} ~tmp~35#1.base, ~tmp~35#1.offset := #t~ret447#1.base, #t~ret447#1.offset;havoc #t~mem446#1.base, #t~mem446#1.offset;havoc #t~ret447#1.base, #t~ret447#1.offset;~spi~12#1.base, ~spi~12#1.offset := ~tmp~35#1.base, ~tmp~35#1.offset; {19162#false} is VALID [2022-02-20 21:58:14,626 INFO L272 TraceCheckUtils]: 79: Hoare triple {19162#false} call #t~ret448#1.base, #t~ret448#1.offset := hcd_to_max3421(~hcd#1.base, ~hcd#1.offset); {19161#true} is VALID [2022-02-20 21:58:14,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {19161#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {19161#true} is VALID [2022-02-20 21:58:14,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,627 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {19161#true} {19162#false} #1307#return; {19162#false} is VALID [2022-02-20 21:58:14,627 INFO L290 TraceCheckUtils]: 83: Hoare triple {19162#false} ~tmp___0~19#1.base, ~tmp___0~19#1.offset := #t~ret448#1.base, #t~ret448#1.offset;havoc #t~ret448#1.base, #t~ret448#1.offset;~max3421_hcd~26#1.base, ~max3421_hcd~26#1.offset := ~tmp___0~19#1.base, ~tmp___0~19#1.offset;call #t~mem449#1 := read~int(~urb#1.base, 80 + ~urb#1.offset, 4);#t~switch450#1 := 1 == #t~mem449#1 / 1073741824; {19162#false} is VALID [2022-02-20 21:58:14,627 INFO L290 TraceCheckUtils]: 84: Hoare triple {19162#false} assume #t~switch450#1; {19162#false} is VALID [2022-02-20 21:58:14,627 INFO L290 TraceCheckUtils]: 85: Hoare triple {19162#false} #t~switch450#1 := #t~switch450#1 || 0 == #t~mem449#1 / 1073741824; {19162#false} is VALID [2022-02-20 21:58:14,627 INFO L290 TraceCheckUtils]: 86: Hoare triple {19162#false} assume !#t~switch450#1; {19162#false} is VALID [2022-02-20 21:58:14,627 INFO L290 TraceCheckUtils]: 87: Hoare triple {19162#false} #t~switch450#1 := true; {19162#false} is VALID [2022-02-20 21:58:14,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {19162#false} assume #t~switch450#1; {19162#false} is VALID [2022-02-20 21:58:14,627 INFO L272 TraceCheckUtils]: 89: Hoare triple {19162#false} call ldv_spin_lock(); {19200#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 21:58:14,628 INFO L290 TraceCheckUtils]: 90: Hoare triple {19200#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {19161#true} is VALID [2022-02-20 21:58:14,628 INFO L290 TraceCheckUtils]: 91: Hoare triple {19161#true} assume true; {19161#true} is VALID [2022-02-20 21:58:14,628 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19161#true} {19162#false} #1309#return; {19162#false} is VALID [2022-02-20 21:58:14,628 INFO L290 TraceCheckUtils]: 93: Hoare triple {19162#false} call #t~mem454#1.base, #t~mem454#1.offset := read~$Pointer$(~urb#1.base, 72 + ~urb#1.offset, 8);call #t~mem455#1.base, #t~mem455#1.offset := read~$Pointer$(#t~mem454#1.base, 31 + #t~mem454#1.offset, 8);~max3421_ep~6#1.base, ~max3421_ep~6#1.offset := #t~mem455#1.base, #t~mem455#1.offset;havoc #t~mem454#1.base, #t~mem454#1.offset;havoc #t~mem455#1.base, #t~mem455#1.offset; {19162#false} is VALID [2022-02-20 21:58:14,628 INFO L290 TraceCheckUtils]: 94: Hoare triple {19162#false} assume 0 == (~max3421_ep~6#1.base + ~max3421_ep~6#1.offset) % 18446744073709551616;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 40, ~mem_flags#1;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_~size#1, kzalloc_~flags#1;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1; {19162#false} is VALID [2022-02-20 21:58:14,628 INFO L272 TraceCheckUtils]: 95: Hoare triple {19162#false} call ldv_check_alloc_flags(kzalloc_~flags#1); {19162#false} is VALID [2022-02-20 21:58:14,628 INFO L290 TraceCheckUtils]: 96: Hoare triple {19162#false} ~flags := #in~flags; {19162#false} is VALID [2022-02-20 21:58:14,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {19162#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {19162#false} is VALID [2022-02-20 21:58:14,629 INFO L272 TraceCheckUtils]: 98: Hoare triple {19162#false} call ldv_error(); {19162#false} is VALID [2022-02-20 21:58:14,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {19162#false} assume !false; {19162#false} is VALID [2022-02-20 21:58:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 21:58:14,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:14,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291764471] [2022-02-20 21:58:14,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291764471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:14,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:14,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:58:14,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657369182] [2022-02-20 21:58:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:14,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 100 [2022-02-20 21:58:14,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:14,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:58:14,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:14,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:58:14,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:58:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:58:14,695 INFO L87 Difference]: Start difference. First operand 1224 states and 1662 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:58:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:19,261 INFO L93 Difference]: Finished difference Result 3346 states and 4561 transitions. [2022-02-20 21:58:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:58:19,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 100 [2022-02-20 21:58:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:58:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2149 transitions. [2022-02-20 21:58:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:58:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2149 transitions. [2022-02-20 21:58:19,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2149 transitions. [2022-02-20 21:58:20,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2149 edges. 2149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:20,966 INFO L225 Difference]: With dead ends: 3346 [2022-02-20 21:58:20,966 INFO L226 Difference]: Without dead ends: 2152 [2022-02-20 21:58:20,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:58:20,971 INFO L933 BasicCegarLoop]: 862 mSDtfsCounter, 920 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:20,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [994 Valid, 2039 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 21:58:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2022-02-20 21:58:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2010. [2022-02-20 21:58:21,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:21,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2152 states. Second operand has 2010 states, 1531 states have (on average 1.3357282821685172) internal successors, (2045), 1540 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:21,026 INFO L74 IsIncluded]: Start isIncluded. First operand 2152 states. Second operand has 2010 states, 1531 states have (on average 1.3357282821685172) internal successors, (2045), 1540 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:21,029 INFO L87 Difference]: Start difference. First operand 2152 states. Second operand has 2010 states, 1531 states have (on average 1.3357282821685172) internal successors, (2045), 1540 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:21,175 INFO L93 Difference]: Finished difference Result 2152 states and 2883 transitions. [2022-02-20 21:58:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2883 transitions. [2022-02-20 21:58:21,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:21,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:21,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 2010 states, 1531 states have (on average 1.3357282821685172) internal successors, (2045), 1540 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) Second operand 2152 states. [2022-02-20 21:58:21,187 INFO L87 Difference]: Start difference. First operand has 2010 states, 1531 states have (on average 1.3357282821685172) internal successors, (2045), 1540 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) Second operand 2152 states. [2022-02-20 21:58:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:21,350 INFO L93 Difference]: Finished difference Result 2152 states and 2883 transitions. [2022-02-20 21:58:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2883 transitions. [2022-02-20 21:58:21,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:21,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:21,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:21,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1531 states have (on average 1.3357282821685172) internal successors, (2045), 1540 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2690 transitions. [2022-02-20 21:58:21,546 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2690 transitions. Word has length 100 [2022-02-20 21:58:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:21,547 INFO L470 AbstractCegarLoop]: Abstraction has 2010 states and 2690 transitions. [2022-02-20 21:58:21,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:58:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2690 transitions. [2022-02-20 21:58:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 21:58:21,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:21,550 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:58:21,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:58:21,551 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -552282000, now seen corresponding path program 1 times [2022-02-20 21:58:21,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:21,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824838404] [2022-02-20 21:58:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:58:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30642#true} #1333#return; {30642#true} is VALID [2022-02-20 21:58:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:58:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30642#true} #1335#return; {30642#true} is VALID [2022-02-20 21:58:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:58:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30642#true} #1337#return; {30642#true} is VALID [2022-02-20 21:58:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 21:58:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30642#true} #1349#return; {30642#true} is VALID [2022-02-20 21:58:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:58:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30642#true} #1351#return; {30642#true} is VALID [2022-02-20 21:58:21,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:58:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30642#true} #1353#return; {30642#true} is VALID [2022-02-20 21:58:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-02-20 21:58:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {30642#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~__mptr~0.base, ~__mptr~0.offset;havoc ~tmp~6.base, ~tmp~6.offset; {30642#true} is VALID [2022-02-20 21:58:21,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 != (~dev.base + ~dev.offset) % 18446744073709551616;~__mptr~0.base, ~__mptr~0.offset := ~dev.base, ~dev.offset;~tmp~6.base, ~tmp~6.offset := ~__mptr~0.base, ~__mptr~0.offset; {30642#true} is VALID [2022-02-20 21:58:21,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} #res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {30642#true} is VALID [2022-02-20 21:58:21,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,684 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30642#true} {30642#true} #1305#return; {30642#true} is VALID [2022-02-20 21:58:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 21:58:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {30642#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {30642#true} is VALID [2022-02-20 21:58:21,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30642#true} {30642#true} #1307#return; {30642#true} is VALID [2022-02-20 21:58:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-02-20 21:58:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:21,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {30681#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {30642#true} is VALID [2022-02-20 21:58:21,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30642#true} {30643#false} #1309#return; {30643#false} is VALID [2022-02-20 21:58:21,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {30642#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(101, 2);call #Ultimate.allocInit(20, 3);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(50, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(29, 8);call #Ultimate.allocInit(221, 9);call #Ultimate.allocInit(23, 10);call #Ultimate.allocInit(23, 11);call #Ultimate.allocInit(29, 12);call #Ultimate.allocInit(12, 13);call #Ultimate.allocInit(21, 14);call #Ultimate.allocInit(221, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(23, 17);call #Ultimate.allocInit(21, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(21, 20);call #Ultimate.allocInit(221, 21);call #Ultimate.allocInit(33, 22);call #Ultimate.allocInit(33, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(21, 26);call #Ultimate.allocInit(221, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(33, 29);call #Ultimate.allocInit(21, 30);call #Ultimate.allocInit(12, 31);call #Ultimate.allocInit(21, 32);call #Ultimate.allocInit(221, 33);call #Ultimate.allocInit(33, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(21, 36);call #Ultimate.allocInit(50, 37);call #Ultimate.allocInit(25, 38);call #Ultimate.allocInit(31, 39);call #Ultimate.allocInit(20, 40);call #Ultimate.allocInit(10, 41);call #Ultimate.allocInit(20, 42);call #Ultimate.allocInit(12, 43);call #Ultimate.allocInit(20, 44);call #Ultimate.allocInit(43, 45);call #Ultimate.allocInit(221, 46);call #Ultimate.allocInit(15, 47);call #Ultimate.allocInit(40, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(29, 50);call #Ultimate.allocInit(50, 51);call #Ultimate.allocInit(20, 52);call #Ultimate.allocInit(12, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(221, 55);call #Ultimate.allocInit(32, 56);call #Ultimate.allocInit(32, 57);call #Ultimate.allocInit(12, 58);call #Ultimate.allocInit(20, 59);call #Ultimate.allocInit(221, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(11, 62);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(20, 64);call #Ultimate.allocInit(221, 65);call #Ultimate.allocInit(10, 66);call #Ultimate.allocInit(10, 67);call #Ultimate.allocInit(12, 68);call #Ultimate.allocInit(20, 69);call #Ultimate.allocInit(221, 70);call #Ultimate.allocInit(37, 71);call #Ultimate.allocInit(37, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(35, 74);call #Ultimate.allocInit(24, 75);call #Ultimate.allocInit(32, 76);call #Ultimate.allocInit(29, 77);call #Ultimate.allocInit(29, 78);call #Ultimate.allocInit(19, 79);call #Ultimate.allocInit(45, 80);call #Ultimate.allocInit(19, 81);call #Ultimate.allocInit(8, 82);call #Ultimate.allocInit(26, 83);call #Ultimate.allocInit(40, 84);call #Ultimate.allocInit(12, 85);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset := 86, 0;call #Ultimate.allocInit(8, 86);call write~init~$Pointer$(0, 0, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8);~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset := 87, 0;call #Ultimate.allocInit(64, 87);call write~init~int(0, ~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 4 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 8 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-22, ~#hrsl_to_error~0.base, 12 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-11, ~#hrsl_to_error~0.base, 16 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-32, ~#hrsl_to_error~0.base, 20 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 24 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 28 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-121, ~#hrsl_to_error~0.base, 32 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 36 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-71, ~#hrsl_to_error~0.base, 40 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-84, ~#hrsl_to_error~0.base, 44 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 48 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-5, ~#hrsl_to_error~0.base, 52 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-62, ~#hrsl_to_error~0.base, 56 + ~#hrsl_to_error~0.offset, 4);call write~init~int(-75, ~#hrsl_to_error~0.base, 60 + ~#hrsl_to_error~0.offset, 4);~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset := 88, 0;call #Ultimate.allocInit(340, 88);call write~init~$Pointer$(73, 0, ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(74, 0, ~#max3421_hcd_desc~0.base, 8 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(192, ~#max3421_hcd_desc~0.base, 16 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 24 + ~#max3421_hcd_desc~0.offset, 8);call write~init~int(16, ~#max3421_hcd_desc~0.base, 32 + ~#max3421_hcd_desc~0.offset, 4);call write~init~$Pointer$(#funAddr~max3421_reset.base, #funAddr~max3421_reset.offset, ~#max3421_hcd_desc~0.base, 36 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_start.base, #funAddr~max3421_start.offset, ~#max3421_hcd_desc~0.base, 44 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 52 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 60 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_stop.base, #funAddr~max3421_stop.offset, ~#max3421_hcd_desc~0.base, 68 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 76 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_get_frame_number.base, #funAddr~max3421_get_frame_number.offset, ~#max3421_hcd_desc~0.base, 84 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_enqueue.base, #funAddr~max3421_urb_enqueue.offset, ~#max3421_hcd_desc~0.base, 92 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_urb_dequeue.base, #funAddr~max3421_urb_dequeue.offset, ~#max3421_hcd_desc~0.base, 100 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_map_urb_for_dma.base, #funAddr~max3421_map_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 108 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_unmap_urb_for_dma.base, #funAddr~max3421_unmap_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, 116 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_endpoint_disable.base, #funAddr~max3421_endpoint_disable.offset, ~#max3421_hcd_desc~0.base, 124 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 132 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_status_data.base, #funAddr~max3421_hub_status_data.offset, ~#max3421_hcd_desc~0.base, 140 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_hub_control.base, #funAddr~max3421_hub_control.offset, ~#max3421_hcd_desc~0.base, 148 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_suspend.base, #funAddr~max3421_bus_suspend.offset, ~#max3421_hcd_desc~0.base, 156 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_bus_resume.base, #funAddr~max3421_bus_resume.offset, ~#max3421_hcd_desc~0.base, 164 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 172 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 180 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 188 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 196 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 204 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 212 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 220 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 228 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 236 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 244 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 252 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 260 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 268 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 276 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 284 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 292 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 300 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 308 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 316 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 324 + ~#max3421_hcd_desc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_hcd_desc~0.base, 332 + ~#max3421_hcd_desc~0.offset, 8);~#max3421_driver~0.base, ~#max3421_driver~0.offset := 89, 0;call #Ultimate.allocInit(161, 89);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_probe.base, #funAddr~max3421_probe.offset, ~#max3421_driver~0.base, 8 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~max3421_remove.base, #funAddr~max3421_remove.offset, ~#max3421_driver~0.base, 16 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 24 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 32 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 40 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(85, 0, ~#max3421_driver~0.base, 48 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 56 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#max3421_driver~0.base, 64 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 72 + ~#max3421_driver~0.offset, 8);call write~init~int(0, ~#max3421_driver~0.base, 80 + ~#max3421_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 81 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 89 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 97 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 105 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 113 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 121 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 129 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 137 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 145 + ~#max3421_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#max3421_driver~0.base, 153 + ~#max3421_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_spin~0 := 0; {30642#true} is VALID [2022-02-20 21:58:21,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset, main_#t~ret574#1, main_#t~ret575#1, main_#t~ret576#1.base, main_#t~ret576#1.offset, main_#t~ret577#1, main_#t~ret578#1.base, main_#t~ret578#1.offset, main_#t~nondet579#1, main_#t~ret580#1, main_#t~nondet581#1, main_#t~nondet582#1, main_#t~nondet583#1, main_#t~switch584#1, main_#t~nondet585#1, main_#t~switch586#1, main_#t~ret587#1, main_#t~nondet588#1, main_#t~switch589#1, main_#t~ret590#1, main_#t~ret591#1, main_#t~ret592#1, main_#t~ret593#1, main_#t~ret594#1, main_#t~ret595#1, main_#t~ret596#1, main_#t~ret597#1, main_#t~ret598#1, main_#t~ret599#1, main_#t~ret600#1, main_#t~ret601#1, main_#t~ret602#1, main_#t~ret603#1, main_#t~ret604#1, main_#t~ret605#1, main_#t~ret606#1, main_#t~ret607#1, main_#t~ret608#1, main_#t~nondet609#1, main_#t~switch610#1, main_#t~ret611#1, main_#t~ret612#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~ldvarg3~0#1, main_~tmp___0~25#1, main_~ldvarg0~0#1, main_~tmp___1~13#1, main_~ldvarg5~0#1, main_~ldvarg6~0#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~ldvarg1~0#1, main_~tmp___3~5#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset, main_~ldvarg9~0#1, main_~tmp___5~4#1, main_~ldvarg2~0#1, main_~tmp___6~4#1, main_~tmp___7~3#1, main_~tmp___8~3#1, main_~tmp___9~2#1, main_~tmp___10~1#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~25#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg5~0#1;havoc main_~ldvarg6~0#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___3~5#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;havoc main_~ldvarg9~0#1;havoc main_~tmp___5~4#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___6~4#1;havoc main_~tmp___7~3#1;havoc main_~tmp___8~3#1;havoc main_~tmp___9~2#1;havoc main_~tmp___10~1#1; {30642#true} is VALID [2022-02-20 21:58:21,719 INFO L272 TraceCheckUtils]: 2: Hoare triple {30642#true} call main_#t~ret573#1.base, main_#t~ret573#1.offset := ldv_zalloc(1); {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:21,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,719 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30642#true} {30642#true} #1333#return; {30642#true} is VALID [2022-02-20 21:58:21,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {30642#true} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret573#1.base, main_#t~ret573#1.offset;havoc main_#t~ret573#1.base, main_#t~ret573#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_#t~ret574#1 := __VERIFIER_nondet_u16();main_~tmp___0~25#1 := main_#t~ret574#1;havoc main_#t~ret574#1;main_~ldvarg3~0#1 := main_~tmp___0~25#1;call main_#t~ret575#1 := __VERIFIER_nondet_u16();main_~tmp___1~13#1 := main_#t~ret575#1;havoc main_#t~ret575#1;main_~ldvarg0~0#1 := main_~tmp___1~13#1; {30642#true} is VALID [2022-02-20 21:58:21,720 INFO L272 TraceCheckUtils]: 8: Hoare triple {30642#true} call main_#t~ret576#1.base, main_#t~ret576#1.offset := ldv_zalloc(72); {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:21,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,720 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {30642#true} {30642#true} #1335#return; {30642#true} is VALID [2022-02-20 21:58:21,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {30642#true} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret576#1.base, main_#t~ret576#1.offset;havoc main_#t~ret576#1.base, main_#t~ret576#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;call main_#t~ret577#1 := __VERIFIER_nondet_u16();main_~tmp___3~5#1 := main_#t~ret577#1;havoc main_#t~ret577#1;main_~ldvarg1~0#1 := main_~tmp___3~5#1; {30642#true} is VALID [2022-02-20 21:58:21,721 INFO L272 TraceCheckUtils]: 14: Hoare triple {30642#true} call main_#t~ret578#1.base, main_#t~ret578#1.offset := ldv_zalloc(1); {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:21,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,721 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {30642#true} {30642#true} #1337#return; {30642#true} is VALID [2022-02-20 21:58:21,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {30642#true} main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset := main_#t~ret578#1.base, main_#t~ret578#1.offset;havoc main_#t~ret578#1.base, main_#t~ret578#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;assume -2147483648 <= main_#t~nondet579#1 && main_#t~nondet579#1 <= 2147483647;main_~tmp___5~4#1 := main_#t~nondet579#1;havoc main_#t~nondet579#1;main_~ldvarg9~0#1 := main_~tmp___5~4#1;call main_#t~ret580#1 := __VERIFIER_nondet_u16();main_~tmp___6~4#1 := main_#t~ret580#1;havoc main_#t~ret580#1;main_~ldvarg2~0#1 := main_~tmp___6~4#1;assume { :begin_inline_ldv_initialize } true; {30642#true} is VALID [2022-02-20 21:58:21,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {30642#true} assume { :end_inline_ldv_initialize } true;assume -2147483648 <= main_#t~nondet581#1 && main_#t~nondet581#1 <= 2147483647;main_~ldvarg5~0#1 := main_#t~nondet581#1;havoc main_#t~nondet581#1;assume -2147483648 <= main_#t~nondet582#1 && main_#t~nondet582#1 <= 2147483647;main_~ldvarg6~0#1 := main_#t~nondet582#1;havoc main_#t~nondet582#1;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {30642#true} is VALID [2022-02-20 21:58:21,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {30642#true} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {30642#true} is VALID [2022-02-20 21:58:21,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {30642#true} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {30642#true} is VALID [2022-02-20 21:58:21,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {30642#true} assume main_#t~switch584#1; {30642#true} is VALID [2022-02-20 21:58:21,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {30642#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet585#1 && main_#t~nondet585#1 <= 2147483647;main_~tmp___8~3#1 := main_#t~nondet585#1;havoc main_#t~nondet585#1;main_#t~switch586#1 := 0 == main_~tmp___8~3#1; {30642#true} is VALID [2022-02-20 21:58:21,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {30642#true} assume !main_#t~switch586#1;main_#t~switch586#1 := main_#t~switch586#1 || 1 == main_~tmp___8~3#1; {30642#true} is VALID [2022-02-20 21:58:21,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {30642#true} assume main_#t~switch586#1; {30642#true} is VALID [2022-02-20 21:58:21,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {30642#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_max3421_driver_init } true;havoc max3421_driver_init_#res#1;havoc max3421_driver_init_#t~ret560#1, max3421_driver_init_~tmp~43#1;havoc max3421_driver_init_~tmp~43#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#max3421_driver~0.base, ~#max3421_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet629#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet629#1 && spi_register_driver_#t~nondet629#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet629#1;havoc spi_register_driver_#t~nondet629#1; {30642#true} is VALID [2022-02-20 21:58:21,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {30642#true} max3421_driver_init_#t~ret560#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= max3421_driver_init_#t~ret560#1 && max3421_driver_init_#t~ret560#1 <= 2147483647;max3421_driver_init_~tmp~43#1 := max3421_driver_init_#t~ret560#1;havoc max3421_driver_init_#t~ret560#1;max3421_driver_init_#res#1 := max3421_driver_init_~tmp~43#1; {30642#true} is VALID [2022-02-20 21:58:21,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {30642#true} main_#t~ret587#1 := max3421_driver_init_#res#1;assume { :end_inline_max3421_driver_init } true;assume -2147483648 <= main_#t~ret587#1 && main_#t~ret587#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret587#1;havoc main_#t~ret587#1; {30642#true} is VALID [2022-02-20 21:58:21,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {30642#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_spi_driver_2 } true;havoc ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset, ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset;havoc ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset; {30642#true} is VALID [2022-02-20 21:58:21,724 INFO L272 TraceCheckUtils]: 31: Hoare triple {30642#true} call ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset := ldv_zalloc(1496); {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:21,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,727 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {30642#true} {30642#true} #1349#return; {30642#true} is VALID [2022-02-20 21:58:21,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {30642#true} ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset := ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset;havoc ldv_initialize_spi_driver_2_#t~ret572#1.base, ldv_initialize_spi_driver_2_#t~ret572#1.offset;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := ldv_initialize_spi_driver_2_~tmp~47#1.base, ldv_initialize_spi_driver_2_~tmp~47#1.offset; {30642#true} is VALID [2022-02-20 21:58:21,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {30642#true} assume { :end_inline_ldv_initialize_spi_driver_2 } true;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_initialize_hc_driver_3 } true;havoc ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset, ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset, ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset, ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset;havoc ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset;havoc ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset; {30642#true} is VALID [2022-02-20 21:58:21,728 INFO L272 TraceCheckUtils]: 38: Hoare triple {30642#true} call ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset := ldv_zalloc(192); {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:21,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,729 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {30642#true} {30642#true} #1351#return; {30642#true} is VALID [2022-02-20 21:58:21,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {30642#true} ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset := ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset;havoc ldv_initialize_hc_driver_3_#t~ret564#1.base, ldv_initialize_hc_driver_3_#t~ret564#1.offset;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := ldv_initialize_hc_driver_3_~tmp~45#1.base, ldv_initialize_hc_driver_3_~tmp~45#1.offset; {30642#true} is VALID [2022-02-20 21:58:21,729 INFO L272 TraceCheckUtils]: 44: Hoare triple {30642#true} call ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset := ldv_zalloc(968); {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:21,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {30680#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet37#1 && #t~nondet37#1 <= 2147483647;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {30642#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {30642#true} {30642#true} #1353#return; {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {30642#true} ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset := ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset;havoc ldv_initialize_hc_driver_3_#t~ret565#1.base, ldv_initialize_hc_driver_3_#t~ret565#1.offset;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := ldv_initialize_hc_driver_3_~tmp___0~24#1.base, ldv_initialize_hc_driver_3_~tmp___0~24#1.offset; {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {30642#true} assume { :end_inline_ldv_initialize_hc_driver_3 } true; {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {30642#true} assume !(0 != ~ldv_retval_0~0); {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {30642#true} assume -2147483648 <= main_#t~nondet583#1 && main_#t~nondet583#1 <= 2147483647;main_~tmp___7~3#1 := main_#t~nondet583#1;havoc main_#t~nondet583#1;main_#t~switch584#1 := 0 == main_~tmp___7~3#1; {30642#true} is VALID [2022-02-20 21:58:21,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {30642#true} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 1 == main_~tmp___7~3#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 54: Hoare triple {30642#true} assume !main_#t~switch584#1;main_#t~switch584#1 := main_#t~switch584#1 || 2 == main_~tmp___7~3#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {30642#true} assume main_#t~switch584#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {30642#true} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet588#1 && main_#t~nondet588#1 <= 2147483647;main_~tmp___9~2#1 := main_#t~nondet588#1;havoc main_#t~nondet588#1;main_#t~switch589#1 := 0 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 1 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 2 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 3 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 4 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 5 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 6 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 7 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,732 INFO L290 TraceCheckUtils]: 64: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 8 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 9 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {30642#true} assume !main_#t~switch589#1;main_#t~switch589#1 := main_#t~switch589#1 || 10 == main_~tmp___9~2#1; {30642#true} is VALID [2022-02-20 21:58:21,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {30642#true} assume main_#t~switch589#1; {30642#true} is VALID [2022-02-20 21:58:21,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {30642#true} assume 1 == ~ldv_state_variable_3~0; {30642#true} is VALID [2022-02-20 21:58:21,732 INFO L272 TraceCheckUtils]: 69: Hoare triple {30642#true} call main_#t~ret603#1 := max3421_urb_enqueue(~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset, ~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset, main_~ldvarg5~0#1); {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {30642#true} ~hcd#1.base, ~hcd#1.offset := #in~hcd#1.base, #in~hcd#1.offset;~urb#1.base, ~urb#1.offset := #in~urb#1.base, #in~urb#1.offset;~mem_flags#1 := #in~mem_flags#1;havoc ~spi~12#1.base, ~spi~12#1.offset;havoc ~tmp~35#1.base, ~tmp~35#1.offset;havoc ~max3421_hcd~26#1.base, ~max3421_hcd~26#1.offset;havoc ~tmp___0~19#1.base, ~tmp___0~19#1.offset;havoc ~max3421_ep~6#1.base, ~max3421_ep~6#1.offset;havoc ~flags~5#1;havoc ~retval~1#1;havoc ~tmp___1~10#1.base, ~tmp___1~10#1.offset;call #t~mem446#1.base, #t~mem446#1.offset := read~$Pointer$(~hcd#1.base, ~hcd#1.offset, 8); {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L272 TraceCheckUtils]: 71: Hoare triple {30642#true} call #t~ret447#1.base, #t~ret447#1.offset := to_spi_device(#t~mem446#1.base, #t~mem446#1.offset); {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L290 TraceCheckUtils]: 72: Hoare triple {30642#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~__mptr~0.base, ~__mptr~0.offset;havoc ~tmp~6.base, ~tmp~6.offset; {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L290 TraceCheckUtils]: 73: Hoare triple {30642#true} assume 0 != (~dev.base + ~dev.offset) % 18446744073709551616;~__mptr~0.base, ~__mptr~0.offset := ~dev.base, ~dev.offset;~tmp~6.base, ~tmp~6.offset := ~__mptr~0.base, ~__mptr~0.offset; {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {30642#true} #res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {30642#true} {30642#true} #1305#return; {30642#true} is VALID [2022-02-20 21:58:21,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {30642#true} ~tmp~35#1.base, ~tmp~35#1.offset := #t~ret447#1.base, #t~ret447#1.offset;havoc #t~mem446#1.base, #t~mem446#1.offset;havoc #t~ret447#1.base, #t~ret447#1.offset;~spi~12#1.base, ~spi~12#1.offset := ~tmp~35#1.base, ~tmp~35#1.offset; {30642#true} is VALID [2022-02-20 21:58:21,734 INFO L272 TraceCheckUtils]: 78: Hoare triple {30642#true} call #t~ret448#1.base, #t~ret448#1.offset := hcd_to_max3421(~hcd#1.base, ~hcd#1.offset); {30642#true} is VALID [2022-02-20 21:58:21,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {30642#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 899 + ~hcd.offset; {30642#true} is VALID [2022-02-20 21:58:21,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,734 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {30642#true} {30642#true} #1307#return; {30642#true} is VALID [2022-02-20 21:58:21,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {30642#true} ~tmp___0~19#1.base, ~tmp___0~19#1.offset := #t~ret448#1.base, #t~ret448#1.offset;havoc #t~ret448#1.base, #t~ret448#1.offset;~max3421_hcd~26#1.base, ~max3421_hcd~26#1.offset := ~tmp___0~19#1.base, ~tmp___0~19#1.offset;call #t~mem449#1 := read~int(~urb#1.base, 80 + ~urb#1.offset, 4);#t~switch450#1 := 1 == #t~mem449#1 / 1073741824; {30642#true} is VALID [2022-02-20 21:58:21,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {30642#true} assume #t~switch450#1; {30676#|max3421_urb_enqueue_#t~switch450#1|} is VALID [2022-02-20 21:58:21,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {30676#|max3421_urb_enqueue_#t~switch450#1|} #t~switch450#1 := #t~switch450#1 || 0 == #t~mem449#1 / 1073741824; {30676#|max3421_urb_enqueue_#t~switch450#1|} is VALID [2022-02-20 21:58:21,735 INFO L290 TraceCheckUtils]: 85: Hoare triple {30676#|max3421_urb_enqueue_#t~switch450#1|} assume !#t~switch450#1; {30643#false} is VALID [2022-02-20 21:58:21,735 INFO L290 TraceCheckUtils]: 86: Hoare triple {30643#false} #t~switch450#1 := true; {30643#false} is VALID [2022-02-20 21:58:21,735 INFO L290 TraceCheckUtils]: 87: Hoare triple {30643#false} assume #t~switch450#1; {30643#false} is VALID [2022-02-20 21:58:21,735 INFO L272 TraceCheckUtils]: 88: Hoare triple {30643#false} call ldv_spin_lock(); {30681#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 21:58:21,736 INFO L290 TraceCheckUtils]: 89: Hoare triple {30681#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {30642#true} is VALID [2022-02-20 21:58:21,736 INFO L290 TraceCheckUtils]: 90: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 21:58:21,736 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {30642#true} {30643#false} #1309#return; {30643#false} is VALID [2022-02-20 21:58:21,736 INFO L290 TraceCheckUtils]: 92: Hoare triple {30643#false} call #t~mem454#1.base, #t~mem454#1.offset := read~$Pointer$(~urb#1.base, 72 + ~urb#1.offset, 8);call #t~mem455#1.base, #t~mem455#1.offset := read~$Pointer$(#t~mem454#1.base, 31 + #t~mem454#1.offset, 8);~max3421_ep~6#1.base, ~max3421_ep~6#1.offset := #t~mem455#1.base, #t~mem455#1.offset;havoc #t~mem454#1.base, #t~mem454#1.offset;havoc #t~mem455#1.base, #t~mem455#1.offset; {30643#false} is VALID [2022-02-20 21:58:21,736 INFO L290 TraceCheckUtils]: 93: Hoare triple {30643#false} assume 0 == (~max3421_ep~6#1.base + ~max3421_ep~6#1.offset) % 18446744073709551616;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 40, ~mem_flags#1;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_~size#1, kzalloc_~flags#1;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1; {30643#false} is VALID [2022-02-20 21:58:21,736 INFO L272 TraceCheckUtils]: 94: Hoare triple {30643#false} call ldv_check_alloc_flags(kzalloc_~flags#1); {30643#false} is VALID [2022-02-20 21:58:21,736 INFO L290 TraceCheckUtils]: 95: Hoare triple {30643#false} ~flags := #in~flags; {30643#false} is VALID [2022-02-20 21:58:21,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {30643#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {30643#false} is VALID [2022-02-20 21:58:21,737 INFO L272 TraceCheckUtils]: 97: Hoare triple {30643#false} call ldv_error(); {30643#false} is VALID [2022-02-20 21:58:21,737 INFO L290 TraceCheckUtils]: 98: Hoare triple {30643#false} assume !false; {30643#false} is VALID [2022-02-20 21:58:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-02-20 21:58:21,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:21,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824838404] [2022-02-20 21:58:21,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824838404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:21,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:21,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:58:21,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41115000] [2022-02-20 21:58:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2022-02-20 21:58:21,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:21,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:58:21,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:21,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:58:21,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:58:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:58:21,798 INFO L87 Difference]: Start difference. First operand 2010 states and 2690 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:58:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:25,177 INFO L93 Difference]: Finished difference Result 4135 states and 5551 transitions. [2022-02-20 21:58:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:58:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2022-02-20 21:58:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:58:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1489 transitions. [2022-02-20 21:58:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:58:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1489 transitions. [2022-02-20 21:58:25,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1489 transitions. [2022-02-20 21:58:26,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1489 edges. 1489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:26,393 INFO L225 Difference]: With dead ends: 4135 [2022-02-20 21:58:26,393 INFO L226 Difference]: Without dead ends: 2155 [2022-02-20 21:58:26,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:58:26,397 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 286 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:26,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 1808 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 21:58:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2022-02-20 21:58:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2014. [2022-02-20 21:58:26,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:26,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2155 states. Second operand has 2014 states, 1535 states have (on average 1.3322475570032573) internal successors, (2045), 1544 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:26,447 INFO L74 IsIncluded]: Start isIncluded. First operand 2155 states. Second operand has 2014 states, 1535 states have (on average 1.3322475570032573) internal successors, (2045), 1544 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:26,450 INFO L87 Difference]: Start difference. First operand 2155 states. Second operand has 2014 states, 1535 states have (on average 1.3322475570032573) internal successors, (2045), 1544 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:26,599 INFO L93 Difference]: Finished difference Result 2155 states and 2883 transitions. [2022-02-20 21:58:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2883 transitions. [2022-02-20 21:58:26,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:26,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:26,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 2014 states, 1535 states have (on average 1.3322475570032573) internal successors, (2045), 1544 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) Second operand 2155 states. [2022-02-20 21:58:26,609 INFO L87 Difference]: Start difference. First operand has 2014 states, 1535 states have (on average 1.3322475570032573) internal successors, (2045), 1544 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) Second operand 2155 states. [2022-02-20 21:58:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:26,758 INFO L93 Difference]: Finished difference Result 2155 states and 2883 transitions. [2022-02-20 21:58:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2883 transitions. [2022-02-20 21:58:26,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:26,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:26,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:26,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 1535 states have (on average 1.3322475570032573) internal successors, (2045), 1544 states have internal predecessors, (2045), 323 states have call successors, (323), 156 states have call predecessors, (323), 155 states have return successors, (322), 320 states have call predecessors, (322), 322 states have call successors, (322) [2022-02-20 21:58:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2690 transitions. [2022-02-20 21:58:26,960 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2690 transitions. Word has length 99 [2022-02-20 21:58:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:26,960 INFO L470 AbstractCegarLoop]: Abstraction has 2014 states and 2690 transitions. [2022-02-20 21:58:26,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:58:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2690 transitions. [2022-02-20 21:58:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 21:58:26,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:26,964 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:58:26,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:58:26,965 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1573350354, now seen corresponding path program 1 times [2022-02-20 21:58:26,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:26,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930625816] [2022-02-20 21:58:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:58:27,076 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 21:58:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:58:27,231 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 21:58:27,232 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 21:58:27,232 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:58:27,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:58:27,237 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 21:58:27,239 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:58:27,331 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret573 := ldv_zalloc(1); [2022-02-20 21:58:27,332 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 21:58:27,338 INFO L158 Benchmark]: Toolchain (without parser) took 35780.52ms. Allocated memory was 111.1MB in the beginning and 450.9MB in the end (delta: 339.7MB). Free memory was 73.7MB in the beginning and 238.5MB in the end (delta: -164.8MB). Peak memory consumption was 173.8MB. Max. memory is 16.1GB. [2022-02-20 21:58:27,338 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory was 69.0MB in the beginning and 68.9MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:58:27,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1371.61ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 73.4MB in the beginning and 66.4MB in the end (delta: 7.0MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2022-02-20 21:58:27,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.19ms. Allocated memory is still 136.3MB. Free memory was 66.4MB in the beginning and 52.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 21:58:27,339 INFO L158 Benchmark]: Boogie Preprocessor took 138.38ms. Allocated memory was 136.3MB in the beginning and 205.5MB in the end (delta: 69.2MB). Free memory was 52.2MB in the beginning and 144.5MB in the end (delta: -92.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-02-20 21:58:27,339 INFO L158 Benchmark]: RCFGBuilder took 1465.36ms. Allocated memory is still 205.5MB. Free memory was 144.5MB in the beginning and 141.1MB in the end (delta: 3.4MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2022-02-20 21:58:27,340 INFO L158 Benchmark]: TraceAbstraction took 32651.79ms. Allocated memory was 205.5MB in the beginning and 450.9MB in the end (delta: 245.4MB). Free memory was 141.1MB in the beginning and 238.5MB in the end (delta: -97.4MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. [2022-02-20 21:58:27,341 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory was 69.0MB in the beginning and 68.9MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1371.61ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 73.4MB in the beginning and 66.4MB in the end (delta: 7.0MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.19ms. Allocated memory is still 136.3MB. Free memory was 66.4MB in the beginning and 52.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.38ms. Allocated memory was 136.3MB in the beginning and 205.5MB in the end (delta: 69.2MB). Free memory was 52.2MB in the beginning and 144.5MB in the end (delta: -92.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1465.36ms. Allocated memory is still 205.5MB. Free memory was 144.5MB in the beginning and 141.1MB in the end (delta: 3.4MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32651.79ms. Allocated memory was 205.5MB in the beginning and 450.9MB in the end (delta: 245.4MB). Free memory was 141.1MB in the beginning and 238.5MB in the end (delta: -97.4MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 21:58:27,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 92cb918a49bd861dcff82a05c4e06551bd9d0c0cbb9eb8fadf6410a0f7818165 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:58:29,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:58:29,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:58:29,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:58:29,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:58:29,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:58:29,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:58:29,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:58:29,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:58:29,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:58:29,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:58:29,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:58:29,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:58:29,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:58:29,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:58:29,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:58:29,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:58:29,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:58:29,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:58:29,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:58:29,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:58:29,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:58:29,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:58:29,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:58:29,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:58:29,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:58:29,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:58:29,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:58:29,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:58:29,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:58:29,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:58:29,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:58:29,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:58:29,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:58:29,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:58:29,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:58:29,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:58:29,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:58:29,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:58:29,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:58:29,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:58:29,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-02-20 21:58:29,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:58:29,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:58:29,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:58:29,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:58:29,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:58:29,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:58:29,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:58:29,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:58:29,114 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:58:29,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:58:29,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:58:29,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:58:29,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 21:58:29,116 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:58:29,124 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:58:29,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:58:29,124 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 21:58:29,124 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92cb918a49bd861dcff82a05c4e06551bd9d0c0cbb9eb8fadf6410a0f7818165 [2022-02-20 21:58:29,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:58:29,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:58:29,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:58:29,393 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:58:29,393 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:58:29,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i [2022-02-20 21:58:29,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab62daf74/c87ca320c6764572aabbc90994b3256b/FLAG5a21718cd [2022-02-20 21:58:30,073 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:58:30,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i [2022-02-20 21:58:30,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab62daf74/c87ca320c6764572aabbc90994b3256b/FLAG5a21718cd [2022-02-20 21:58:30,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab62daf74/c87ca320c6764572aabbc90994b3256b [2022-02-20 21:58:30,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:58:30,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:58:30,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:58:30,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:58:30,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:58:30,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:58:30" (1/1) ... [2022-02-20 21:58:30,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3450e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:30, skipping insertion in model container [2022-02-20 21:58:30,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:58:30" (1/1) ... [2022-02-20 21:58:30,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:58:30,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:58:30,934 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3714] [2022-02-20 21:58:30,938 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3715-3716] [2022-02-20 21:58:31,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i[111905,111918] [2022-02-20 21:58:31,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:58:31,568 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 21:58:31,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:58:31,642 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3714] [2022-02-20 21:58:31,642 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3715-3716] [2022-02-20 21:58:31,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i[111905,111918] [2022-02-20 21:58:31,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:58:31,828 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:58:31,899 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3714] [2022-02-20 21:58:31,900 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3715-3716] [2022-02-20 21:58:31,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i[111905,111918] [2022-02-20 21:58:32,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:58:32,109 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:58:32,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32 WrapperNode [2022-02-20 21:58:32,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:58:32,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:58:32,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:58:32,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:58:32,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,269 INFO L137 Inliner]: procedures = 178, calls = 1019, calls flagged for inlining = 80, calls inlined = 51, statements flattened = 1492 [2022-02-20 21:58:32,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:58:32,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:58:32,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:58:32,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:58:32,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:58:32,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:58:32,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:58:32,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:58:32,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (1/1) ... [2022-02-20 21:58:32,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:58:32,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:58:32,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:58:32,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:58:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 21:58:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_map_urb_for_dma [2022-02-20 21:58:32,451 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_map_urb_for_dma [2022-02-20 21:58:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-02-20 21:58:32,451 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-02-20 21:58:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-02-20 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure wake_up_process [2022-02-20 21:58:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure wake_up_process [2022-02-20 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:58:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-02-20 21:58:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-02-20 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:58:32,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:58:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-02-20 21:58:32,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-02-20 21:58:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_hub_control [2022-02-20 21:58:32,453 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_hub_control [2022-02-20 21:58:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_urb_dequeue [2022-02-20 21:58:32,453 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_urb_dequeue [2022-02-20 21:58:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:58:32,453 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:58:32,454 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-02-20 21:58:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-02-20 21:58:32,454 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_endpoint_disable [2022-02-20 21:58:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_endpoint_disable [2022-02-20 21:58:32,454 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:58:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:58:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:58:32,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:58:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u16 [2022-02-20 21:58:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:58:32,455 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:58:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_reset [2022-02-20 21:58:32,455 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_reset [2022-02-20 21:58:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_urb_enqueue [2022-02-20 21:58:32,455 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_urb_enqueue [2022-02-20 21:58:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:58:32,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:58:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:58:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_bus_resume [2022-02-20 21:58:32,457 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_bus_resume [2022-02-20 21:58:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:58:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_gpout_set_value [2022-02-20 21:58:32,458 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_gpout_set_value [2022-02-20 21:58:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:58:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:58:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 21:58:32,458 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 21:58:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-02-20 21:58:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-02-20 21:58:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_stop [2022-02-20 21:58:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_stop [2022-02-20 21:58:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:58:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 21:58:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 21:58:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 21:58:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-02-20 21:58:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:58:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 21:58:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:58:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_unmap_urb_for_dma [2022-02-20 21:58:32,461 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_unmap_urb_for_dma [2022-02-20 21:58:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 21:58:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 21:58:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-02-20 21:58:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:58:32,461 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:58:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure to_spi_device [2022-02-20 21:58:32,461 INFO L138 BoogieDeclarations]: Found implementation of procedure to_spi_device [2022-02-20 21:58:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_hcd [2022-02-20 21:58:32,461 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_hcd [2022-02-20 21:58:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_bus_suspend [2022-02-20 21:58:32,462 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_bus_suspend [2022-02-20 21:58:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_get_frame_number [2022-02-20 21:58:32,462 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_get_frame_number [2022-02-20 21:58:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:58:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:58:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure max3421_hub_status_data [2022-02-20 21:58:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure max3421_hub_status_data [2022-02-20 21:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_max3421 [2022-02-20 21:58:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_max3421 [2022-02-20 21:58:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 21:58:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 21:58:32,804 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:58:32,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:58:32,982 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:58:38,588 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:58:38,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:58:38,599 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:58:38,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:58:38 BoogieIcfgContainer [2022-02-20 21:58:38,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:58:38,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:58:38,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:58:38,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:58:38,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:58:30" (1/3) ... [2022-02-20 21:58:38,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15199f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:58:38, skipping insertion in model container [2022-02-20 21:58:38,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:32" (2/3) ... [2022-02-20 21:58:38,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15199f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:58:38, skipping insertion in model container [2022-02-20 21:58:38,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:58:38" (3/3) ... [2022-02-20 21:58:38,606 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--host--max3421-hcd.ko-entry_point.cil.out.i [2022-02-20 21:58:38,610 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:58:38,610 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:58:38,643 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:58:38,647 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:58:38,647 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:58:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 535 states, 395 states have (on average 1.379746835443038) internal successors, (545), 405 states have internal predecessors, (545), 105 states have call successors, (105), 34 states have call predecessors, (105), 33 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-02-20 21:58:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 21:58:38,684 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:38,685 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:58:38,685 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:38,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1460430108, now seen corresponding path program 1 times [2022-02-20 21:58:38,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:58:38,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296628920] [2022-02-20 21:58:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:38,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:58:38,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:58:38,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:58:38,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 21:58:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:39,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:58:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:39,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:58:39,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(101bv64, 2bv64);call #Ultimate.allocInit(20bv64, 3bv64);call #Ultimate.allocInit(20bv64, 4bv64);call #Ultimate.allocInit(50bv64, 5bv64);call #Ultimate.allocInit(21bv64, 6bv64);call #Ultimate.allocInit(12bv64, 7bv64);call #Ultimate.allocInit(29bv64, 8bv64);call #Ultimate.allocInit(221bv64, 9bv64);call #Ultimate.allocInit(23bv64, 10bv64);call #Ultimate.allocInit(23bv64, 11bv64);call #Ultimate.allocInit(29bv64, 12bv64);call #Ultimate.allocInit(12bv64, 13bv64);call #Ultimate.allocInit(21bv64, 14bv64);call #Ultimate.allocInit(221bv64, 15bv64);call #Ultimate.allocInit(23bv64, 16bv64);call #Ultimate.allocInit(23bv64, 17bv64);call #Ultimate.allocInit(21bv64, 18bv64);call #Ultimate.allocInit(12bv64, 19bv64);call #Ultimate.allocInit(21bv64, 20bv64);call #Ultimate.allocInit(221bv64, 21bv64);call #Ultimate.allocInit(33bv64, 22bv64);call #Ultimate.allocInit(33bv64, 23bv64);call #Ultimate.allocInit(21bv64, 24bv64);call #Ultimate.allocInit(12bv64, 25bv64);call #Ultimate.allocInit(21bv64, 26bv64);call #Ultimate.allocInit(221bv64, 27bv64);call #Ultimate.allocInit(33bv64, 28bv64);call #Ultimate.allocInit(33bv64, 29bv64);call #Ultimate.allocInit(21bv64, 30bv64);call #Ultimate.allocInit(12bv64, 31bv64);call #Ultimate.allocInit(21bv64, 32bv64);call #Ultimate.allocInit(221bv64, 33bv64);call #Ultimate.allocInit(33bv64, 34bv64);call #Ultimate.allocInit(33bv64, 35bv64);call #Ultimate.allocInit(21bv64, 36bv64);call #Ultimate.allocInit(50bv64, 37bv64);call #Ultimate.allocInit(25bv64, 38bv64);call #Ultimate.allocInit(31bv64, 39bv64);call #Ultimate.allocInit(20bv64, 40bv64);call #Ultimate.allocInit(10bv64, 41bv64);call #Ultimate.allocInit(20bv64, 42bv64);call #Ultimate.allocInit(12bv64, 43bv64);call #Ultimate.allocInit(20bv64, 44bv64);call #Ultimate.allocInit(43bv64, 45bv64);call #Ultimate.allocInit(221bv64, 46bv64);call #Ultimate.allocInit(15bv64, 47bv64);call #Ultimate.allocInit(40bv64, 48bv64);call #Ultimate.allocInit(19bv64, 49bv64);call #Ultimate.allocInit(29bv64, 50bv64);call #Ultimate.allocInit(50bv64, 51bv64);call #Ultimate.allocInit(20bv64, 52bv64);call #Ultimate.allocInit(12bv64, 53bv64);call #Ultimate.allocInit(24bv64, 54bv64);call #Ultimate.allocInit(221bv64, 55bv64);call #Ultimate.allocInit(32bv64, 56bv64);call #Ultimate.allocInit(32bv64, 57bv64);call #Ultimate.allocInit(12bv64, 58bv64);call #Ultimate.allocInit(20bv64, 59bv64);call #Ultimate.allocInit(221bv64, 60bv64);call #Ultimate.allocInit(11bv64, 61bv64);call #Ultimate.allocInit(11bv64, 62bv64);call #Ultimate.allocInit(12bv64, 63bv64);call #Ultimate.allocInit(20bv64, 64bv64);call #Ultimate.allocInit(221bv64, 65bv64);call #Ultimate.allocInit(10bv64, 66bv64);call #Ultimate.allocInit(10bv64, 67bv64);call #Ultimate.allocInit(12bv64, 68bv64);call #Ultimate.allocInit(20bv64, 69bv64);call #Ultimate.allocInit(221bv64, 70bv64);call #Ultimate.allocInit(37bv64, 71bv64);call #Ultimate.allocInit(37bv64, 72bv64);call #Ultimate.allocInit(8bv64, 73bv64);call #Ultimate.allocInit(35bv64, 74bv64);call #Ultimate.allocInit(24bv64, 75bv64);call #Ultimate.allocInit(32bv64, 76bv64);call #Ultimate.allocInit(29bv64, 77bv64);call #Ultimate.allocInit(29bv64, 78bv64);call #Ultimate.allocInit(19bv64, 79bv64);call #Ultimate.allocInit(45bv64, 80bv64);call #Ultimate.allocInit(19bv64, 81bv64);call #Ultimate.allocInit(8bv64, 82bv64);call #Ultimate.allocInit(26bv64, 83bv64);call #Ultimate.allocInit(40bv64, 84bv64);call #Ultimate.allocInit(12bv64, 85bv64);~ldv_irq_1_2~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~ldv_irq_1_3~0 := 0bv32;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0bv64, 0bv64;~ldv_irq_1_1~0 := 0bv32;~ldv_irq_1_0~0 := 0bv32;~max3421_hcd_desc_group0~0.base, ~max3421_hcd_desc_group0~0.offset := 0bv64, 0bv64;~ldv_irq_line_1_3~0 := 0bv32;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~max3421_hcd_desc_group1~0.base, ~max3421_hcd_desc_group1~0.offset := 0bv64, 0bv64;~ldv_state_variable_3~0 := 0bv32;~ldv_irq_line_1_0~0 := 0bv32;~ldv_state_variable_2~0 := 0bv32;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0bv64, 0bv64;~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_irq_line_1_1~0 := 0bv32;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0bv64, 0bv64;~ldv_state_variable_1~0 := 0bv32;~ldv_irq_line_1_2~0 := 0bv32;~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset := 86bv64, 0bv64;call #Ultimate.allocInit(8bv64, 86bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8bv64);~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset := 87bv64, 0bv64;call #Ultimate.allocInit(64bv64, 87bv64);call write~init~intINTTYPE4(0bv32, ~#hrsl_to_error~0.base, ~#hrsl_to_error~0.offset, 4bv64);call write~init~intINTTYPE4(4294967274bv32, ~#hrsl_to_error~0.base, ~bvadd64(4bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967274bv32, ~#hrsl_to_error~0.base, ~bvadd64(8bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967274bv32, ~#hrsl_to_error~0.base, ~bvadd64(12bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967285bv32, ~#hrsl_to_error~0.base, ~bvadd64(16bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967264bv32, ~#hrsl_to_error~0.base, ~bvadd64(20bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967212bv32, ~#hrsl_to_error~0.base, ~bvadd64(24bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967225bv32, ~#hrsl_to_error~0.base, ~bvadd64(28bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967175bv32, ~#hrsl_to_error~0.base, ~bvadd64(32bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967225bv32, ~#hrsl_to_error~0.base, ~bvadd64(36bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967225bv32, ~#hrsl_to_error~0.base, ~bvadd64(40bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967212bv32, ~#hrsl_to_error~0.base, ~bvadd64(44bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967291bv32, ~#hrsl_to_error~0.base, ~bvadd64(48bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967291bv32, ~#hrsl_to_error~0.base, ~bvadd64(52bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967234bv32, ~#hrsl_to_error~0.base, ~bvadd64(56bv64, ~#hrsl_to_error~0.offset), 4bv64);call write~init~intINTTYPE4(4294967221bv32, ~#hrsl_to_error~0.base, ~bvadd64(60bv64, ~#hrsl_to_error~0.offset), 4bv64);~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset := 88bv64, 0bv64;call #Ultimate.allocInit(340bv64, 88bv64);call write~init~$Pointer$(73bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, 8bv64);call write~init~$Pointer$(74bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(8bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~intINTTYPE8(192bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(16bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(24bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~intINTTYPE4(16bv32, ~#max3421_hcd_desc~0.base, ~bvadd64(32bv64, ~#max3421_hcd_desc~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~max3421_reset.base, #funAddr~max3421_reset.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(36bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_start.base, #funAddr~max3421_start.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(44bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(52bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(60bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_stop.base, #funAddr~max3421_stop.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(68bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(76bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_get_frame_number.base, #funAddr~max3421_get_frame_number.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(84bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_urb_enqueue.base, #funAddr~max3421_urb_enqueue.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(92bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_urb_dequeue.base, #funAddr~max3421_urb_dequeue.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(100bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_map_urb_for_dma.base, #funAddr~max3421_map_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(108bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_unmap_urb_for_dma.base, #funAddr~max3421_unmap_urb_for_dma.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(116bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_endpoint_disable.base, #funAddr~max3421_endpoint_disable.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(124bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(132bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_hub_status_data.base, #funAddr~max3421_hub_status_data.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(140bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_hub_control.base, #funAddr~max3421_hub_control.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(148bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_bus_suspend.base, #funAddr~max3421_bus_suspend.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(156bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_bus_resume.base, #funAddr~max3421_bus_resume.offset, ~#max3421_hcd_desc~0.base, ~bvadd64(164bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(172bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(180bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(188bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(196bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(204bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(212bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(220bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(228bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(236bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(244bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(252bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(260bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(268bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(276bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(284bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(292bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(300bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(308bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(316bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(324bv64, ~#max3421_hcd_desc~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_hcd_desc~0.base, ~bvadd64(332bv64, ~#max3421_hcd_desc~0.offset), 8bv64);~#max3421_driver~0.base, ~#max3421_driver~0.offset := 89bv64, 0bv64;call #Ultimate.allocInit(161bv64, 89bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~#max3421_driver~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~max3421_probe.base, #funAddr~max3421_probe.offset, ~#max3421_driver~0.base, ~bvadd64(8bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~max3421_remove.base, #funAddr~max3421_remove.offset, ~#max3421_driver~0.base, ~bvadd64(16bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(24bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(32bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(40bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(85bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(48bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(56bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#max3421_driver~0.base, ~bvadd64(64bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(72bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#max3421_driver~0.base, ~bvadd64(80bv64, ~#max3421_driver~0.offset), 1bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(81bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(89bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(97bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(105bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(113bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(121bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(129bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(137bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(145bv64, ~#max3421_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#max3421_driver~0.base, ~bvadd64(153bv64, ~#max3421_driver~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~ldv_retval_2~0 := 0bv32;~ldv_spin~0 := 0bv32; {538#true} is VALID [2022-02-20 21:58:39,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret549#1.base, main_#t~ret549#1.offset, main_#t~ret550#1, main_#t~ret551#1, main_#t~ret552#1.base, main_#t~ret552#1.offset, main_#t~ret553#1, main_#t~ret554#1.base, main_#t~ret554#1.offset, main_#t~nondet555#1, main_#t~ret556#1, main_#t~nondet557#1, main_#t~nondet558#1, main_#t~nondet559#1, main_#t~switch560#1, main_#t~nondet561#1, main_#t~switch562#1, main_#t~ret563#1, main_#t~nondet564#1, main_#t~switch565#1, main_#t~ret566#1, main_#t~ret567#1, main_#t~ret568#1, main_#t~ret569#1, main_#t~ret570#1, main_#t~ret571#1, main_#t~ret572#1, main_#t~ret573#1, main_#t~ret574#1, main_#t~ret575#1, main_#t~ret576#1, main_#t~ret577#1, main_#t~ret578#1, main_#t~ret579#1, main_#t~ret580#1, main_#t~ret581#1, main_#t~ret582#1, main_#t~ret583#1, main_#t~ret584#1, main_#t~nondet585#1, main_#t~switch586#1, main_#t~ret587#1, main_#t~ret588#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~ldvarg3~0#1, main_~tmp___0~25#1, main_~ldvarg0~0#1, main_~tmp___1~13#1, main_~ldvarg5~0#1, main_~ldvarg6~0#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~ldvarg1~0#1, main_~tmp___3~5#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset, main_~ldvarg9~0#1, main_~tmp___5~4#1, main_~ldvarg2~0#1, main_~tmp___6~4#1, main_~tmp___7~3#1, main_~tmp___8~3#1, main_~tmp___9~2#1, main_~tmp___10~1#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~25#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~13#1;havoc main_~ldvarg5~0#1;havoc main_~ldvarg6~0#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___3~5#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;havoc main_~ldvarg9~0#1;havoc main_~tmp___5~4#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___6~4#1;havoc main_~tmp___7~3#1;havoc main_~tmp___8~3#1;havoc main_~tmp___9~2#1;havoc main_~tmp___10~1#1; {538#true} is VALID [2022-02-20 21:58:39,382 INFO L272 TraceCheckUtils]: 2: Hoare triple {538#true} call main_#t~ret549#1.base, main_#t~ret549#1.offset := ldv_zalloc(1bv64); {538#true} is VALID [2022-02-20 21:58:39,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {538#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:58:39,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {538#true} assume 0bv32 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0bv64, 0bv64; {538#true} is VALID [2022-02-20 21:58:39,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:58:39,383 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {538#true} {538#true} #1335#return; {538#true} is VALID [2022-02-20 21:58:39,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret549#1.base, main_#t~ret549#1.offset;havoc main_#t~ret549#1.base, main_#t~ret549#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_#t~ret550#1 := __VERIFIER_nondet_u16();main_~tmp___0~25#1 := main_#t~ret550#1;havoc main_#t~ret550#1;main_~ldvarg3~0#1 := main_~tmp___0~25#1;call main_#t~ret551#1 := __VERIFIER_nondet_u16();main_~tmp___1~13#1 := main_#t~ret551#1;havoc main_#t~ret551#1;main_~ldvarg0~0#1 := main_~tmp___1~13#1; {538#true} is VALID [2022-02-20 21:58:39,384 INFO L272 TraceCheckUtils]: 8: Hoare triple {538#true} call main_#t~ret552#1.base, main_#t~ret552#1.offset := ldv_zalloc(72bv64); {538#true} is VALID [2022-02-20 21:58:39,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:58:39,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#true} assume 0bv32 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0bv64, 0bv64; {538#true} is VALID [2022-02-20 21:58:39,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:58:39,384 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {538#true} {538#true} #1337#return; {538#true} is VALID [2022-02-20 21:58:39,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {538#true} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret552#1.base, main_#t~ret552#1.offset;havoc main_#t~ret552#1.base, main_#t~ret552#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;call main_#t~ret553#1 := __VERIFIER_nondet_u16();main_~tmp___3~5#1 := main_#t~ret553#1;havoc main_#t~ret553#1;main_~ldvarg1~0#1 := main_~tmp___3~5#1; {538#true} is VALID [2022-02-20 21:58:39,385 INFO L272 TraceCheckUtils]: 14: Hoare triple {538#true} call main_#t~ret554#1.base, main_#t~ret554#1.offset := ldv_zalloc(1bv64); {538#true} is VALID [2022-02-20 21:58:39,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;~tmp___0~1#1 := #t~nondet37#1;havoc #t~nondet37#1; {538#true} is VALID [2022-02-20 21:58:39,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume 0bv32 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0bv64, 0bv64; {538#true} is VALID [2022-02-20 21:58:39,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#true} assume true; {538#true} is VALID [2022-02-20 21:58:39,386 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {538#true} {538#true} #1339#return; {538#true} is VALID [2022-02-20 21:58:39,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {538#true} main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset := main_#t~ret554#1.base, main_#t~ret554#1.offset;havoc main_#t~ret554#1.base, main_#t~ret554#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___4~4#1.base, main_~tmp___4~4#1.offset;main_~tmp___5~4#1 := main_#t~nondet555#1;havoc main_#t~nondet555#1;main_~ldvarg9~0#1 := main_~tmp___5~4#1;call main_#t~ret556#1 := __VERIFIER_nondet_u16();main_~tmp___6~4#1 := main_#t~ret556#1;havoc main_#t~ret556#1;main_~ldvarg2~0#1 := main_~tmp___6~4#1;assume { :begin_inline_ldv_initialize } true; {538#true} is VALID [2022-02-20 21:58:39,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {538#true} assume { :end_inline_ldv_initialize } true;main_~ldvarg5~0#1 := main_#t~nondet557#1;havoc main_#t~nondet557#1;main_~ldvarg6~0#1 := main_#t~nondet558#1;havoc main_#t~nondet558#1;~ldv_state_variable_1~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32;~ldv_state_variable_3~0 := 0bv32;~ldv_state_variable_2~0 := 0bv32; {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 21:58:39,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} main_~tmp___7~3#1 := main_#t~nondet559#1;havoc main_#t~nondet559#1;main_#t~switch560#1 := 0bv32 == main_~tmp___7~3#1; {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 21:58:39,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume !main_#t~switch560#1;main_#t~switch560#1 := main_#t~switch560#1 || 1bv32 == main_~tmp___7~3#1; {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 21:58:39,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume !main_#t~switch560#1;main_#t~switch560#1 := main_#t~switch560#1 || 2bv32 == main_~tmp___7~3#1; {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 21:58:39,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume !main_#t~switch560#1;main_#t~switch560#1 := main_#t~switch560#1 || 3bv32 == main_~tmp___7~3#1; {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 21:58:39,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume main_#t~switch560#1; {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 21:58:39,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {603#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume 0bv32 != ~ldv_state_variable_2~0;main_~tmp___10~1#1 := main_#t~nondet585#1;havoc main_#t~nondet585#1;main_#t~switch586#1 := 0bv32 == main_~tmp___10~1#1; {539#false} is VALID [2022-02-20 21:58:39,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {539#false} assume main_#t~switch586#1; {539#false} is VALID [2022-02-20 21:58:39,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {539#false} assume 1bv32 == ~ldv_state_variable_2~0;assume { :begin_inline_max3421_probe } true;max3421_probe_#in~spi#1.base, max3421_probe_#in~spi#1.offset := ~max3421_driver_group0~0.base, ~max3421_driver_group0~0.offset;havoc max3421_probe_#res#1;havoc max3421_probe_#t~ret496#1, max3421_probe_#t~nondet497#1, max3421_probe_#t~ret498#1.base, max3421_probe_#t~ret498#1.offset, max3421_probe_#t~ret499#1.base, max3421_probe_#t~ret499#1.offset, max3421_probe_#t~nondet500#1, max3421_probe_#t~ret501#1.base, max3421_probe_#t~ret501#1.offset, max3421_probe_#t~mem502#1.base, max3421_probe_#t~mem502#1.offset, max3421_probe_#t~ret503#1.base, max3421_probe_#t~ret503#1.offset, max3421_probe_#t~mem504#1.base, max3421_probe_#t~mem504#1.offset, max3421_probe_#t~nondet505#1, max3421_probe_#t~ret506#1.base, max3421_probe_#t~ret506#1.offset, max3421_probe_#t~mem507#1.base, max3421_probe_#t~mem507#1.offset, max3421_probe_#t~nondet508#1, max3421_probe_#t~nondet509#1.base, max3421_probe_#t~nondet509#1.offset, max3421_probe_#t~ret510#1, max3421_probe_#t~ret511#1, max3421_probe_#t~ret512#1.base, max3421_probe_#t~ret512#1.offset, max3421_probe_#t~mem513#1.base, max3421_probe_#t~mem513#1.offset, max3421_probe_#t~nondet514#1, max3421_probe_#t~ret515#1, max3421_probe_#t~nondet516#1, max3421_probe_#t~mem517#1, max3421_probe_#t~ret518#1, max3421_probe_#t~nondet519#1, max3421_probe_#t~mem520#1, max3421_probe_#t~mem521#1.base, max3421_probe_#t~mem521#1.offset, max3421_probe_#t~mem522#1.base, max3421_probe_#t~mem522#1.offset, max3421_probe_#t~mem523#1.base, max3421_probe_#t~mem523#1.offset, max3421_probe_#t~mem524#1.base, max3421_probe_#t~mem524#1.offset, max3421_probe_#t~ret525#1, max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset, max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset, max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset, max3421_probe_~retval~5#1, max3421_probe_~tmp~42#1, max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset, max3421_probe_~tmp___1~12#1.base, max3421_probe_~tmp___1~12#1.offset, max3421_probe_~tmp___2~5#1.base, max3421_probe_~tmp___2~5#1.offset, max3421_probe_~__k~0#1.base, max3421_probe_~__k~0#1.offset, max3421_probe_~tmp___3~4#1.base, max3421_probe_~tmp___3~4#1.offset, max3421_probe_~tmp___4~3#1, max3421_probe_~tmp___5~3#1, max3421_probe_~tmp___6~3#1.base, max3421_probe_~tmp___6~3#1.offset;max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset := max3421_probe_#in~spi#1.base, max3421_probe_#in~spi#1.offset;havoc max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset;havoc max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset;havoc max3421_probe_~retval~5#1;havoc max3421_probe_~tmp~42#1;havoc max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset;havoc max3421_probe_~tmp___1~12#1.base, max3421_probe_~tmp___1~12#1.offset;havoc max3421_probe_~tmp___2~5#1.base, max3421_probe_~tmp___2~5#1.offset;havoc max3421_probe_~__k~0#1.base, max3421_probe_~__k~0#1.offset;havoc max3421_probe_~tmp___3~4#1.base, max3421_probe_~tmp___3~4#1.offset;havoc max3421_probe_~tmp___4~3#1;havoc max3421_probe_~tmp___5~3#1;havoc max3421_probe_~tmp___6~3#1.base, max3421_probe_~tmp___6~3#1.offset;max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset := 0bv64, 0bv64;max3421_probe_~retval~5#1 := 4294967284bv32;assume { :begin_inline_spi_setup } true;spi_setup_#in~arg0#1.base, spi_setup_#in~arg0#1.offset := max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset;havoc spi_setup_#res#1;havoc spi_setup_#t~nondet606#1, spi_setup_~arg0#1.base, spi_setup_~arg0#1.offset;spi_setup_~arg0#1.base, spi_setup_~arg0#1.offset := spi_setup_#in~arg0#1.base, spi_setup_#in~arg0#1.offset;spi_setup_#res#1 := spi_setup_#t~nondet606#1;havoc spi_setup_#t~nondet606#1; {539#false} is VALID [2022-02-20 21:58:39,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {539#false} max3421_probe_#t~ret496#1 := spi_setup_#res#1;assume { :end_inline_spi_setup } true;max3421_probe_~tmp~42#1 := max3421_probe_#t~ret496#1;havoc max3421_probe_#t~ret496#1; {539#false} is VALID [2022-02-20 21:58:39,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {539#false} assume !~bvslt32(max3421_probe_~tmp~42#1, 0bv32);assume { :begin_inline_dev_name } true;dev_name_#in~dev#1.base, dev_name_#in~dev#1.offset := max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset;havoc dev_name_#res#1.base, dev_name_#res#1.offset;havoc dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset, dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset, dev_name_#t~ret45#1.base, dev_name_#t~ret45#1.offset, dev_name_~dev#1.base, dev_name_~dev#1.offset, dev_name_~tmp~5#1.base, dev_name_~tmp~5#1.offset;dev_name_~dev#1.base, dev_name_~dev#1.offset := dev_name_#in~dev#1.base, dev_name_#in~dev#1.offset;havoc dev_name_~tmp~5#1.base, dev_name_~tmp~5#1.offset;call dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset := read~$Pointer$(dev_name_~dev#1.base, ~bvadd64(293bv64, dev_name_~dev#1.offset), 8bv64); {539#false} is VALID [2022-02-20 21:58:39,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {539#false} assume 0bv64 != ~bvadd64(dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset);havoc dev_name_#t~mem43#1.base, dev_name_#t~mem43#1.offset;call dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset := read~$Pointer$(dev_name_~dev#1.base, ~bvadd64(293bv64, dev_name_~dev#1.offset), 8bv64);dev_name_#res#1.base, dev_name_#res#1.offset := dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset;havoc dev_name_#t~mem44#1.base, dev_name_#t~mem44#1.offset; {539#false} is VALID [2022-02-20 21:58:39,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {539#false} max3421_probe_#t~ret498#1.base, max3421_probe_#t~ret498#1.offset := dev_name_#res#1.base, dev_name_#res#1.offset;assume { :end_inline_dev_name } true;max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset := max3421_probe_#t~ret498#1.base, max3421_probe_#t~ret498#1.offset;havoc max3421_probe_#t~ret498#1.base, max3421_probe_#t~ret498#1.offset;assume { :begin_inline_usb_create_hcd } true;usb_create_hcd_#in~arg0#1.base, usb_create_hcd_#in~arg0#1.offset, usb_create_hcd_#in~arg1#1.base, usb_create_hcd_#in~arg1#1.offset, usb_create_hcd_#in~arg2#1.base, usb_create_hcd_#in~arg2#1.offset := ~#max3421_hcd_desc~0.base, ~#max3421_hcd_desc~0.offset, max3421_probe_~spi#1.base, max3421_probe_~spi#1.offset, max3421_probe_~tmp___0~23#1.base, max3421_probe_~tmp___0~23#1.offset;havoc usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset;havoc usb_create_hcd_#t~ret609#1.base, usb_create_hcd_#t~ret609#1.offset, usb_create_hcd_~arg0#1.base, usb_create_hcd_~arg0#1.offset, usb_create_hcd_~arg1#1.base, usb_create_hcd_~arg1#1.offset, usb_create_hcd_~arg2#1.base, usb_create_hcd_~arg2#1.offset;usb_create_hcd_~arg0#1.base, usb_create_hcd_~arg0#1.offset := usb_create_hcd_#in~arg0#1.base, usb_create_hcd_#in~arg0#1.offset;usb_create_hcd_~arg1#1.base, usb_create_hcd_~arg1#1.offset := usb_create_hcd_#in~arg1#1.base, usb_create_hcd_#in~arg1#1.offset;usb_create_hcd_~arg2#1.base, usb_create_hcd_~arg2#1.offset := usb_create_hcd_#in~arg2#1.base, usb_create_hcd_#in~arg2#1.offset; {539#false} is VALID [2022-02-20 21:58:39,391 INFO L272 TraceCheckUtils]: 33: Hoare triple {539#false} call usb_create_hcd_#t~ret609#1.base, usb_create_hcd_#t~ret609#1.offset := ldv_malloc(899bv64); {539#false} is VALID [2022-02-20 21:58:39,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {539#false} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet34;havoc #t~nondet34; {539#false} is VALID [2022-02-20 21:58:39,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {539#false} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {539#false} is VALID [2022-02-20 21:58:39,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {539#false} assume true; {539#false} is VALID [2022-02-20 21:58:39,392 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {539#false} {539#false} #1409#return; {539#false} is VALID [2022-02-20 21:58:39,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {539#false} usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset := usb_create_hcd_#t~ret609#1.base, usb_create_hcd_#t~ret609#1.offset;havoc usb_create_hcd_#t~ret609#1.base, usb_create_hcd_#t~ret609#1.offset; {539#false} is VALID [2022-02-20 21:58:39,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {539#false} max3421_probe_#t~ret499#1.base, max3421_probe_#t~ret499#1.offset := usb_create_hcd_#res#1.base, usb_create_hcd_#res#1.offset;assume { :end_inline_usb_create_hcd } true;max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset := max3421_probe_#t~ret499#1.base, max3421_probe_#t~ret499#1.offset;havoc max3421_probe_#t~ret499#1.base, max3421_probe_#t~ret499#1.offset; {539#false} is VALID [2022-02-20 21:58:39,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {539#false} assume !(0bv64 == ~bvadd64(max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset));assume { :begin_inline_set_bit } true;set_bit_#in~nr#1, set_bit_#in~addr#1.base, set_bit_#in~addr#1.offset := 2bv64, max3421_probe_~hcd~2#1.base, ~bvadd64(531bv64, max3421_probe_~hcd~2#1.offset);havoc set_bit_~nr#1, set_bit_~addr#1.base, set_bit_~addr#1.offset;set_bit_~nr#1 := set_bit_#in~nr#1;set_bit_~addr#1.base, set_bit_~addr#1.offset := set_bit_#in~addr#1.base, set_bit_#in~addr#1.offset; {539#false} is VALID [2022-02-20 21:58:39,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {539#false} assume { :end_inline_set_bit } true; {539#false} is VALID [2022-02-20 21:58:39,393 INFO L272 TraceCheckUtils]: 42: Hoare triple {539#false} call max3421_probe_#t~ret501#1.base, max3421_probe_#t~ret501#1.offset := hcd_to_max3421(max3421_probe_~hcd~2#1.base, max3421_probe_~hcd~2#1.offset); {539#false} is VALID [2022-02-20 21:58:39,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {539#false} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, ~bvadd64(899bv64, ~hcd.offset); {539#false} is VALID [2022-02-20 21:58:39,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {539#false} assume true; {539#false} is VALID [2022-02-20 21:58:39,394 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {539#false} {539#false} #1411#return; {539#false} is VALID [2022-02-20 21:58:39,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {539#false} max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset := max3421_probe_#t~ret501#1.base, max3421_probe_#t~ret501#1.offset;havoc max3421_probe_#t~ret501#1.base, max3421_probe_#t~ret501#1.offset;call max3421_probe_#t~mem502#1.base, max3421_probe_#t~mem502#1.offset := read~$Pointer$(~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8bv64);call write~$Pointer$(max3421_probe_#t~mem502#1.base, max3421_probe_#t~mem502#1.offset, max3421_probe_~max3421_hcd~33#1.base, ~bvadd64(76bv64, max3421_probe_~max3421_hcd~33#1.offset), 8bv64);havoc max3421_probe_#t~mem502#1.base, max3421_probe_#t~mem502#1.offset;call write~$Pointer$(max3421_probe_~max3421_hcd~33#1.base, max3421_probe_~max3421_hcd~33#1.offset, ~#max3421_hcd_list~0.base, ~#max3421_hcd_list~0.offset, 8bv64); {539#false} is VALID [2022-02-20 21:58:39,394 INFO L272 TraceCheckUtils]: 47: Hoare triple {539#false} call INIT_LIST_HEAD(max3421_probe_~max3421_hcd~33#1.base, ~bvadd64(93bv64, max3421_probe_~max3421_hcd~33#1.offset)); {539#false} is VALID [2022-02-20 21:58:39,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {539#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset;call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 8bv64);call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd64(8bv64, ~list.offset), 8bv64); {539#false} is VALID [2022-02-20 21:58:39,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {539#false} assume true; {539#false} is VALID [2022-02-20 21:58:39,395 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {539#false} {539#false} #1413#return; {539#false} is VALID [2022-02-20 21:58:39,395 INFO L272 TraceCheckUtils]: 51: Hoare triple {539#false} call max3421_probe_#t~ret503#1.base, max3421_probe_#t~ret503#1.offset := kmalloc(2bv64, 208bv32); {539#false} is VALID [2022-02-20 21:58:39,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {539#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {539#false} is VALID [2022-02-20 21:58:39,395 INFO L272 TraceCheckUtils]: 53: Hoare triple {539#false} call ldv_check_alloc_flags(~flags#1); {539#false} is VALID [2022-02-20 21:58:39,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {539#false} ~flags := #in~flags; {539#false} is VALID [2022-02-20 21:58:39,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {539#false} assume !(0bv32 == ~ldv_spin~0 || 0bv32 == ~bvand32(16bv32, ~flags)); {539#false} is VALID [2022-02-20 21:58:39,396 INFO L272 TraceCheckUtils]: 56: Hoare triple {539#false} call ldv_error(); {539#false} is VALID [2022-02-20 21:58:39,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-02-20 21:58:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 21:58:39,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:58:39,398 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:58:39,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296628920] [2022-02-20 21:58:39,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296628920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:39,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:39,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:58:39,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041900178] [2022-02-20 21:58:39,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-02-20 21:58:39,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:39,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:58:39,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:39,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:58:39,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:58:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:58:39,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:58:39,519 INFO L87 Difference]: Start difference. First operand has 535 states, 395 states have (on average 1.379746835443038) internal successors, (545), 405 states have internal predecessors, (545), 105 states have call successors, (105), 34 states have call predecessors, (105), 33 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)